Fast Boolean matching under permutation by efficient computation of canonical form

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E87-A, Issue 12, 2004, Pages 3134-3141

  Debnath, Debatosh ^a   Sasao, Tsutomu ^b  

^a Oakland University   (United States)

^b KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Boolean matching; P equivalence; Technology mapping; Variable permutation

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; CONFORMAL MAPPING; DATA STRUCTURES; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; FIELD PROGRAMMABLE GATE ARRAYS; LOGIC CIRCUITS; LOGIC DESIGN; PROBLEM SOLVING;

BOOLEAN MATCHING; P-EQUIVALENCE; TECHNOLOGY MAPPING; VARIABLE PERMUTATION;

BOOLEAN FUNCTIONS;

EID: 11144277366     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (30)

1. L. Benini and G. De Micheli, "A survey of Boolean matching techniques for library binding," ACM Trans. Des. Autom. Electron. Syst., vol.2, no.3, pp.193-226, July 1997.
2. S.D. Brown, R.J. Francis, J. Rose, and Z.G. Vranesic, Field-Programmable Gate Arrays, Kluwer Academic Publishers, Boston, Massachusetts, 1992.
3. J.R. Burch and D.E. Long, "Efficient Boolean function matching," Proc. IEEE/ACM Int. Conf. on Computer-Aided Design, pp.408-411, Nov. 1992.
4. D.I. Cheng and M. Marek-Sadowska, "Verifying equivalence of functions with unknown input correspondence," Proc. European Conf. on Design Automation, pp.81-85, Feb. 1993.
5. J. Ciric and C. Sechen, "Efficient canonical form for Boolean matching of complex functions in large libraries," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol.22, no.5, pp.535-544, May 2003.
6. E.M. Clarke, K.L. McMillan, X. Zhao, M. Fujita, and J. Yang, "Spectral transforms for large Boolean functions with applications to technology mapping," Formal Methods in System Design: An Int. Journal, vol.10, no.2, pp.137-148, April 1997.
7. D. Debnath and T. Sasao, "A heuristic algorithm to design AND-OR-EXOR three-level networks," Proc. Asia and South Pacific Design Automation Conf., pp.69-74, Feb. 1998.
8. D. Debnath and T. Sasao, "Fast Boolean matching under permutation using representative," Proc. Asia and South Pacific Design Automation Conf., pp.359-362, Jan. 1999.
9. D. Debnath and T. Sasao, "Efficient computation of canonical form for Boolean matching in large libraries," Proc. Asia and South Pacific Design Automation Conf., pp.591-596, Jan. 2004.
10. G. De Micheli, Synthesis and Optimization of Digital Circuits, McGraw-Hill, New York, 1994.
11. A. El Gamal, J. Greene, J. Reyneri, E. Rogoyski, K.A. El-Ayat, and A. Mohsen, "An architecture for electrically configurable gate arrays," IEEE J. Solid-State Circuits, vol.24, no.2, pp.394-398, April 1989.
12. S. Ercolani and G. De Micheli, "Technology mapping for electrically programmable gate arrays," Proc. IEEE/ACM Design Automation Conf., pp.234-239, June 1991.
13. M.A. Harrison, Introduction to Switching and Automata Theory, McGraw-Hill, New York, 1965.
14. L. Hellerman, "A catalog of three-variable OR-invert and AND-invert logical circuits," IEEE Trans. Electron. Comput., vol.EC-12, no.3,pp.198-223, June 1963.
15. U. Hinsberger and R. Kolla, "Boolean matching for large libraries," Proc. IEEE/ACM Design Automation Conf., pp.206-211, June 1998.
16. M. Hütter and M. Scheppler, "Memory efficient and fast Boolean matching for large functions using rectangle representation," IEEE/ACM 12th Int. Workshop on Logic and Synthesis, May 2003.
17. K. Keutzer, K. Kolwicz, and M. Lega, "Impact of library size on the quality of automated synthesis," Proc. IEEE/ACM Int. Conf. on Computer-Aided Design, pp. 120-123, Nov. 1987.
18. Y.-T. Lai, S. Sastry, and M. Pedram, "Boolean matching using binary decision diagrams with applications to logic synthesis and verification," Proc. IEEE Int. Conf. on Computer Design, pp.452-458, Oct. 1992.
19. F. Mailhot and G. De Micheli, "Algorithms for technology mapping based on binary decision diagrams and on Boolean operations," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol.12, no.5, pp.599-620, May 1993.
20. Y. Matsunaga, "A new algorithm for Boolean matching utilizing structural information," IEICE Trans. Inf. & Syst., vol.E78-D, no.3, pp.219-223, March 1995.
21. J. Mohnke, P. Molitor, and S. Malik, "Limits of using signatures for permutation independent Boolean comparison," Formal Methods in System Design: An Int. Journal, vol.21, no.2, pp.167-191, Sept. 2002.
22. S. Muroga, Logic Design and Switching Theory, John Wiley & Sons, New York, 1979.
23. U. Schlichtmann, F. Brglez, and M. Hermann, "Characterization of Boolean functions for rapid matching in EPGA technology mapping," Proc. IEEE/ACM Design Automation Conf., pp.374-379, June 1992.
24. U. Schlichtmann and F. Brglez, "Efficient Boolean matching in technology mapping with very large cell libraries," Proc. IEEE Custom Integrated Circuits Conf., pp.3.6.1-3.6.6, May 1993.
25. V. Tiwari, P. Ashar, and S. Malik, "Technology mapping for low power in logic synthesis," Integration: The VLSI Journal, vol.20, no.3, pp.243-268, July 1996.
26. C. Tsai and M. Marek-Sadowska, "Boolean functions classification via fixed polarity Reed-Muller forms," IEEE Trans. Comput., vol.46, no.2, pp.173-186, Feb. 1997.
27. K.-H. Wang, T. Hwang, and C. Chen, "Exploiting communication complexity for Boolean matching," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol.15, no.10, pp.1249-1256, Oct. 1996.
28. Q. Wu, C.Y.R. Chen, and J.M. Acken, "Efficient Boolean matching algorithm for cell libraries," Proc. IEEE Int. Conf. on Computer Design, pp.36-39, Oct. 1994.
29. S. Yang, Logic Synthesis and Optimization Benchmarks User Guide (Version 3.0), Technical Report, Microelectronics Center of North Carolina (MCNC), Jan. 1991.
30. K. Zhu and D.F. Wong, "Fast Boolean matching for field-programmable gate arrays," Proc. IEEE European Design Automation Conf., pp.352-357, Sept. 1993.