Algorithms for Technology Mapping Based on Binary Decision Diagrams and on Boolean Operations

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 12, Issue 5, 1993, Pages 599-620

  Mailhot, Frédéric ^a   De Micheli, Giovanni ^b  

^a SYNOPSYS INC   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTER AIDED DESIGN; DECISION THEORY; LOGIC DESIGN;

BINARY DECISION DIAGRAMS; BOOLEAN OPERATIONS; DON'T-CARE CONDITIONS;

LOGIC CIRCUITS;

EID: 0027591119     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.277607     Document Type: Article

References (43)

1. R. K. Brayton, R. Rudell, A. Sangiovanni-Vincentelli, and A. R. Wang, “Mis: A multiple-level logic optimization system,” IEEE Trans. Computer-Aided Design, vol. 6, pp. 1062–1081, Nov. 1987.
2. D. Bostick, G. D. Hachtel, R. Jacoby, M. R. Lightner, P. Moceyunas, C. R. Morrison, and D. Ravenscroft, “The Boulder optimal logic design system,” in Int. Conf. Computer-Aided Design, IEEE, pp. 62–69, Nov. 1987.
3. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Free-man, 1979.
4. J. Darringer, D. Brand, W. Joyner, and L. Trevillyan, “Lss: A sys tem for production logic synthesis,” IBM J. Res. Develop., Sept. 1984.
5. D. Gregory, K. Bartlett, A. de Geus, and G. Hachtel, “Socrates: A system for automatically synthesizing and optimizing combinational logic,” in 23rd Design Automation Conf., IEEE/ACM, pp. 79–85, 1986.
6. M. R. C. M. Berkelaar and J. A. G. Jess, “Technology mapping for standard-cell generators,” in Int. Conf. Computer-Aided Design, IEEE, pp. 470–473, Nov. 1988.
7. E. Detjens, G. Gannot, R. L. Rudell, A. Sangiovanni-Vincentelli, and A. R. Wang, “Technology mapping in mis,” in Int. Conf. Computer-Aided Design, IEEE, pp. 116–119, Nov. 1987.
8. K. Keutzer, “Dagon: Technology binding and local optimization by dag matching,” in 24th Design Automation Conf, IEEE/ACM, pp. 341–347, 1987.
9. M. C. Lega, “Mapping properties of multi-level logic synthesis operations,” in Int. Conf. Computer Design, IEEE, pp. 257–261, Oct. 1988.
10. R. Lisanke, F. Brglez, and G. Kedem, “Mcmap: A fast technology mapping procedure for multi-level logic synthesis,” in Int. Conf. Computer Design, IEEE, pp. 252–256, Oct. 1988.
11. C. R. Morrison, R. M. Jacoby, and G. D. Hachtel, “Techmap: Technology mapping with delay and area optimization,” in Logic and Architecture Synthesis for Silicon Compilers, G. Saucier and P. M. McLellan, Eds. New York: North-Holland, 1989, pp. 53–64.
12. R. Rudell, “Logic synthesis for VLSI design,” Ph.D. dissertation, U. C. Berkeley (Memorandum UCB/ERL M89/49), Apr. 1989.
13. S. B. Akers, “Binary decision diagrams,” IEEE Trans. Computers, vol. 27, pp. 509–516, June 1978.
14. R. E. Bryant, “Graph-based algorithms for Boolean function manipulation,” IEEE Trans. Computers, vol. 35, pp. 677–691, Aug. 1986.
15. S. Muroga, Threshold Logic and its Applications. New York: John Wiley, 1971.
16. K. S. Brace, R. L. Rudell, and R. E. Bryant, “Efficient implementation of a bdd package,” in Design Automation Conf., IEEE, pp. 40–45, June 1990.
17. R. K. Brayton, G. D. Hachtel, C. T. McMullen, and A. Sangiovanni-Vincentelli, Logic Minimization Algorithms for VLSI Synthesis. Norwell, MA: Kluwer Academic Publishers, 1984.
18. E. J. McCluskey, “Detection of group invariance or total symmetry of a Boolean function,” Bell Syst. Tech J., vol. 35, pp. 1445–1453, Nov. 1956.
19. D. S. Reeves and G. Kedem, “Variable matching for verification,” MCNC Tech. Rep. TR90-15, Apr. 1990.
20. S. L. Hurst, D. M. Miller, and J. C. Muzio, Spectral Techniques in Digital Logic. San Diego, CA: Academic Press, 1985.
21. C. L. Liu, Elements of Discrete Mathematics. Neww York: McGraw-Hill, 1977.
22. E. J. McCluskey, Logic Design Principles with Emphasis on Testable Semicustom Circuits. New York: Prentice-Hall, 1986.
23. K. A. Bartlett, R. K. Brayton, G. D. Hachtel, R. M. Jacoby, C. R. Morrison, R. L. Rudell, A. Sangiovanni-Vincentelli, and A. R. Wang, “Multilevel logic minimization using implicit don't cares,” IEEE Trans. Computer-Aided Design, vol. 7, pp. 723–740, June 1988.
24. P. McGeer and R. K. Brayton, “Consistency and observability invariance in multi-level logic synthesis,” in Int. Conf. Computer-Aided Design, IEEE, pp. 426–429, Nov. 1989.
25. R. K. Brayton, R. Camposano, G. De Micheli, R. H. J. M. Otten, and J. T. J. an Eijindhoven, “The Yorktown silicon compiler system,” in Silicon Compilation, D. Gajski, Ed. Reading, MA: Addison-Wesley, 1988.
26. O. Coudert, C. Berthet, and J. Madre, “Verification of sequential machines based on symbolic execution,” in Lecture Notes in Computer Science No. 407: International Workshop on Automatic Verification Methods for Finite State Systems, Grenoble, 12–14 Jun. 1989, J. Sifakis, Ed. New York: Springer-Verlag, 1990.
27. H. Savoj, R.K. Brayton, and H. Touati, “The use of image computation techniques in extracting local don't cares and network optimization,” in Int. Conf Computer-Aided Design, IEEE, Nov. 1991.
28. H. Savoj, Private communication, Apr. 1991.
29. F. Mailhot, “Technology mapping for VLSI circuits exploiting Boolean properties and operations,” Ph.D. dissertation, Stanford University, Dec. 1991.
30. K. C. Chen and S. Muroga, “Sylon-dream: A multi-level network synthesizer,” in Int. Conf. Computer-Aided Design, IEEE, pp. 552–555, Nov. 1989.
31. H. Savoj and R. K. Brayton, “The use of observability and external don't cares for the simplification of multi-level networks,” in Design Automation Conf., ACM/IEEE, pp. 297–301, June 1990.
32. M. Damiani and G. D. Micheli, “Derivation of don't care conditions by perturbation analysis of combinational multiple-level logic circuits,” in Int. Workshop Logic Synth., MCNC, p. 6.1a, May 1991.
33. M. Damiani and G. D. Micheli, “Observability don't care sets and Boolean relations,” in Int. Conf. Computer-Aided Design, IEEE, pp. 502–505, Nov. 1990.
34. R. R. Fritzemeir, J. Soden, R. K. Treece, and C. Hawkins, “Increased CMOS IC stuck-at fault coverage with reduced I DDQ test sets,” in Int. Test Conf., IEEE, pp. 427–435, 1960.
35. T. J. Chakraborty, S. Bhawmik, and C. J. Lin, “Enhanced controllability for I DDQ test sets using partial scan,” in Design Automation Conf., ACM/IEEE, pp. 278–281, June 1991.
36. D. Bryan, F. Brglez, and R. Lisanke, “Redundancy identification and removal,” in Int. Workshop Logic Synth., MCNC, p. 8.3, May 1989.
37. R. Hitchcock, G. Smith, and D. Cheng, “Timing analysis of computer hardware,” IBM J. Res. Develop., vol. 26, pp. 100–105, Jan. 1982.
38. G. De Micheli, “Performance-oriented synthesis in the Yorktown silicon compiler,” IEEE Trans. Computer-Aided Design, pp. 751–765, Sept. 1987.
39. G. De Micheli, “Synchronous logic synthesis,” in Int. Workshop Logic Synth., MCNC, p. 5.2, May 1989.
40. R. Rudell, “Technology mapping for delay,” in Int. Workshop Logic Synth., MCNC, p. 8.2, May 1989.
41. K. J. Singh, A. R. Wang, R. Brayton, and A. Sangiovanni-Vincentelli, “Timing optimization of combinational logic,” in Int. Conf. Computer-Aided Design, IEEE, pp. 282–285, Nov. 1988.
42. P. G. Paulin and F. J. Poirot, “Logic decomposition algorithms for the timing optimization of multi-level logic,” in 26th Design Automation Conf., IEEE/ACM, pp. 329–333, June 1989.
43. G. De Micheli, D. Ku, F. Mailhot, and T. Truong, “the Olympus synthesis system,” IEEE Design and Test, pp. 37–53, Oct. 1990.