Please use this identifier to cite or link to this item:

http://hdl.handle.net/10609/109844
Title: A recursive paradigm to solve Boolean relations
Author: Bañeres Besora, David  
Cortadella Fortuny, Jordi
Kishinevsky, Mike
Others: Universitat Politècnica de Catalunya
Intel Corporation
Universitat Oberta de Catalunya (UOC)
Keywords: Boolean relations
logic synthesis
Boolean minimization
decomposition
Issue Date: 27-Mar-2008
Publisher: IEEE Transactions on Computers
Citation: Bañeres, D., Cortadella Fortuny, J. & Kishinevsky, M. (2009). A Recursive Paradigm to Solve Boolean Relations. IEEE Transactions on Computers, 58(4), 512-527. doi: 10.1109/TC.2008.165
Project identifier: info:eu-repo/grantAgreement/CICYT TIN2007-66523
Also see: https://ieeexplore.ieee.org/document/4624246
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.
Language: English
URI: http://hdl.handle.net/10609/109844
ISSN: 0018-9340MIAR
Appears in Collections:Articles
Articles

Share:
Export:
Files in This Item:
File Description SizeFormat 
Baneres_IEEE_Recursive_Paradigm.pdf90.79 kBAdobe PDFView/Open

This item is licensed under a Creative Commons License Creative Commons