Subscribe

Issue No.04 - April (2009 vol.58)

pp: 512-527

David Baneres , Universitat Politecnica de Catalunya, Barcelona

Jordi Cortadella , Universitat Politecnica de Catalunya, Barcelona

Mike Kishinevsky , Intel, Hillsboro

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2008.165

ABSTRACT

A Boolean relation can specify some types of flexibility of a combinational circuit that cannot be expressed with don't cares. Several problems in logic synthesis, such as Boolean decomposition or multilevel minimization, can be modeled with Boolean relations. However, solving Boolean relations is a computationally expensive task. This paper presents a novel recursive algorithm for solving Boolean relations. The algorithm has several features: efficiency, wide exploration of solutions, and customizable cost function. The experimental results show the applicability of the method in logic minimization problems and tangible improvements with regard to previous heuristic approaches.

INDEX TERMS

Boolean relations, logic synthesis, Boolean minimization, decomposition.

CITATION

David Baneres, Jordi Cortadella, Mike Kishinevsky, "A Recursive Paradigm to Solve Boolean Relations",

*IEEE Transactions on Computers*, vol.58, no. 4, pp. 512-527, April 2009, doi:10.1109/TC.2008.165REFERENCES