A recursive paradigm to solve Boolean relations

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 approa...

Full description

Saved in:
Bibliographic Details
Main Authors: Bañeres, David, Cortadella, Jordi, Kishinevsky, Mike
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Applied computing > Physical sciences and engineering > Engineering
Applied sciences
Computer applications
Cost function
Delay
Design engineering
Design. Technologies. Operation analysis. Testing
Distributed control
Electronics
Exact sciences and technology
Hardware
Hardware > Integrated circuits > Logic circuits
Integrated circuits
Logic design
Network synthesis
Permission
Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0738-100X
DOI:10.1145/996566.996687