Issue No. 04 - April (2009 vol. 58)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2008.165
David Baneres , Universitat Politecnica de Catalunya, Barcelona
Jordi Cortadella , Universitat Politecnica de Catalunya, Barcelona
Mike Kishinevsky , Intel, Hillsboro
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.
Boolean relations, logic synthesis, Boolean minimization, decomposition.
M. Kishinevsky, J. Cortadella and D. Baneres, "A Recursive Paradigm to Solve Boolean Relations," in IEEE Transactions on Computers, vol. 58, no. , pp. 512-527, 2008.