Minimization of circuit registers: Retiming revisited

DOI10.1016/j.dam.2008.03.030zbMath1168.94011OpenAlexW2099796037MaRDI QIDQ1003739

Bruno Gaujal, Jean Mairesse

Publication date: 4 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.03.030

zbMATH Keywords

periodic graphsretimingcuts and flowsdigital circuitsregister minimization

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Cites Work

• Retiming synchronous circuitry
• Symmetric flows and broadcasting in hypercubes
• Computations of Uniform Recurrence Equations Using Minimal Memory Size
• Maximum-throughput dynamic network flows
• Minimum Convex Cost Dynamic Network Flows
• A Classified Bibliography Of Research On Stochastic Pert Networks: 1966-1987
• The Organization of Computations for Uniform Recurrence Equations
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimization of circuit registers: Retiming revisited