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 approaches. Categories and Subject Descriptors: B.6.3 [Hardware]: Logic Design - Design Aids; J.6 [Computer Applications]: Computeraided engineering Terms: Algorithms, Design.

• Type: Conference
• Year: 2004
• Where: DAC
• Authors: David Bañeres, Jordi Cortadella, Michael Kishinevsky
• Keywords: DAC 2004, Design Automation, Parametrizable Cost Function, Subject Descriptors, Tangible Improvements