Years and Authors of Summarized Original Work
1991; Leiserson, Saxe
Problem Definition
Circuit retiming is one of the most effective structural optimization techniques for sequential circuits. It moves the registers within a circuit without changing its function. Besides clock period, retiming can be used to minimize the number of registers in the circuit. It is also called minimum area retiming problem Leiserson and Saxe [3] started the research on retiming and proposed algorithms for both minimum period and minimum area retiming. Both their algorithms for minimum area and minimum period will be presented here.
The problems can be formally described as follows. Given a directed graph G = (V, E) representing a circuit – each node v ∈ V represents a gate and each edge e ∈ E represents a signal passing from one gate to another – with gate delays \(d : V \rightarrow \mathbb{R}^{+}\) and register numbers \(w : E \rightarrow \mathbb{N}\), the minimum area problem asks for a relocation of...
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsRecommended Reading
Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms, 2nd edn. MIT, Cambridge
Goldberg AV, Taijan RE (1987) Solving minimum cost flow problem by successive approximation. In: Proceedings of ACM symposium on the theory of computing, New York, pp 7–18. Full paper in: Math Oper Res 15:430–466 (1990)
Leiserson CE, Saxe JB (1991) Retiming synchronous circuitry. Algorithmica 6:5–35
Maheshwari N, Sapatnekar SS (1998) Efficient retiming of large circuits. IEEE Trans Very Large-Scale Integr Syst 6:74–83
Pan P (1997) Continuous retiming: algorithms and applications. In: Proceedings of international conference on computer design, Austin. IEEE, Los Alamitos pp 116–121
Sapatnekar SS, Deokar RB (1996) Utilizing the retiming- skew equivalence in a practical algorithm for retiming large circuits. IEEE Trans Comput Aided Des 15:1237–1248
Shenoy N, Rudell R (1994) Efficient implementation of retiming. In: Proceedings of international conference on computer-aided design, San Jose. IEEE, Los Alamitos, pp 226–233
Wang J, Zhou H (2008) An efficient incremental algorithm for min-area retiming. In: Proceedings of design automation conference, Anaheim, CA, pp 528–533
Zhou H (2005) Deriving a new efficient algorithm for min-period retiming. In: Asia and South Pacific design automation conference, Shanghai, Jan 2005. ACM, New York
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Zhou, H. (2016). Circuit Retiming. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_70
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_70
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering