Keywords and Synonyms
Minimum period retiming; Min-period retiming
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. The minimal period retiming problem needs to minimize the longest delay between any two consecutive registers, which decides the clock period.
The problem can be formally described as follows. Given a directed graph \( G=(V,E) \) representing a circuit – each node \( v \in V \) represents a gate and each edge \( e\in E \) represents a signal passing from one gate to another – with gate delays \( d\colon V\rightarrow {\mathbb R}^+ \) and register numbers \( w\colon E\rightarrow {\mathbb N} \), it asks for a relocation of registers \( w^{\prime}\colon E\rightarrow{\mathbb N} \) such that the maximal delay between two consecutive registers is minimized.
NotationsTo guarantee that the new registers are actually a relocation of...
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
Leiserson, C.E., Saxe, J.B.: Retiming synchronous circuitry. Algorithmica 6, 5–35 (1991)
Sapatnekar, S.S., Deokar, R.B.: Utilizing the retiming-skew equivalence in a practical algorithm for retiming large circuits. IEEE Transactions on Computer Aided Design 15, 1237–1248 (1996)
Zhou, H.: Deriving a new efficient algorithm for min-period retiming. In: Asia and South Pacific Design Automation Conference, Shanghai, China, January 2005
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag
About this entry
Cite this entry
Zhou, H. (2008). Circuit Retiming: An Incremental Approach. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30162-4_71
Download citation
DOI: https://doi.org/10.1007/978-0-387-30162-4_71
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30770-1
Online ISBN: 978-0-387-30162-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering