Multilevel Logic Synthesis

Proceedings of the IEEE

Volumn 78, Issue 2, 1990, Pages 264-300

  Brayton, R K ^a   Hachtel, G D ^b   Sangiovanni Vincentelli, A L ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SWITCHING THEORY--COMBINATORIAL SWITCHING;

LOGIC SYNTHESIS TECHNIQUES; MULTILEVEL COMBINATIONAL LOGIC;

LOGIC CIRCUITS, COMBINATORIAL;

EID: 0025386807     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/5.52213     Document Type: Article

References (98)

1. A. Aho and M. Corasick, " Efficient string matching: An aid to bibliographic search," Commun. ACM, pp. 333–340, June 1975
2. A. Aho and S.Johnson, " Optimal code generation for expression trees," J. ACM, pp. 488–501, July 1976.
3. R. L. Ashenhurst, " the decomposition of switching functions," in Proc. Int. Symp. Theory of Switching Functions, Apr. 1959.
4. K. Bartlett, D. Bostick, C. Hachtel, R. Jacoby, M. Lightner, P. Moceyunas, C. Morrison, and D. Ravenscroft, " Bold: A multiple-level logic optimization system," in Proc. IEEE Int. Conf. on Computer Aided Design, 1987.
5. K. Bartlett, W. Cohen, A. de Geus, and G. Hachtel, " Synthesis and optimization of multilevel logic under timing constraints," IEEE Trans. CAD IC, vol. CAD-5, Oct. 1986.
6. K. A. Bartlett, R. Brayton, C. Hachtel, R. Jacoby, C. Morrison, R. Rudell, A Sangiovanni-Vincentelli, and A. Wang, " Multilevel logic minimization using implicit don't cares," IEEE Trans. Comput. Aided Design Integr. Circuits Syst. vol. CAD-7, no. 6, pp. 723–740, June 1988.
7. C. L. Berman and J. L. Carter, " The fanout problem: From theory to practice," in Advanced Research in VLSI: Proceeding of the 1989 Decennial Caltech Conference, C. L. Seitz, Ed. MIT Press, May 1989, pp. 69–99.
8. L. Berman and L. Trevillyan, " A global approach to circuit size reduction," in Advanced Research in VLSI, 5th MIT Conference. MIT Press, 1988, pp. 203–214.
9. D. Brand, " Redundancy and don't cares in logic synthesis," IEEE Trans. Comput., vol. C-32, no. 10, pp. 947–952, Oct. 1983.
10. D. Brand, " Logic synthesis," in NATO ASI on Logic Synthesis and Silicon Compilation for VLSI, P. Antognetti, C. DeMicheli, and A. Sangiovanni-Vincentelli, Eds. The Netherlands: Kluwer and Dordrecht, 1987.
11. D. Brand, " PLA-based synthesis without PLA'S," in Proc. Int. Workshop on Logic Synthesis, May 1989.
12. R. Brayton, " Factoring logic functions," IBMJ. Res. Develop., vol. 31, no. 2, pp. 187–198, Mar. 1987.
13. R. Brayton, N. Brenner, C. Chen, G. Hachtel, C. McMullen, and R. Otten, " The Yorktown silicon compiler," in Proc. Int. Symp. Circ. Syst. (ISCAS-85), pp. 391–394, June 1985.
14. R. Brayton, R. Camposano, G. De Micheli, R. Otten, and J. van Eijndhoven, " The Yorktown silicon compiler," in Silicon Complication, D. Gajski, Ed. Addison-Wesley, 1988.
15. R. Brayton and C. McMullen, " Synthesis and optimization of multistage logic," in Proc. Int. Conf. Comp. Des. (ICCD-84), pp. 23–28, 1984.
16. R. Brayton, R. Rudell, A. Sangiovanni-Vincentelli, and A. Wang, " MIS: Multiple-level interactive logic optimization system," IEEE Trans. Comput. Aided Design Integr. Circuits Syst., vol. CAD-6, no. 6, pp. 1062–1081, Nov. 1987.
17. R. Brayton, R. Rudell, A. Sangiovanni-Vincentelli, and A. Wang, " Multi-level logic optimization and the rectangular covering problem," in Proc. IEEE Int. Conf. on CAD (ICCAD), Nov. 1987.
18. R. Brayton, R. Rudell, A. Sangiovanni-Vincentelli, and A. Wang, " Multi-level logic synthesis," notes for lectures at Oxford/ Berkeley Summer Engineering Programme, July 1989.
19. R. Brayton, E. Sentovich, and F. Somenzi, " Don't-cares and global flow analysis of Boolean networks," in Proc. Int. Conf. CAD (ICCAD-88), Nov. 1988, pp. 98–101.
20. R. Brayton and F. Somenzi, " Boolean relations and incomplete specification of logic networks," in Int. Conference on Very Large Scale Integration, Aug. 1989.
21. R. Brayton and F. Somenzi, " Minimization of Boolean relations," in Proc. Int. Symp. Circ. Syst. (ISCAS-89), May 1989.
22. R. K. Brayton, G. D. Hachtel, C. McMullen, and A. Sangiovanni-Vincentelli, Logic Minimization Algorithms for VLSI Synthesis. Boston: Kluwer Academic Publishers, 1984.
23. R. K. Brayton and Curt McMullen, " The decomposition and factorization of Boolean expressions," in Proc. Int. Symp. Circ. Syst. (ISCAS-82), Rome, May 1982.
24. R. K. Brayton, " Algorithms for multilevel logic synthesis and optimization," in NATO ASI on Logic Synthesis and Silicon Compilation for VLSI, G. DeMicheli et al., Eds. Dordrecht, The Netherlands: Kluwer, 1987.
25. M. A. Breuer and A. D. Friedman, Diagnosis and Reliable Design of Digital Systems. Woodland Hills, CA: Computer Science Press, 1976.
26. F. Brglez, " Testability characterization of embedded modules via logic minimization," in Proc. Int. Workshop on Logic Synthesis, Research Triangle Park, May 1987.
27. F. Brglez, D. Bryan, J. Calhoun, G. Kedem, and R. Lisanke, " Automated synthesis for testability," IEEE Trans. Ind. Electron. vol. IE-56, May 1989.
28. D. Bryan, F. Brglez, and R. Lisanke, " Redundancy identification and removal," in Proc. Int. Workshop on Logic Synthesis, Research Triangle Park, May 1989.
29. R. E. Bryant, " Symbolic manipulation of boolean functions using a graphical representation," in Proc. 22nd Design Automation Conf., July 1985.
30. J. Calhoun and F. Brglez, " A framework for hierarchical test generation: Version 1.0," technical report 89–06, Microelectronics Center of North Carolina, P.O. Box 12889, Research Triangle Park, NC 27709, Jan. 1989.
31. J. Calhoun, D. Bryan, and F. Brglez, " Automatic test pattern generation (ATPG) for scan-based digital logic: Version 1.0," technical report 17, Microelectronics Center of North Carolina, P.O. Box 12889, Research Triangle Park, NC 27709, Dec. 1987.
32. K-T. Cheng and V. D. Agrawal, " State assignment for initial-izable synthesis," in Proc. Int. Conf. Computer Aided Design (ICCAD-89), Nov. 1989.
33. H. Cho, G. Hachtel, R. Jacoby, and P. Moceyunas, " Test pattern generation in logic optimization," in Proc. Int. Conf. Computer Aided Design (ICCAD-89), Nov. 1989.
34. H. Curtis, " Generalized treecircuit—The basic building block of an extended decomposition theory," J. ACM, vol. 8, pp. 562–581, 1961.
35. J. Darringer, D. Brand, J. Gerbi, W. Joyner, and L. Trevillyan, " LSS: A system for production logic synthesis," IBM J. Res. Develop., vol. 28, no. 5, pp. 537–545, Sept. 1984.
36. J. Darringer, W. Joyner, L. Berman, and L. Trevillyan, " Logic synthesis through local transformations," IBM J. Res. Develop., vol. 25, no. 4, pp. 272–280, July 1981.
37. Edwards S. Davidson," An algorithm for nand decomposition under network constraints," IEEE Trans. Computers, vol. C-18, Dec. 1969.
38. E. Detjens, G. Gannot, R. Rudell, A. Sangiovanni-Vincentelli, and A. Wang, " Technology mapping in MIS," in Proc. Int. Conf. CAD (ICCAD-87), Nov. 1987, pp. 116–119.
39. S. Devadas and K. Keutzer, " Boolean minimization and algebraic factorization procedures for fully testable sequential machines," in Proc. Int. Conf. Computer Aided Design (ICCAD-89), Nov. 1989.
40. D. Dietmeyer and Y. Su, " Logic design automation of fan-in limited nand networks," IEEE Trans. Comp., vol. C-18, no. 1, pp. 11–22, Jan. 1969.
41. D. M. Du, " Variable transformation—A new approach to synthesizing combinational switching circuits," in Proc. Workshop on Microelectronic and Information Syst., Dec. 1986, pp. 441–461.
42. H. Fujiwara, Logic Testing and Design for Testability, M.I.T. Press Series in Computer Systems. Cambridge, MA: The M.I.T. Press, 1985.
43. H. Fujiwara and T. Shimono, " On the acceleration of test generation algorithms," IEEE Trans. Computers, pp. 1137–1144, Dec. 1983.
44. P. Goel, " An implicit enumeration algorithm to generate tests for combinational logic circuits," IEEE Trans. Computers, vol. C-30, no. 3, pp. 215–222, 1981.
45. D. Gregory, personal communication, Apr. 1988.
46. D. Gregory, K. Bartlett, A. de Geus,and G. Hachtel, " Socrates: A system for automatically synthesizing and optimizing combinational logic," in Proc. 23th Design Automation Conf., June 1986, pp. 79–85.
47. G. Hachtel, R. Jacoby, K. Keutzer, and C. Morrison, " On the relationship between area optimization and multifault testability of multilevel logic," in Proc. Int. Conf. Computer Aided Design (ICCAD-89), Nov. 1989.
48. G. Hachtel, R. Jacoby, and P. Moceyunas, " On computing and approximating the observability don’t care set," in Proc. Int. Workshop on Logic Synthesis, Research Triangle Park, May 1989.
49. G. Hachtel, M. Lightner, R. Jacoby, C. Morrison, and P. Moceyunas, " A tutorial on combinational logic synthesis," in Proc. Int. Conf. on Computer Aided Design (ICCAD-88), 1988.
50. G. Hachtel, M. Lightner, R. Jacoby, C. Morrison, P. Moceyunas, and D. Bostick, " Bold: The boulder optimal logic design system," in Hawaii Int. Symp. on Systems Sciences, 1988.
51. G. D. Hachtel and R. M. Jacoby, " Algorithms for multi-level tautology and equivalence," in Proc. IEEE Int. Symp. on Circuits and Systems, June 1985.
52. G. D. Hachtel, R. M. Jacoby, and C. R. Morrison, " Techmap: Technology mapping with area and delay optimization," in Proc. Int. Workshop on Logic and Architecture Synthesis for Silicon Compilers, Grenoble, France, May 1988.
53. M. Helliwell and M. Perkowski, " A fast algorithm to minimize multi-output mixed-polarity generalized Reed-Muller forms, in Design Automation Conf., June 1988, pp. 427–432.
54. S. L. Hurst, D. M. Miller, and J. C. Muzio, Spectral Techniques in Digital Logic. New York: Academic Press, 1985.
55. T. Ibaraki and S. Murago, " Synthesis of networks with a minimum number of negative gates," IEEE Trans. Computers,vol. C-20, pp. 49–58, Jan. 1971.
56. J. Ishikawa, H. Sato, M. Hiramine, K. Ishida, S. Oguri, Y. Kazuma, and S. Murai, " A rule-based reorganization system Lores/EX," in Proc. Int. Conf. Comp. Des. (7CCD-88), Oct. 1988, pp. 262–266.
57. R. Jacoby, " On the comparison of Boolean functions," Ph.D. thesis, University of Colorado, May 1989.
58. W. Joyner, L. Trevillyan, D. Brand, T. Nix, and S. Gundersen, " Technology adaptation in logic synthesis," in Proc. 23th Design Automation Conf., June 1986, pp. 94–100.
59. K. Karplus, " Using if-then-else DAG's for multi-level minimization," in Decennial Caltech Conference on VLSI, May 1989.
60. K. Keutzer, " dagon: Technology binding and local optimization by DAG matching," in Proc. 24th Design Automation Conf., June 1987, pp. 341–347.
61. K. Keutzer, personal communication, Feb. 1989.
62. K. Keutzer and M. Vancura, " Timing optimization in a logic synthesis system," in Proc. Int. Workshop on Logic and Architectural Synthesis, May 1987.
63. S. Kundu and S. M. Reddy, " On the design of robust multiple fault testable cmos combinational logic circuits," in Proc. IEEE Int. Conf. Computer Aided Design, Nov. 1988, pp. 240–243.
64. Eugene Lawler, Combinatorial Optimization. Holt Rinehart Winston, 1976.
65. Eugene L. Lawler, " An approach to multilevel boolean minimization, J. Assoc. Comput. Machinery, vol. 11, July 1964.
66. B. Lin and A. R. Newton, " Restructuring state machines and state assignment: Relationship to minimizing logic across latch boundaries," in Int. Workshop on Logic Synthesis, May 1989.
67. A. Malik, R. Brayton, and A. Sangiovanni-Vincentelli, " Logic minimization for factored forms," in Int. Workshop on Logic Synthesis, May 1989.
68. Abdul A. Malik, Robert K. Brayton, A. Richard Newton, and Alberto L. Sangiovanni-Vincentelli, " A modified approach to two-level logic minimization," in Proc. Int. Conf. on CAD (ICCAD-88), Nov. 1988.
69. S. Malik, R. Brayton, and A. Sangiovanni-Vincentelli, " Encoding symbolic inputs for multi-level logic implementation," in Int. Conf. Very Large Scale Integration, Aug. 1989.
70. S. Malik, A. Wang, R. Brayton, and A. Sangiovanni-Vincentelli, " Logic verification using binary decision diagrams in a logic synthesis environment," in Proc. Int. Conf. Computer Aided Design (ICCAD-88), 1988, pp. 6–9.
71. Y. Matsunaga and M. Fujita, " Multi-level logic optimization using binary decision diagrams," in IEEE Int. Conf. on Computer-Aided Design, Nov. 1989.
72. E. J. McCluskey, " Minimization of boolean functions," Bell Lab. Tech. J., vol. 35, Nov. 1956.
73. P. McGeer, " On the interaction of functional and timing behavior in combinational circuits," Ph.D. thesis, University of California, Berkeley, 1989.
74. P. McGeer and R. Brayton, " Efficient, stable algebraic operations on logic expressions," in Proc. Int. Conf. on Very Large Scale Integration, Aug. 1987.
75. P. C. McGeer and R. K. Brayton, " Consistency and observability invariance in multilevel logic synthesis," in Int. Conf. on Computer-Aided Design (ICCAD-89), 1989.
76. C. Moraga, " Comments on a method of Karpovsky," Inform. Control, vol. 35, no. 3, pp. 243–246, 1977.
77. C. R. Morrison, " Multilevel logic minimization," Ph.D. thesis, University of Colorado, Aug. 1989.
78. S. Muroga, Y. Kambayashi, H. C. Lai, and J. N. Culliney, " The transduction method—design of logic networks based on permissible functions," IEEE Trans. Computers, 1989.
79. S. M. Reddy, " Easily testable realization for logic functions," IEEE Trans. Computers, vol. C-21, pp. 1183–1188, Nov. 1972.
80. P. J. Roth and R. M. Karp, " Minimization over Boolean graphs," IBM J. Res. Develop., vol. 6, Apr. 1962.
81. K. Roy, K. De, J. A. Abraham, and S. Lusky, " Synthesis of delay fault testable combinational logic," in Proc. Int. Conf. Computer Aided Design (ICCAD-89), Nov. 1989.
82. R. Rudell, " Logic synthesis for VLSI design," Ph.D. thesis, University of California, Berkeley, 1989.
83. R. Rudell and A. Sangiovanni-Vincentelli, " Exact minimization of multiple-valued functions for pla optimization," in Proc. Int. Conf. on CAD (ICCAD-86), pp. 352–355, 1986.
84. A. Saldanha, A. Wang, R. Brayton, and A. Sangiovanni-Vincentelli, " Multilevel logic simplification using don't cares and filters," in Proc. IEEE Design Automation Conf., June 1989.
85. H. Savoj, A. A. Malik, and R. Brayton, " Fast two-level minimizers for multilevel logic synthesis," in Proc. Int. Conf. on Computer Aided Design (ICCAD-89), Nov. 1989.
86. M. Schulz and E. Auth, " Advanced automatic test pattern generation and redundancy identification techniques," in Proc. 18th Int. Symp. on Fault-Tolerant-computing, 1988.
87. M. Schulz, E. Trischler, and T. Sarfert, " Socrates: A highly efficient ATPG system," IEEE Trans. Comput. Aided Design Integrat. Circuits Syst., vol. CAD-7, no. 1, pp. 126–137, Jan. 1988.
88. R. Segal, " BDSYN: Logic description translator; BDSIM: Switch-level simulator," master's thesis, University of California, Berkeley, May 1987; memorandum UCB/ERLM87/33.
89. K. Singh, A. Wang, R. Brayton, and A. Sangiovanni-Vincentelli, " Timing optimization of combinational logic," in Proc. Int. Conf. CAD (ICCAD-88), Nov. 1988, pp. 282–285.
90. F. Somenzi and R. K. Brayton, " An exact minimizer for boolean relations," in Int. Conf. Computer-Aided Design (ICCAD-89), Nov. 1989.
91. A. Srinivasan, " Muroga's transduction methods and multivalued decision diagrams," EE290LS Class Project, EECS Dept., University of California at Berkeley, May 1989.
92. S. Tjiang, " Twig reference manual," technical report, AT&T Bell Laboratories, 1985.
93. L. Trevillyan and L. Berman, " A global flow approach to circuit optimization," in Proc. Fifth MIT Conf. on VLSI, Mar. 1988, pp. 203–214.
94. L. Trevillyan and L. Berman, " Improved logic optimization using global flow analysis," in Proc. Int. Conf. Computer Aided Design (ICCAD-88), pp. 102–105, Nov. 1988.
95. L. Trevillyan, W. joyner, and L. Berman, " Global flow analysis in automated logic design," IEEE Trans. Computers, vol. C-35, no. 2, pp. 77–81, Jan. 1986.
96. D. Varma and E. A. Trachtenberg, " Design automation tools for efficient implementation of logic by decomposition," IEEE Trans. Comput. Aided Design Integr. Circuits Syst., 1989.
97. A. Wang, " Algorithms for multi-level logic optimization," Ph.D. thesis, University of California, Berkeley, 1989.
98. C-L. Wey, S-M Chang, and J-Y Jo, " An efficient output phase assignment for multilevel logic minimization," in Int. Workshop on Logic Synthesis, May 1989.