Variables Bounding Based Retiming Algorithm

摘要

Retiming is a technique for optimizing sequential circuits. In this paper, we discuss this problem and propose an improved retiming algorithm based on variables bounding. Through the computation of the lower and upper bounds on variables, the algorithm can significantly reduce the number of constraints and speed up the execution of retiming. Furthermore, the elements of matrixes D and W are computed in a demand-driven way, which can reduce the capacity of memory. It is shown through the experimental results on ISCAS89 benchmarks that our algorithm is very effective for large-scale sequential circuits.