Generalized matching from theory to application

Authors:
Patrick Vuillod;Luca Benini;Giovanni De Micheli
Affiliations:
Synopsys-Europe and Stanford University, Computer Systems Laboratory, Stanford, CA;Stanford University, Computer Systems Laboratory, Stanford, CA;Stanford University, Computer Systems Laboratory, Stanford, CA
Venue:
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Year:
1997

Citing 10
Cited 0

DAGON: technology binding and local optimization by DAG matching

DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Multi-level logic optimization by implication analysis

ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Logic clause analysis for delay optimization

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Fast Boolean optimization by rewiring

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Algebraic decision diagrams and their applications

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Re-mapping for low power under tight timing constraints

ISLPED '97 Proceedings of the 1997 international symposium on Low power electronics and design
A survey of Boolean matching techniques for library binding

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Synthesis and Optimization of Digital Circuits

Synthesis and Optimization of Digital Circuits
Sequential Circuit Design Using Synthesis and Optimization

ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
Permissible functions for multioutput components in combinational logic optimization

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a novel approach for post-mapping optimization. We exploit the concept of generalised matching, a technique that finds symbolically all possible matching assignments of library cells to a multi-output network specified by a Boolean relation. Several objectives are targeted: area minimization under delay constraints; power minimization under delay constraints; and unconstrained delay minimization. We describe the theory of generalized matching and the algorithmic optimization required for its efficient and robust implementation. A tool based on generalized matching has been implemented and tested on large examples of the MCNC'91 benchmark suite. We obtain sizable improvements in: speed (6% in average, up to 20.7%); area under speed constraints (13.7% an average, up to 29.5%); and power under speed constraints (22.3% in average, up to 38.1%).