Binary Decision Diagrams

作者: Akers

DOI: 10.1109/TC.1978.1675141

关键词: Computer scienceBinary decision diagramData structureBoolean functionLogic synthesisActivity diagramStory-driven modelingBlock diagramTheoretical computer scienceImplementationSystem testingDiagram

摘要: This paper describes a method for defining, analyzing, testing, and implementing large digital functions by means of binary decision diagram. diagram provides complete, concise, "implementation-free" description the involved. Methods are described deriving these diagrams examples given number basic combinational sequential devices. Techniques then outlined using to analyze involved, test generation, obtaining various implementations. It is shown that especially suited processing computer. Finally, methods introducing inversion directly "interconnecting" define still larger functions. An example carry look-ahead adder included.

参考文章(8)
J. David Irwin, B. D. Carroll, H. T. Nagel, An Introduction to Computer Logic Prentice Hall Professional Technical Reference. ,(1974)
S.M. Reddy, Complete Test Sets for Logic Functions IEEE Transactions on Computers. ,vol. C-22, pp. 1016- 1020 ,(1973) , 10.1109/T-C.1973.223638
D. B. Armstrong, On Finding a Nearly Minimal Set of Fault Detection Tests for Combinational Logic Nets IEEE Transactions on Electronic Computers. ,vol. EC-15, pp. 66- 73 ,(1966) , 10.1109/PGEC.1966.264376
Donald R. Haring, Multi-threshold threshold elements IEEE Transactions on Electronic Computers. ,vol. EC-15, pp. 45- 65 ,(1966) , 10.1109/PGEC.1966.264375
Sheldon B. Akers, Universal Test Sets for Logic Networks IEEE Transactions on Computers. ,vol. C-22, pp. 835- 839 ,(1973) , 10.1109/TC.1973.5009174
Robert P. Abelson, Frank Harary, Robert Z. Norman, Dorwin Cartwright, Structural Models: An Introduction to the Theory of Directed Graphs. Journal of the American Statistical Association. ,vol. 61, pp. 875- ,(1966) , 10.2307/2282802