Transcript Lecture 19: Retiming

ELEC 7770
Advanced VLSI Design
Spring 2007
Retiming
Vishwani D. Agrawal
James J. Danaher Professor
ECE Department, Auburn University
Auburn, AL 36849
[email protected]
http://www.eng.auburn.edu/~vagrawal/COURSE/E7770_Spr07
Spring 07, Apr 5
ELEC 7770: Advanced VLSI Design (Agrawal)
1
Retiming
 Retiming is a function-preserving transformation


of a synchronous sequential circuit.
Flip-flops are moved according to specific rules.
Original references:
 C. E. Leiserson, F. Rose and J. B. Saxe, “Optimizing

Synchronous Circuits by Retiming,” Proc. 3rd Caltech
Conf. on VLSI, 1983, pp. 87-116.
C. E. Leiserson and J. B. Saxe, “Retiming
Synchronous Circuitry,” Algorithmica, vol. 6, pp. 5-35,
1991.
Spring 07, Apr 5
ELEC 7770: Advanced VLSI Design (Agrawal)
2
A Trivial Example: Reduced Hardware
FF
FF
FF
Spring 07, Apr 5
ELEC 7770: Advanced VLSI Design (Agrawal)
3
Example 2: Faster Clock
FF
FF
Spring 07, Apr 5
ELEC 7770: Advanced VLSI Design (Agrawal)
4
Example 3: Reduced Flip-Flops
FF
FF
FF
Spring 07, Apr 5
ELEC 7770: Advanced VLSI Design (Agrawal)
5
Applications of Retiming





Performance optimization
Area optimization
Power optimization
Testability enhancement
FPGA optimization
Spring 07, Apr 5
ELEC 7770: Advanced VLSI Design (Agrawal)
6
Fundamental Operation of Retiming
 A retiming move in a circuit is caused by moving
all of the memory elements at the input of a
combinational block to all of its outputs, or viceversa.
FF
Combinational
logic
≡
Combinational
logic
FF
FF
Spring 07, Apr 5
ELEC 7770: Advanced VLSI Design (Agrawal)
7
A Correlator Circuit
Adder
+
+
+
=
=
=
PO
host
PI
Flip-flops
Spring 07, Apr 5
=
Comparator
ELEC 7770: Advanced VLSI Design (Agrawal)
8
Graph Model
0
7
0
7
7
0
0
0
0
1
0
3
0
3
1
3
1
1
3
Vertex, vi, combinational, delay = d(vi), assumed unchanged by retiming
d(host) = 0
Edge, e(vi,vj) or eij, weight wij = number of flip-flops between vi and vj
Spring 07, Apr 5
ELEC 7770: Advanced VLSI Design (Agrawal)
9
Path Delay and Path Weight




A set of connected nodes specify a path.
Path delay = ∑ d(vi) = comb. delay of path
Path weight = ∑ wij = clock delay of path
Retiming of a node i denoted by an integer ri
 It represents the number of registers moved across,



initially ri = 0
Register moved from output to input, ri → ri + 1
Register moved from input to output, ri → ri – 1
After retiming, edge weight wij’ = wij + rj – ri
Spring 07, Apr 5
ELEC 7770: Advanced VLSI Design (Agrawal)
10
Legal Retiming
 Retiming is legal if the retimed circuit has no


negative weights.
A legally retimed circuit is equivalent to the
original circuit – proof by Leiserson and Saxe
(1991)
Retiming is the most general method for
changing the register count and position without
knowing the functions of vertices.
Spring 07, Apr 5
ELEC 7770: Advanced VLSI Design (Agrawal)
11
Example
a
c
b
x
d
0
host
c
1
x
0
0
Spring 07, Apr 5
ELEC 7770: Advanced VLSI Design (Agrawal)
12
Example: Illegal Retiming
a
c
b
x
d
0
0
host
c
0
0
0
1
0
x
host
0
0
1→0
0 → –1
x
0 → –1
0 →1
0
Retiming vector = {0, 0, 0}
Spring 07, Apr 5
c
Retiming vector = {0, 0, –1}
ELEC 7770: Advanced VLSI Design (Agrawal)
13
Example: Legal Retiming
a
c
b
x
d
0 →1
0
0
host
c
1
0 →1
x
host
0
0
0
0
0
Retiming vector = {0, 0, 0}
Spring 07, Apr 5
1→0
c
0
x
0
0
Retiming vector = {0, 1, 0}
ELEC 7770: Advanced VLSI Design (Agrawal)
14
Correlator Circuit
f
g
0
7
0
h
rh=0
7
rf=0
rg=0
1
3
ra=0 a
0
0
0
0
Critical path delay = 24
e
0
7 re=0
0
3
1
b
3
rb=0
1
c rc=0
1
3
rd=0
d
Initial retiming vector = {0,0,0,0,0,0,0,0}
Spring 07, Apr 5
ELEC 7770: Advanced VLSI Design (Agrawal)
15
Retimed Correlator Circuit
0→1
7
0
h
rh=0
rg=0
0→1
0
1→0
Critical path delay = 13
e
0→1
7
7 re= -2
rf= -1
0
0
0
f
g
3
ra= -1 a
3
1
b
1→0
rb= -1
3
1
c rc= -2
3
rd= -2
d
Initial retiming vector = {-1,-1,-2,-2,-2,-1,0,0}
Spring 07, Apr 5
ELEC 7770: Advanced VLSI Design (Agrawal)
16
Retiming Theorem
 Given a network G(V, E, W) and a cycle time T,
(r1, . . . ) is a feasible retiming if and only if:
 ri – rj ≤ wij
for all edges (vi,vj) ε E
 ri – rj ≤ W(vi,vj) – 1 for all node-pairs vi, vj such that
D(vi,vj) > T
Where,
W(vi,vj) is the minimum weight path between vi and vj
D(vi,vj) is the maximum delay among all minimum
weight paths between vi and vj
Spring 07, Apr 5
ELEC 7770: Advanced VLSI Design (Agrawal)
17
References
 Two papers by Leiserson et al. (see slide 2).
 G. De Micheli, Synthesis and Optimization of

Digital Circuits, New York: McGraw-Hill, 1994.
N. Maheshwari and S. S. Sapatnekar, Timing
Analysis and Optimization of Sequential Circuits,
Boston: Springer, 1999.
Spring 07, Apr 5
ELEC 7770: Advanced VLSI Design (Agrawal)
18