Minimization of circuit registers: Retiming revisited

13 years 4 months ago

Download www.liafa.jussieu.fr

In this paper, we address the following problem: given a synchronous digital circuit, is it possible to construct a new circuit computing the same function as the original one but using a minimal number of registers? The construction of such a circuit can be done in polynomial time and is based on a result of Orlin for one periodic bi-infinite graphs showing that the cardinality maximum flow is equal to the size of a minimum cut. The idea is to view such a graph as the unfolding of the dependences in a digital circuit.

Bruno Gaujal, Jean Mairesse

Real-time Traffic