Retiming

Retiming is the technique of moving the structural location of latches or registers in a digital circuit to improve its performance, area, and/or power characteristics in such a way that preserves its functional behavior at its outputs. Retiming was first described by Charles E. Leiserson and James B. Saxe in 1983.

The technique uses a directed graph where the vertices represent asynchronous combinational blocks and the directed edges represent a series of registers or latches (the number of registers or latches can be zero). Each vertex has a value corresponding to the delay through the combinational circuit it represents. After doing this, one can attempt to optimize the circuit by pushing registers from output to input and vice versa - much like bubble pushing. Two operations can be used - deleting a register from each input of a vertex while adding a register to all outputs, and conversely adding a register to each input of vertex and deleting a register from all outputs. In all cases, if the rules are followed, the circuit will have the same functional behavior as it did before retiming.

Formal description

The initial formulation of the retiming problem as described by Leiserson and Saxe is as follows. Given a directed graph [math]\displaystyle{ G:=(V,E) }[/math] whose vertices represent logic gates or combinational delay elements in a circuit, assume there is a directed edge [math]\displaystyle{ e:=(u,v) }[/math] between two elements that are connected directly or through one or more registers. Let the weight of each edge [math]\displaystyle{ w(e) }[/math] be the number of registers present along edge [math]\displaystyle{ e }[/math] in the initial circuit. Let [math]\displaystyle{ d(v) }[/math] be the propagation delay through vertex [math]\displaystyle{ v }[/math]. The goal in retiming is to compute an integer lag value [math]\displaystyle{ r(v) }[/math] for each vertex such that the retimed weight [math]\displaystyle{ w_r(e):=w(e)+r(v)-r(u) }[/math] of every edge is non-negative. There is a proof that this preserves the output functionality.

Minimizing the clock period with network flow

The most common use of retiming is to minimize the clock period. A simple technique to optimize the clock period is to search for the minimum feasible period (e.g. using binary search).

The feasibility of a clock period [math]\displaystyle{ T }[/math] can be checked in one of several ways. The linear program below is feasible if and only if [math]\displaystyle{ T }[/math] is a feasible clock period. Let [math]\displaystyle{ W(u,v) }[/math] be the minimum number of registers along any path from [math]\displaystyle{ u }[/math] to [math]\displaystyle{ v }[/math] (if such a path exists), and [math]\displaystyle{ D(u,v) }[/math] is the maximum delay along any path from [math]\displaystyle{ u }[/math] to [math]\displaystyle{ v }[/math] with W(u,v) registers. The dual of this program is a minimum cost circulation problem, which can be solved efficiently as a network problem. The limitations of this approach arise from the enumeration and size of the [math]\displaystyle{ W }[/math] and [math]\displaystyle{ D }[/math] matrices.

Given	[math]\displaystyle{ w(e), W(u,v), D(u,v) }[/math] and a target clock period [math]\displaystyle{ T }[/math]
Find	[math]\displaystyle{ r(v):V \to \mathbb{Z} }[/math]
Such that
	[math]\displaystyle{ r(u) - r(v) }[/math]	[math]\displaystyle{ \le w(e) }[/math]
	[math]\displaystyle{ r(u) - r(v) }[/math]	[math]\displaystyle{ \le W(u,v) - 1 }[/math] if [math]\displaystyle{ D(u,v) \gt T }[/math]

Minimizing the clock period with MILP

Alternatively, feasibility of a clock period [math]\displaystyle{ T }[/math] can be expressed as a mixed-integer linear program (MILP). A solution will exist and a valid lag function [math]\displaystyle{ r(v) }[/math] will be returned if and only if the period is feasible.

Given	[math]\displaystyle{ w(e), d(v) }[/math] and a target clock period [math]\displaystyle{ T }[/math]
Find	[math]\displaystyle{ r(v):V \to \mathbb{Z} }[/math] and [math]\displaystyle{ R(v):V \to \mathcal{R} }[/math]
Such that
	[math]\displaystyle{ r(v) - R(V) }[/math]	[math]\displaystyle{ \le -d(v)/T }[/math]
	[math]\displaystyle{ R(v) - r(v) }[/math]	[math]\displaystyle{ \le 1 }[/math]
	[math]\displaystyle{ r(u) - r(v) }[/math]	[math]\displaystyle{ \le w(e) }[/math]
	[math]\displaystyle{ R(u) - R(v) }[/math]	[math]\displaystyle{ \le w(e) - d(v)/T }[/math]

Other formulations and extensions

Alternate formulations allow the minimization of the register count and the minimization of the register count under a delay constraint. The initial paper includes extensions that allow the consideration of fan-out sharing and a more general delay model. Subsequent work has addressed the inclusion of register delays, load-dependent delay models, and hold constraints.

Problems

Retiming has found industrial use, albeit sporadic. Its primary drawback is that the state encoding of the circuit is destroyed, making debugging, testing, and verification substantially more difficult. Some retimings may also require complicated initialization logic to have the circuit start in an identical initial state. Finally, the changes in the circuit's topology have consequences in other logical and physical synthesis steps that make design closure difficult.

Alternatives

Clock skew scheduling is a related technique for optimizing sequential circuits. Whereas retiming relocates the structural position of the registers, clock skew scheduling moves their temporal position by scheduling the arrival time of the clock signals. The lower bound of the achievable minimum clock period of both techniques is the maximum mean cycle time (i.e. the total combinational delay along any path divided by the number of registers along it).

See also

• Logic Synthesis
• Electronic Design Automation

References

• Leiserson, 1C. E.; Saxe, J. B. (1983). "Optimizing Synchronous Systems". Journal of VLSI and Computer Systems 1 (1): 41–67. 

External links

• Presentation on retiming from MIT
• A Safe and Complete Gate-Level Register Retiming Algorithm