Boolean analysis of MOS circuits (1987)
| Venue: | IEEE Transactions on Computer-aided Design |
| Citations: | 57 - 14 self |
BibTeX
@ARTICLE{Bryant87booleananalysis,
author = {Randal E. Bryant},
title = {Boolean analysis of MOS circuits},
journal = {IEEE Transactions on Computer-aided Design},
year = {1987},
volume = {6},
pages = {634--649}
}
Years of Citing Articles
OpenURL
Abstract
The switch-level model represents a digital metal-oxide semiconductor (MOS) circuit as a network of charge storage nodes connected by resistive transistor switches. The functionality of such a network can be expressed as a series of systems of Boolean equations. Solving these equations symbolically yields a set of Boolean formulas that describe the mapping from input and current state to the new network state. This analysis supports the same class of networks as the switch-level simulator MOSSIM II and provides the same functionality, including the handling of bidirectional e ects and indeterminate (X) logic values. In the worst case, the analysis of an n node network can yield a set of formulas containing a total of O(n 3) operations. However, all but a limited set of dense, pass-transistor networks give formulas with O(n) total operations. The analysis can serve as the basis of e cient programs for a variety oflogic design tasks, including: logic simulation (on both conventional and special purpose computers), fault simulation, test generation, and symbolic veri cation.







