Wavefront technology mapping

The wavefront technology mapping algorithm leads to a very simple and efficient implementation that elegantly decouples pattern matching and covering but circumvents that patterns have to be stored for the entire network simultaneously. This coupled with dynamic decomposition enables trade-off of ma...

Full description

Saved in:
Bibliographic Details
Published inDesign, Automation and Test in Europe Conference and Exhibition, 1999. Proceedings (Cat. No. PR00078) pp. 531 - 536
Main Authors Stok, L., Iyer, M.A., Sullivan, A.J.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1999
Subjects
Circuit synthesis
Control system synthesis
Electrical capacitance tomography
Logic circuits
Logic design
Microwave integrated circuits
Pattern matching
Propagation delay
Timing
Tree graphs
Online AccessGet full text

Cover

More Information
Summary:The wavefront technology mapping algorithm leads to a very simple and efficient implementation that elegantly decouples pattern matching and covering but circumvents that patterns have to be stored for the entire network simultaneously. This coupled with dynamic decomposition enables trade-off of many more alternatives than in conventional mapping algorithms. The wavefront algorithm maps optimally for minimal delay on directed acyclic graphs (DAGs) when a gain based delay model is used. It is optimal with respect to the arrival times on each path in the network. A special timing mode for multi-source nets allows minimization of other (non-delay) metrics as a secondary objective while maintaining delay optimality.
ISBN:9780769500782
0769500781
DOI:10.1109/DATE.1999.761178