Loading...
Loading...

Go to the content (press return)

A recursive paradigm to solve boolean relations

Author
Bañeres, D.; Cortadella, J.; Kishinevsky, M.
Type of activity
Presentation of work at congresses
Name of edition
41st Design Automation Conference
Date of publication
2004
Presentation's date
2004
Book of congress proceedings
Design Automation Conference, 41st DAC: San Diego Convention Center, San Diego, CA, June 7-11, 2004:proceedings 2004
First page
416
Last page
421
DOI
10.1145/996566.996687
URL
https://dl.acm.org/citation.cfm?id=996566&picked=prox Open in new window
Abstract
A recursive algorithm for solving Boolean relations is presented. It provides several features: wide exploration of solutions, parametrizable cost function and efficiency. The experimental results show the applicability of the method and tangible improvements with regard to previous heuristic approaches.
Keywords
Boolean relations, Decomposition, Logic design
Group of research
ALBCOM - Algorithms, Computational Biology, Complexity and Formal Methods

Participants