A new efficient retiming algorithm derived by formal manipulation

Hai Zhou*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


A new efficient algorithm is derived for the minimal period retiming by formal manipulation. Contrary to all previous algorithms, which used fixed period feasibility checking to binary-search a candidate range, the derived algorithm checks the optimality of a feasible period directly. It is much simpler and more efficient than previous algorithms. Experimental results showed that it is even faster than ASTRA, an efficient heuristic algorithm. Since the derived algorithm is incremental by nature, it also opens the opportunity to be combined with other optimization techniques.

Original languageEnglish (US)
Article number7
JournalACM Transactions on Design Automation of Electronic Systems
Issue number1
StatePublished - Jan 1 2008


  • Algorithm derivation
  • Clockperiod minimization
  • Retiming

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering


Dive into the research topics of 'A new efficient retiming algorithm derived by formal manipulation'. Together they form a unique fingerprint.

Cite this