Академический Документы
Профессиональный Документы
Культура Документы
Required Reading
Behrooz Parhami, Computer Arithmetic: Algorithms and Hardware Design Chapter 7.4, Conditional-Sum Adder Chapter 7.5, Hybrid Adder Designs Chapter 6.4, Carry Determination as Prefix Computation Chapter 6.5, Alternative Parallel Prefix Networks
Recommended Reading
J-P. Deschamps, G. Bioul, G. Sutter, Synthesis of Arithmetic Circuits: FPGA, ASIC and Embedded Systems Chapter 11.1.9, Prefix Adders
Conditional-Sum Adders
Assuming k is a power of two, eventually have an extreme where there are log2k-levels using 1-bit adders
This is a conditional sum adder
7
xi+1 yi+1
xi yi
branch point
1-bit conditional sum block
concatenation
c=1 c=0 2 1 1
c=1 c=0 2
c=1 c=0 2 1
c=1 c=0 2
1+1
1 1 1 2 2 1 1 2
c=1 3
c=0 3 1
c=1 3
c=0 3
2+1
2 2
1 3 3
5 5
4+1
c=1
c=0
10
11
B g p g p
B g p g p
Not commutative
(g1, p1) (g2, p2) (g2, p2) (g1, p1)
15
Find:
(g[0,0], p[0,0]) (g[0,1], p[0,1]) (g[0,2], p[0,2]) (g[0,k-1], p[0,k-1])
ci = g[0,i-1] + c0p[0,i-1]
Given:
x0 Find: x1 x2 xk-1 x0+x1+x2+ + xk-1
x0 x0+x1 x0+x1+x2
xk-1 x0 x1 x2 xk-1
17
18
Delay = D(k) = D(k/2) + 1 = = [D(k/4) + 1] + 1 = D(k/4) + 1 + 1 = = . = = log2k D(2) = 1 Example: D(16) = D(8) + 1 = [D(4) + 1] + 1 = = D(4) + 2 = [D(2) + 1] + 2 = = 4 = log2 16
20
21
Delay = D(k) = D(k/2) + 2 = = [D(k/4) + 2] + 2 = D(k/4) + 2 + 2 = = . = = 2 log2k - 1 D(2) = 1 Example: D(16) = D(8) + 2 = [D(4) + 2] + 2 = = D(4) + 4 = [D(2) + 2] + 4 = = 7 = 2 log2 16 - 1
23
s7
s6
s5
s4
s3
s2
s1
s0
24
s7
s5
s3
s1
25
c critical path c
g[0,7] p[0,7] C c8
g[0,6] p[0,6] C c7 S s7 p7 c 6
g[0,5] p[0,5] C S s6
g[0,4] p[0,4] C
g[0,3] p[0,3] C
g[0,2] p[0,2] C
g[0,1] p[0,1] C
g[0,0] p[0,0] C
c0 p0 S s0
26
p6 c 5 S s5
p5 c4 S s4
p4 c3 S s3
p3 c 2 S s2
p2 c1 S s1
p1
Critical Path
GP
1 gate delay
2 gate delays
2 gate delays
1 gate delay
27
28
29
Cost(k)
Delay(16)
2k - 2 - log2k
6 26 8 57
Cost(16)
Delay(32) Cost(32)
31
32