Minimization of circuit registers: retiming revisited - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2007

Minimization of circuit registers: retiming revisited

(1) , (2)
1
2

Abstract

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.
Fichier principal
Vignette du fichier
circuit.pdf (154.75 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00072480 , version 1 (24-05-2006)
inria-00072480 , version 2 (24-07-2007)

Identifiers

  • HAL Id : inria-00072480 , version 2

Cite

Bruno Gaujal, Jean Mairesse. Minimization of circuit registers: retiming revisited. Discrete Applied Mathematics, 2007. ⟨inria-00072480v2⟩
188 View
329 Download

Share

Gmail Facebook Twitter LinkedIn More