Optimal wire retiming without binary search

  • Chuan Lin, Hai Zhou
  • Published 2004 in
    IEEE Transactions on Computer-Aided Design of…

Abstract

The problem of retiming over a netlist of macroblocks to achieve minimal clock period, where block internal structures may not be changed and flip-flops may not be inserted on some wire segments, is called the optimal wire retiming problem. This paper presents a new algorithm that solves the optimal wire retiming problem with polynomial-time worst case… (More)
DOI: 10.1145/1112239.1112313

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics