Optimal latch mapping and retiming within a tree

  • Authors:
  • Joel Grodstein;Eric Lehman;Heather Harkness;Herve Touati;Bill Grundmann

  • Affiliations:
  • Digital Equipment Corporation, Hudson, MA;Digital Equipment Corporation, Hudson, MA;Digital Equipment Corporation, Hudson, MA;Digital Equipment Corporation, Hudson, MA;Digital Equipment Corporation, Hudson, MA

  • Venue:
  • ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a technology mapping algorithm that takes existing structural technology-mapping algorithms based on dynamic programming and extends them to retime pipelined circuits. If the circuit to be mapped has a tree structure, our algorithm generates an optimal solution compatible with that structure. The algorithm takes into account gate delays and capacitive loads as latches are moved across the logic. It also supports latches with embedded logic: i.e., cells that combine a D latch with a combinational gate at little extra cost in latch delay.