Exploiting Communication Complexity for Multilevel Logic Synthesis

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

Volumn 9, Issue 10, 1990, Pages 1017-1027

  Hwang, Ting Ting ^a   Owens, Robert Michael ^a   Irwin, Mary Jane ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY - COMPUTABILITY AND DECIDABILITY; COMPUTER METATHEORY - MANY VALUED LOGICS; INTEGRATED CIRCUITS - COMPUTER AIDED DESIGN;

COMMUNICATION COMPLEXITY; MULTILEVEL LOGIC SYNTHESIS;

LOGIC CIRCUITS;

EID: 0025503056     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.62729     Document Type: Article

References (24)

1. R. L. Ashenhurst, “The decomposition of switching functions,” Ann. Comput. Lab. Harvard Univ., pp. 29, 30, 1959.
2. J. Beekman, R. M. Owens, and M. J. Irwin, “Mesh arrays and LOGICIAN: A tool for their efficient generation,” in Proc. DAC ’87. July 1987, pp. 357–362.
3. D. Bostick, et al., “The Boulder optimal logic design system.” in Proc. ICCAD, Nov. 1987, pp. 62–69.
4. R. Brayton, G. Hachtel, C. McMullen, and A. Sangiovanni-Vincen-telli, Logic Minimization Algorithms for VLSI Synthesis. Hingham, MA: Kluwer Academic, 1984.
5. R. Brayton et al., “MIS: A multiple-level logic optimization system,” IEEE Trans. Computer-Aided Design, vol. CAD-6, pp. 1062– 1081, Nov. 1987.
6. H. A. Curtis, “A generalized tree circuit,” J. Ass. Comput. Mach., pp. 484–496, Aug. 1961.
7. J. Darringer, D. Brand, L. Berman, and L. Trevillyan, “Logic synthesis through local transformations,” IBM J. Res. Develop., pp. 272– 280, July 1981.
8. H. A. Curtis, A New Approach to the Design of Switching Circuits. New York: Van Nostrand, 1962.
9. P. Duris, Z. Galil, and G. Schnitger, “Lower bounds on communication complexity,” Inform. Computat., vol. 73, no. 1, Apr. 1987.
10. M. R. Garey and D. S. Johnson, Computers and Intractability. San Francisco, CA: Freeman, 1979.
11. D. Gregory et al., “SOCRATES: A system for automatically synthesizing and optimizing combinational logic,” in Proc. DAC ’86, June 1986, pp. 79–85.
12. M. J. Irwin and R. M. Owens, “An overview of the Penn State design system,” in Proc. DAC ’87, July 1987, pp. 516–522.
13. R. M. Karp, “Functional decomposition and switching circuit design,” J. Soc. Indust. Appl. Math., vol. 11, no. 2, June 1963.
14. T. Kelliher, M. J. Irwin, and R. O. Owens, “A fast addition algorithm discovered by a program,” to be published in IEEE Trans. Comput.
15. M. Lightner and W. Wolf, “Experiments in logic optimization,” in Proc. ICCAD ’88, 1988, pp. 286–289.
16. K. Mehlhorn and E. Schmidt, “Las Vegas is better than determinism in VLSI and distributed computing,” in Proc. 14th ACM Symp. on Theory of Computing, 1982, pp. 330–337.
17. R. M. Owens and M. J. Irwin, “A comparison of four two-dimensional gate matrix layout tools,” in Proc. DAC ’89, June 1989, pp. 698–701.
18. R. H. Risch, “Staggered input networks: An approach to automatic logic decomposition,” in Proc. Int. Symp. on Circuits and Systems, 1982, pp. 55–57.
19. C. D. Thompson, “Area time complexity for VLSI,” in Proc. Ilth ACM Symp. on Theory of Computing, 1979, pp. 81–88.
20. T. Sasao, “Application of multiple-valued logic to a serial decomposition of PLA’s,” in Proc. 19th Int. Symp. on Multiple-Valued Logic, 1989, pp. 264–271.
21. J. Ullman, Computational Aspects of VLSI. New York: Computer Science, 1984.
22. A. Yao, “The Entropie Limitations on VLSI Computations,” in Proc. 13th ACM Symp. on Theory of Computing, 1981, pp. 308–311.
23. T. Hwang, R. M. Owens, and M. J. Irwin, “The detection of global variables for multilevel logic synthesis using communication complexity,” to be published.
24. T. Hwang, R. M. Owens, and M. J. Irwin, “Efficiently computing communication complexity for multilevel logic synthesis,” to be published.