A new efficient retiming algorithm derived by formal manipulation

A new efficient algorithm is derived for the minimal period retiming by formal manipulation. Contrary to all previous algorithms, which used binary search on a range of candidate periods to check feasibility, the derived algorithm checks the optimality of a current 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.

• Type: Journal
• Year: 2008
• Where: TODAES
• Authors: Hai Zhou
• Keywords: Algorithm, Efficient Heuristic Algorithm, Minimal Period, TODAES 2008