Optimizing designs containing black boxes

Authors:
Tai-Hung Liu;Adnan Aziz;Vigyan Singhal
Affiliations:
Avanti Corp., Fremont, CA;The University of Texas at Austin, Austin;Tempus Fugit Inc., Albany, CA
Venue:
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Year:
2001

Citing 5
Cited 0

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
BooleDozer: logic synthesis for ASICs

IBM Journal of Research and Development
The maximum set of permissible behaviors for FSM networks

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Optimizing designs containing black boxes

DAC '97 Proceedings of the 34th annual Design Automation Conference
Sequential Circuit Design Using Synthesis and Optimization

ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors

Quantified Score

Hi-index	0.00

Visualization

Abstract

We are concerned with optimizing gate-level netlists containing "e;black boxes,"e; that is, components whose functionality is not available to the optimization tool. We establish a notion of equivalence for gate-level netlists containing black boxes, and prove that it is sound and complete. We show that conventional approaches to optimizing such netlists fail to fully exploit the don't care flexibility available for synthesis. Based on our new notion of equivalence, we introduce a procedure that computes the complete don't care set. Experiments indicate that our procedure can achieve more minimization than conventional synthesis.