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: | Baneres, David Cortadella Fortuny, Jordi Kishinevsky, Mike |
Others: | Universitat Politècnica de Catalunya (UPC) Intel Corporation Universitat Oberta de Catalunya (UOC) |
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 |
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. |
Keywords: | Boolean relations logic synthesis Boolean minimization decomposition |
DOI: | 10.1109/TC.2008.165 |
Document type: | info:eu-repo/semantics/article |
Issue Date: | 27-Mar-2008 |
Appears in Collections: | Articles cientÍfics Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Baneres_IEEE_Recursive_Paradigm.pdf Restricted Access | 90,79 kB | Adobe PDF | View/Open Request a copy |
Share:
This item is licensed under a Creative Commons License