Binary Decision Diagrams
Akers · IEEE Transactions on Computers · 1978
This paper describes a method for defining, analyzing, testing, and implementing large digital functions by means of a binary decision diagram. This diagram provides a complete, concise, "implementation-free" description of the digital functions involved. Methods are described for deriving these diagrams and examples are given for a number of basic combinational and sequential devices. Techniques are then outlined for using the diagrams to analyze the functions involved, for test generation, and for obtaining various implementations. It is shown that the diagrams are especially suited for processing by a computer. Finally, methods are described for introducing inversion and for directly "interconnecting" diagrams to define still larger functions. An example of the carry look-ahead adder is included.
Cited by 1,828 works. doi:10.1109/tc.1978.1675141
Authors
References
- The Theory of Graphs and Its Applications
- Structural Models: An Introduction to the Theory of Directed Graphs.
- The Theory of Graphs and its Applications.
- On Finding a Nearly Minimal Set of Fault Detection Tests for Combinational Logic Nets
- Table errata: The art of computer programming, Vol. 2: Seminumerical algorithms (Addison-Wesley, Reading, Mass., 1969) by Donald E. Knuth
- An Introduction to Computer Logic
- Multi-threshold threshold elements
- Complete Test Sets for Logic Functions
- Universal Test Sets for Logic Networks