• DocumentCode
    337795
  • Title

    Wavefront technology mapping

  • Author

    Stok, Leon ; Iyer, Mahesh A. ; Sullivan, Andrew J.

  • Author_Institution
    IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
  • fYear
    1999
  • fDate
    1999
  • Firstpage
    531
  • Lastpage
    536
  • Abstract
    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
  • Keywords
    delay estimation; directed graphs; logic CAD; pattern matching; timing; delay optimality; directed acyclic graphs; dynamic decomposition; gain based delay model; logic synthesis; minimization; multi-source nets; nondelay metrics; pattern matching; static timing analysis; timing mode; wavefront technology mapping algorithm; Circuit synthesis; Control system synthesis; Electrical capacitance tomography; Logic circuits; Logic design; Microwave integrated circuits; Pattern matching; Propagation delay; Timing; Tree graphs;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Design, Automation and Test in Europe Conference and Exhibition 1999. Proceedings
  • Conference_Location
    Munich
  • Print_ISBN
    0-7695-0078-1
  • Type

    conf

  • DOI
    10.1109/DATE.1999.761178
  • Filename
    761178