Implicit enumeration of structural changes in circuit optimization

Proceedings - Design Automation Conference

Volumn , Issue , 2004, Pages 438-441

  Kravets, Victor N ^a   Kudva, Prabhakar ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Decomposition; Optimization; Physical Synthesis; Re synthesis; Technology Mapping

Indexed keywords

CODES (SYMBOLS); EQUIVALENT CIRCUITS; OPTIMIZATION; ROUTERS; SIGNAL DETECTION; SYSTEMS ANALYSIS; TOPOLOGY;

CIRCUIT OPTIMIZATION; PHYSICAL SYNTHESIS; RE-SYNTHESIS; TECHNOLOGY MAPPING;

LOGIC CIRCUITS;

EID: 4444323970     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/996566.996691     Document Type: Conference Paper

References (21)

1. L. Benini, P. Vuillod, and G. De Micheli. Iterative re-mapping for logic circuits. IEEE TCAD IC, CAD-17(10):948-964, October 1998.
2. D. Brand. Verification of large synthesized designs. In Proc. ICCAD, pages 534-537, November 1993.
3. R. K. Brayton and C. McMullen. The decomposition and factorization of Boolean expressions. In Proc. IEEE Int. Symp. Circ. and Syst., pages 29-54, May 1982.
4. R. K. Brayton, G. Hachtel, and A. Sangiovanni-Vincentelli. Multi-level logic synthesis. in Proc IEEE, vol. 78, no. 2, pages 264-300, February 1990.
5. F. M. Brown. Boolean Reasoning. Kluwer Academic Publishers, Boston, 1990.
6. R.E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE TC, C-35(6):677-691, August 1986.
7. Y. Chan, P. Kudva, L. Lacey, G. Northrop and T. Rosser. Physical Synthesis Methodology for High Performance Microprocessors. In Proc 40th DAC. pages 696-701, June 2003.
8. S.-C. Chang, M. Marek-Sadowska, and K.-T. Cheng, Perturb and Simplify: Multi-level Boolean Network Optimizer. IEEE TCAD IC, CAD-15(12):1494-1504, December 1996.
9. S.-C. Chang, L. Van Ginneken, and M. Marek-Sadowska. Fast Boolean optimization by rewiring. In Proc. ICCAD, pages 262-269, November 1996.
10. H. T. Heineken, W. Maly, P. Nag, C. Ouyang and W. A. Pleskacz. CAD at the design-manufacturing interface. In Proc. 34th DAC, June 1997.
11. V. N. Kravets. Constructive Multi-level Synthesis by Way of Functional Properties. Ph.D. Thesis, University of Michigan, Ann Arbor, 2001.
12. V. N. Kravets and K. A. Sakallah. Resynthesis of Multi-level Circuits Under Tight Constraints Using Symbolic Optimization. In Proc. ICCAD, pages 687-693., November 2002.
13. P. Kudva, A. Sullivan, and W. Dougherty. Metrics for structural logic synthesis. In Proc. ICCAD, pages 551-556, November 2002.
14. W. Kunz, D. Stoffel and P. Menon. Logic Optimization and Equivalence Checking by Implication Analysis. IEEE TCAD IC, CAD-16(3):266-281, March 1997.
15. E. Lehman, Y. Watanabe, J. Grodstein, and H. Harkness. Logic decomposition during technology mapping. In Proc. ICCAD, pages 264-271, November 1995.
16. A. Mishchenko, X. Wang and T. Kam. A New Enhanced Constructive Decomposition and Mapping Algorithm. In Proc 40th DAC, pages 143148-701, June 2003.
17. J. P. Roth and R. Karp. Minimization over boolean graphs. IBM J. Res. and Develop., 6(2):227-238, April 1962.
18. H. Savoj. Don't Cares in Multi-Level Network Optimization. Ph.D. thesis, University of California, Berkeley, 1992
19. E. M. Sentovich et al. SIS: A system for sequential circuit synthesis. Technical Report UCB/ERL M92/41, UC Berkeley, May 1992.
20. S. Sinha and R. K. Brayton. Implementation and use of SPFDs in optimization of Boolean networks. In Proc. ICCAD, November 1998.
21. H. J. Touati, H. Savoj, and R. K. Brayton. Delay optimization of combinational logic circuits and partial collapsing. In Proc. 28th DAC, pages 188-191, June 1991.