Retiming Synchronous Circuitry
Name
MIT-LCS-TM-309.pdf
Size
8.57 MB
Format
Adobe PDF
Checksum (MD5)
3e431ab8162b8ec3da81dccc9643b4a2
Author(s)
Leiserson, Charles E.
Saxe, James B.
Date Issued
May 1986
Series/Report no.
MIT-LCS-TM-309
Abstract
This paper shows how the technique of retiming can be used to transform a given sycnhronous circuit into a more efficient circuit under a variety of different cost criteria. We model a circuit as a graph, and we give an O(|V||E|log|V|) algorithm for determining an equivalent circuit with the smallest possible clock period. We show that the problem of determining an equivalent retimed circuit with minimum state (total number of registers) is polynomial-time solvable. This result yields a polynomimal-time optimal solution to the problem of pipelining combinatorial circuitry with minimum register cost. We also give a characterization of optimal retiming based on an efficiently solvable mixed-integer linear programming problem.
Persistent DSpace Link
