Boolean function representation and spectral characterization using AND/OR graphs

Integration, the VLSI Journal

Volumn 29, Issue 2, 2000, Pages 101-116

  Zuzek A ^a   Drechsler, R ^b   Thornton, M A ^c  

^a JO EF STEFAN INSTITUTE   (Slovenia)

^b UNIVERSITY OF FREIBURG   (Germany)

^c MISSISSIPPI STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER AIDED DESIGN; GRAPH THEORY; LEARNING SYSTEMS; PROBABILITY; RECURSIVE FUNCTIONS;

DECISION DIAGRAMS (DD);

VLSI CIRCUITS;

EID: 0342468766     PISSN: 01679260     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-9260(00)00003-1     Document Type: Article

References (26)

1. S. Malik, A.R. Wang, R.K. Brayton, A. Sangiovanni-Vincentelli, Logic verification using binary decision diagrams in a logic synthesis environment, Proceedings of ICCAD, 1988, pp. 6-9.
2. B. Becker, R. Drechsler, Decision diagrams in synthesis - algorithms, applications and extensions, VLSI Design Conference, 1997, pp. 46-50.
3. R.E. Bryant, Graph-based algorithms for Boolean function manipulation, IEEE Trans. Comput. 8 (35) (1986) pp. 677-691.
4. Bryant R.E. On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. IEEE Trans. Comput. 40:1991;205-213.
5. D. Stoffel, W. Kunz, S. Gerbe, AND / OR reasoning graphs for determining prime implicants in multi-level combinational networks, Proceedings of ASP Design Automation Conference, 1997.
6. R. Drechsler, W. Kunz, D. Stoffel, A. Žužek, Decision diagrams and AND / OR graphs for design automation problems, Proceedings of the International Conference on Information, Communication and Signal Processing, 1997, pp. 67-72.
7. Kunz W., Stoffel D. Reasoning in Boolean Networks, Logic Synthesis and Verification Using Testing Techniques. 1997;Kluwer Academic Publishers, Boston, MA.
8. Biasizzo A., Žužek A., Novak F. Sequential diagnosis with asymmetrical tests. Comput. J. 41(3):1998;163-170.
9. R. Drechsler, A. Žužek, Efficient functional diagnosis for synchronous sequential circuits based on and / or graphs, Proceedings of the International Symposium on IC Technologies, Systems and Applications, 1997, pp. 312-315.
10. W. Kunz, D.K. Pradhan, Recursive learning: a new implication technique for efficient solutions of CAD problems: test, verification and optimization, IEEE Trans. CAD Vol. 13 (9) (1994) 1143-1158.
11. F. Brglez, H. Fujiwara, A Neutral Netlist of 10 Combinational Circuits and a Target Translator in FORTRAN, Proceedings of the International Conference on Circuits and Systems, 1985, pp. 663-698.
12. S. Minato, N. Ishiura, S. Yajima, Shared binary decision diagram with attributed edges for efficient Boolean function manipulation, Proceedings of the ACM / IEEE Design Automation Conference, 1990, pp. 52-57.
13. K.S. Brace, R.L Rudell, R.E. Bryant, Efficient implementation of a BDD package, Proceedings of Design Automation Conference, 1990, pp. 40-45.
14. Krishnamurthy B., Tollis I.G. Improved techniques for estimating signal probabilities. IEEE Trans. Comput. 38(7):1989;1245-1251.
15. Miller D.M. An improved method for computing a generalized spectral coefficient. IEEE Trans. CAD. / ICAS CAD-17(3):1998;233-238.
16. Thornton M.A., Nair V.S.S. Efficient Calculation of Spectral Coefficients and Their Applications. IEEE Trans. CAD. / ICAS 14(11):1995;1328-1341.
17. Hurst S.L., Miller D.M., Muzio J.C. Spectral Techniques in Digital Logic. 1985;Academic Press, Orlando, FL.
18. Besslich P.W., Karpovsky (Eds.) M.G. Spectral Techniques and Fault Detection. 1985;Academic Press, Boston, MA.
19. Cooley J.W., Tukey J.W. An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19:1965;297-301.
20. Shanks J.L. Computation of the fast Walsh-Fourier transform. IEEE Trans. Comput. C-18:1969;457-459.
21. Davio M., Deschamps J.-P., Thayse A. Discrete and Switching Functions. 1978;Mc-Graw-Hill, New York.
22. Green D. Modern Logic Design. 1986;Addison-Wesley, Reading, MA.
23. M.A. Thornton, V.S.S. Nair, Fast Reed-Muller spectrum computation using output probabilities. Proceedings of the IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, August 1995, pp. 281-287.
24. M.A. Thornton, Modified Haar transform calculation using digital circuit output probabilities, Proceedings of the International Conference on Information, Communication and Signal Processing, 1997, pp. 52-58.
25. S.C. Seth, L. Pan, V.D. Agrawal, PREDICT-probabilistic estimation of digital circuit t testability. Proceedings of the Fault Tolerant Computing Symposium, 1985, pp. 220-225.
26. Parker K.P., McCluskey E.J. Probabilistic treatment of general combinational networks. IEEE Trans. Comput. c-24:1975;668-670.