Title :
Detecting support-reducing bound sets using two-cofactor symmetries
Author :
Zhang, Jin S. ; Chrzanowska-Jeske, Malgorzata ; Mishchenko, Alan ; Burch, Jerry R.
Author_Institution :
Dept. of Electr. & Comput. Eng., Portland State Univ., OR, USA
Abstract :
Detecting support-reducing bound sets is an important step in Boolean decomposition. It affects both the quality and the runtime of several applications in technology mapping and re-synthesis. This paper presents an efficient heuristic method for detecting support-reducing bound sets using two-cofactor symmetries. Experiments on the MCNC and ITC benchmarks show an average 40× speedup over the published exhaustive method for bound set construction.
Keywords :
Boolean functions; logic design; Boolean decomposition; bound set construction; heuristic method; support-reducing bound sets; technology mapping; technology resynthesis; two-cofactor symmetry; Boolean functions; Circuit synthesis; Libraries; Logic circuits; Runtime;
Conference_Titel :
Design Automation Conference, 2005. Proceedings of the ASP-DAC 2005. Asia and South Pacific
Print_ISBN :
0-7803-8736-8
DOI :
10.1109/ASPDAC.2005.1466171
