Algorithmic Aspects of Symbolic Switch Network Analysis
The work
| Authors | Randal E. Bryant |
|---|---|
| Editors | |
| Type | article |
| Year | 1987 |
| Citekey | bryant1987algorithmic |
Where it appeared
| Published in | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems |
|---|---|
| Publisher | Institute of Electrical and Electronics Engineers |
| Volume | 6 |
| Issue | 4 |
| Pages | 618--633 |
Identifiers
| DOI | 10.1109/tcad.1987.1270309 |
|---|---|
| OpenAlex | W1972403558 |
Related
| Distinct from | bryant1981switchlevel |
|---|---|
| Distinct from | bryant1982mossim |
| Distinct from | bryant1985symbolic |
| Distinct from | bryant1986graphbased |
| Distinct from | bryant1987boolean |
| Distinct from | bryant1987cosmos |
| Distinct from | ebergen1989translating |
| Distinct from | seger1995formal |
| Distinct from | slobodova2011flexible |
From OpenAlex, which stores abstracts as an index of words and their positions: what is shown is rebuilt from that, and reads fluently whether or not it is what the author wrote.
Abstract
A network of switches controlled by Boolean variables can be represented as a system of Boolean equations. The solution of this system gives a symbolic description of the conducting paths in the network. Gaussian elimination provides an efficient technique for solving sparse systems of Boolean equations. For the class of networks that arise when analyzing digital metal-oxide semiconductor (MOS) circuits, a simple pivot selection rule guarantees that most s switch networks encountered in practice can be solved with O(s) operations. When represented by a directed acyclic graph, the set of Boolean formulas generated by the analysis has total size bounded by the number of operations required by the Gaussian elimination. This paper presents the mathematical basis for systems of Boolean equations, their solution by Gaussian elimination, and data structures and algorithms for representing and manipulating Boolean formulas.
A copy is held
pdf, 380.3 kB. Not published — it may be under copyright. The facts and links here are.
How it got here
| How it got here | agent via openalex |
|---|---|
| Added | 2026-09-16 09:16 UTC |
| Approved by | a person 2026-09-23 14:13 UTC |
Filed under
Cite it as
@article{bryant1987algorithmic,
title = {Algorithmic Aspects of Symbolic Switch Network Analysis},
author = {Randal E. Bryant},
year = {1987},
journal = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
publisher = {Institute of Electrical and Electronics Engineers},
volume = {6},
number = {4},
pages = {618--633},
doi = {10.1109/tcad.1987.1270309},
}
This record lives at https://refs.drheap.org/bryant1987algorithmic/ and will keep doing so.