Efficient canonical form for Boolean matching of complex functions in large libraries

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

Volumn 22, Issue 5, 2003, Pages 535-544

  Ciric, Jovanka ^a   Sechen, Carl ^b  

^a UNIVERSITY OF WASHINGTON   (United States)

^b University of Washington   (United States)

Author keywords

Boolean function; Circuit design; Circuit optimization; Technology mapping

Indexed keywords

BOOLEAN FUNCTIONS; CONFORMAL MAPPING; EQUIVALENCE CLASSES; INTEGRATED CIRCUIT LAYOUT; INTEGRATED CIRCUIT TESTING; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; RESPONSE TIME (COMPUTER SYSTEMS); TABLE LOOKUP;

BOOLEAN MATCHING; CIRCUIT OPTIMIZATION; LEVEL BASED TECHNOLOGY MAPPING; N EQUIVALENT CLASS;

ALGORITHMS;

EID: 0037515538     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2003.810744     Document Type: Article

References (16)

1. J. Mohnke, P. Molitor, and S. Malik, "Limits of using signatures for permutation independent boolean comparison," in Proc. ASP Design Automation Conf., 1995, pp. 459-464.
2. Q. Wu, C. Chen, and J. Acken, "Efficient boolean matching algorithm for cell libraries," in Proc. Int. Conf. Computer Design, Oct. 1994, pp. 36-39.
3. J. Burch and D. Long, "Efficient boolean function matching," in Proc. Int. Conf. Computer-Aided Design, 1992, pp. 408-411.
4. U. Hinsberger and R. Kolla, "Boolean matching for large libraries," in Proc. Design Automation Conf., June 1998, pp. 206-211.
5. U. Schlichtmann and F. Brglez, "Efficient boolean matching in technology mapping with very large cell libraries," in Proc. IEEE Custom Integrated Circuits Conf., 1993, pp. 3.6.1-3.6.6.
6. F. Mailhot and G. De Micheli, "Algorithms for technology mapping based on binary decision diagrams and on boolean operations," IEEE Trans. Computer-Aided Design, vol. 12, pp. 599-620, May 1993.
7. L. Benini and G. De Micheli, "A survey of boolean matching techniques for library binding," ACM Trans. Design Automation Electron. Syst., vol. 2, no. 3, pp. 193-226, 1997.
8. E. Detjens, G. Gannot, R. Rudell, A. Sangiovanni-Vincentelli, and A. Wang, "Technology mapping in MIS," in Proc. Int. Conf. Computer-Aided Design, Nov. 1987, pp. 116-119.
9. E. Sentovich et al., "SIS: A System for Sequential Circuit Synthesis," Univ. of California, Berkeley, CA, UCB/ERL M92/41, 1992.
10. S. Devadas, A. Ghosh, and K. Keutzer, Logic Synthesis. New York: McGraw-Hill, 1994, McGraw-Hill Series on Computer Engineering.
11. J. Mohnke and S. Malik, "Permutation and phase independent boolean comparison," Integration, VLSI J., vol. 16, pp. 109-129, 1993.
12. T. Thorp, "Design and Synthesis of Dynamic Circuits," Ph.D. dissertation, Univ. of Washington, Dept. of Elec. Eng., Seattle, WA, 1999.
13. C. Scholl, D. Moller, P. Molitor, and R. Drechsler, "BDD minimization using symmetries," IEEE Trans. Computer-Aided Design, vol. 18, pp. 81-100, Feb. 1999.
14. J. Ciric, "Boolean Matching and Level-Based Technology Mapping," Ph.D. dissertation, Univ. of Washington, Dept. of Elec. Eng., 2001.
15. H. Touati, H. Savoj, and R. Brayton, "Delay optimization of combinational logic circuits by clustering and partial collapsing," in Proc. IEEE/ACM Int. Conf. Computer-Aided Design, Nov. 1991, pp. 188-191.
16. E. L. Lawler, K. N. Levin, and J. Turner, "Module clustering to minimize delay in digital networks," IEEE Trans. Comput., vol. C-18, pp. 47-57, Jan. 1966.