## Algorithmic Aspects of Symbolic Switch Network Analysis (1987)

Venue: | IEEE Trans. CAD/IC |

Citations: | 16 - 5 self |

### BibTeX

@ARTICLE{Bryant87algorithmicaspects,

author = {Randal E. Bryant},

title = {Algorithmic Aspects of Symbolic Switch Network Analysis},

journal = {IEEE Trans. CAD/IC},

year = {1987},

volume = {6},

pages = {618--633}

}

### OpenURL

### 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.