1. Instructor: Alexander Stoytchev
CprE 281: Digital Logic
Instructor: Alexander Stoytchev

2. Fast Adders CprE 281: Digital Logic Iowa State University, Ames, IA
Copyright © Alexander Stoytchev

3. Administrative Stuff HW5 is out It is due on Monday Oct 1 @ 4pm.
Please write clearly on the first page (in block capital letters) the following three things:
Your First and Last Name
Your Student ID Number
Your Lab Section Letter
Also, please staple all of your pages together.

4. Administrative Stuff Labs Next Week Mini-Project
This one is worth 3% of your grade.
Make sure to get all the points.
2018_Fall_281/labs/Project-Mini/

5. Quick Review

6. The problems in which row are easier to calculate?82 61 - ?? 48 26 - ?? 32 11 - ?? 82 64 - ?? 48 29 - ?? 32 13 - ??

7. The problems in which row are easier to calculate?82 61 - 21 48 26 - 22 32 11 - 21
Why? 82 64 - 18 48 29 - 19 32 13 - 19

8. Another Way to Do Subtraction
82 – 64 = –

9. Another Way to Do Subtraction
82 – 64 = –
= (100 – 64) - 100

10. Another Way to Do Subtraction
82 – 64 = –
= (100 – 64) - 100
= ( – 64) - 100

11. Another Way to Do Subtraction
82 – 64 = –
= (100 – 64) - 100
= ( – 64) - 100
= (99 – 64)

12. Another Way to Do Subtraction
82 – 64 = –
= (100 – 64) - 100
= ( – 64) - 100
Does not require borrows
= (99 – 64)

13. 9’s Complement (subtract each digit from 9)99 64 - 35

14. 10’s Complement (subtract each digit from 9 and add 1 to the result)99 64 -
= 36

15. Another Way to Do Subtraction
82 – 64 = (99 – 64)

16. Another Way to Do Subtraction
9’s complement
82 – 64 = (99 – 64)

17. Another Way to Do Subtraction
9’s complement
82 – 64 = (99 – 64) =

18. Another Way to Do Subtraction
9’s complement
82 – 64 = (99 – 64)
10’s complement =

19. Another Way to Do Subtraction
9’s complement
82 – 64 = (99 – 64)
10’s complement = =

20. Another Way to Do Subtraction
9’s complement
82 – 64 = (99 – 64)
10’s complement = =
// Add the first two. =

21. Another Way to Do Subtraction
9’s complement
82 – 64 = (99 – 64)
10’s complement = =
// Add the first two. =
// Just delete the leading 1.
// No need to subtract 100.
= 18

23. 2’s complement
Let K be the negative equivalent of an n-bit positive number P.
Then, in 2’s complement representation K is obtained by subtracting P from 2n , namely
K = 2n – P

24. Deriving 2’s complement
For a positive n-bit number P, let K1 and K2 denote its 1’s and 2’s complements, respectively.
K1 = (2n – 1) – P
K2 = 2n – P
Since K2 = K1 + 1, it is evident that in a logic circuit the 2’s complement can computed by inverting all bits of P and then adding 1 to the resulting 1’s-complement number.

25. Find the 2’s complement of …

26. Find the 2’s complement of …
Invert all bits.

27. Find the 2’s complement of … 1 + 1 + 1 + 1 +
Then add 1.

28. Interpretation of four-bit signed integers
[ Table 3.2 from the textbook ]

29. Interpretation of four-bit signed integers
The top half is the same in all three representations.
It corresponds to the positive integers.

30. Interpretation of four-bit signed integers
In all three representations the first bit represents the sign.
If that bit is 1, then the number is negative.

31. Interpretation of four-bit signed integers
Notice that in this representation there are two zeros!

32. Interpretation of four-bit signed integers
There are two zeros in this representation as well!

33. Interpretation of four-bit signed integers
In this representation there is one more negative number.

34. Taking the 2’s complement negates the number
decimal
b3 b2 b1 b0
take the 2's complement +7
0111
1001 -7 +6
0110
1010 -6 +5
0101
1011 -5 +4
0100
1100 -4 +3
0011
1101 -3 +2
0010
1110 -2 +1
0001
1111 -1 +0
0000 -8
1000

35. Taking the 2’s complement negates the number
decimal
b3 b2 b1 b0
take the 2's complement +7
0111
1001 -7 +6
0110
1010 -6 +5
0101
1011 -5 +4
0100
1100 -4 +3
0011
1101 -3 +2
0010
1110 -2 +1
0001
1111 -1 +0
0000 -8
1000
This is
the only
exception

36. Taking the 2’s complement negates the number
decimal
b3 b2 b1 b0
take the 2's complement +7
0111
1001 -7 +6
0110
1010 -6 +5
0101
1011 -5 +4
0100
1100 -4 +3
0011
1101 -3 +2
0010
1110 -2 +1
0001
1111 -1 +0
0000 -8
1000
And this
one too.

37. The number circle for 2's complement
[ Figure 3.11a from the textbook ]

38. A) Example of 2’s complement addition( + 5 ) + ( + 2 ) + ( + 7 )
[ Figure 3.9 from the textbook ]

39. B) Example of 2’s complement addition+ 2 ( ) 5 – 3
[ Figure 3.9 from the textbook ]

40. C) Example of 2’s complement addition+ 1
ignore 5 ( ) 3 2 –
[ Figure 3.9 from the textbook ]

41. D) Example of 2’s complement addition+ 1
ignore 5 – ( ) 7 2
[ Figure 3.9 from the textbook ]

43. Naming Ambiguity: 2's Complement
2's complement has two different meanings:
representation for signed integer numbers
algorithm for computing the 2's complement (regardless of the representation of the number)

44. Naming Ambiguity: 2's Complement
2's complement has two different meanings:
representation for signed integer numbers
in 2's complement
algorithm for computing the 2's complement (regardless of the representation of the number)
take the 2's complement

45. Example of 2’s complement subtraction( + 5 ) – ( + 2 ) – + ( + 3 ) 1
ignore
means take the 2's complement
[ Figure 3.10 from the textbook ]

46. Example of 2’s complement subtraction( + 5 ) – ( + 2 ) – + ( + 3 ) 1
ignore
Notice that the minus changes to a plus.
means take the 2's complement
[ Figure 3.10 from the textbook ]

47. Example of 2’s complement subtraction( + 5 ) – ( + 2 ) – + ( + 3 ) 1
ignore
[ Figure 3.10 from the textbook ]

48. Example of 2’s complement subtraction( + 5 ) – ( + 2 ) – + ( + 3 ) 1
ignore
[ Figure 3.10 from the textbook ]

49. Graphical interpretation of four-bit
2’s complement numbers
[ Figure 3.11 from the textbook ]

50. Example of 2’s complement subtraction( – 5 ) – ( + 2 ) – + ( – 7 ) 1
ignore
[ Figure 3.10 from the textbook ]

51. Example of 2’s complement subtraction( + 5 ) – ( – 2 ) – + ( + 7 )
[ Figure 3.10 from the textbook ]

52. Example of 2’s complement subtraction( – 5 ) – ( – 2 ) – + ( – 3 )
[ Figure 3.10 from the textbook ]

53. Take Home Message
Subtraction can be performed by simply adding the 2’s complement of the second number, regardless of the signs of the two numbers.
Thus, the same adder circuit can be used to perform both addition and subtraction !!!

54. Adder/subtractor unity y y n – 1 1
Add
Sub
control x x x n – 1 1 c n
-bit adder c n s s s n – 1 1
[ Figure 3.12 from the textbook ]

55. XOR Tricks y
control
out

56. XOR as a repeater y

57. XOR as an inverter y 1

58. Addition: when control = 0y y y n – 1 1
Add
Sub
control x x x n – 1 1 c n
-bit adder c n s s s n – 1 1
[ Figure 3.12 from the textbook ]

59. Addition: when control = 0y y y n – 1 1
Add
Sub
control x x x n – 1 1 c n
-bit adder c n s s s n – 1 1
[ Figure 3.12 from the textbook ]

60. Addition: when control = 0y y y n – 1 1
Add
Sub
control x x x n – 1 1
yn-1 … y1 y0 c n
-bit adder c n s s s n – 1 1
[ Figure 3.12 from the textbook ]

61. Subtraction: when control = 1y y y n – 1 1
Add
Sub
control x x x n – 1 1 c n
-bit adder c n s s s n – 1 1
[ Figure 3.12 from the textbook ]

62. Subtraction: when control = 1y y y n – 1 1 1
Add
Sub
control 1 1 1 x x x n – 1 1 c n
-bit adder c n s s s n – 1 1
[ Figure 3.12 from the textbook ]

63. Subtraction: when control = 1y y y n – 1 1 1
Add
Sub
control 1 1 1 x x x n – 1 1
yn-1 … y1 y0 c n
-bit adder c n s s s n – 1 1
[ Figure 3.12 from the textbook ]

64. Subtraction: when control = 1y y y n – 1 1 1
Add
Sub
control 1 1 1 x x x n – 1 1
yn-1 … y1 y0 c n
-bit adder c n 1
carry for the
first column! s s s n – 1 1
[ Figure 3.12 from the textbook ]

65. Examples of determination of overflow( + 7 ) ( – 7 ) + + + ( + 2 ) + ( + 2 ) ( + 9 ) ( – 5 ) ( + 7 ) ( – 7 ) + + + ( – 2 ) + ( – 2 ) ( + 5 ) 1 ( – 9 ) 1
[ Figure 3.13 from the textbook ]

66. Examples of determination of overflow ( + 7 ) ( – 7 ) + + + ( + 2 ) + ( + 2 ) ( + 9 ) ( – 5 ) ( + 7 ) ( – 7 ) + + + ( – 2 ) + ( – 2 ) ( + 5 ) 1 ( – 9 ) 1
Include the carry bits: c4 c3 c2 c1 c0

67. Examples of determination of overflow ( + 7 ) ( – 7 ) + + + ( + 2 ) + ( + 2 ) ( + 9 ) ( – 5 ) ( + 7 ) ( – 7 ) + + + ( – 2 ) + ( – 2 ) ( + 5 ) 1 ( – 9 ) 1
Include the carry bits: c4 c3 c2 c1 c0

68. Examples of determination of overflowc 4 = 3 1 c 4 = 3 ( + 7 ) ( – 7 ) + + + ( + 2 ) + ( + 2 ) ( + 9 ) ( – 5 ) c 4 1 = 3 c 4 1 = 3 ( + 7 ) ( – 7 ) + + + ( – 2 ) + ( – 2 ) ( + 5 ) 1 ( – 9 ) 1
Include the carry bits: c4 c3 c2 c1 c0

69. Examples of determination of overflowc 4 = 3 1 c 4 = 3 ( + 7 ) ( – 7 ) + + + ( + 2 ) + ( + 2 ) ( + 9 ) ( – 5 ) c 4 1 = 3 c 4 1 = 3 ( + 7 ) ( – 7 ) + + + ( – 2 ) + ( – 2 ) ( + 5 ) 1 ( – 9 ) 1
Overflow occurs only in these two cases.

70. Examples of determination of overflowc 4 = 3 1 c 4 = 3 ( + 7 ) ( – 7 ) + + + ( + 2 ) + ( + 2 ) ( + 9 ) ( – 5 ) c 4 1 = 3 c 4 1 = 3 ( + 7 ) ( – 7 ) + + + ( – 2 ) + ( – 2 ) ( + 5 ) 1 ( – 9 ) 1
Overflow = c3c4 + c3c4

71. Examples of determination of overflowc 4 = 3 1 c 4 = 3 ( + 7 ) ( – 7 ) + + + ( + 2 ) + ( + 2 ) ( + 9 ) ( – 5 ) c 4 1 = 3 c 4 1 = 3 ( + 7 ) ( – 7 ) + + + ( – 2 ) + ( – 2 ) ( + 5 ) 1 ( – 9 ) 1
Overflow = c3c4 + c3c4
XOR

72. Calculating overflow for 4-bit numbers
with only three significant bits

73. Calculating overflow for n-bit numbers with only n-1 significant bits

74. Detecting Overflow x y x y x y c c c FA c c FA FA s s s n – 1 n – 1 1c 1 c c FA c c n n - 1 2 FA FA s s s n – 1 1

75. Detecting Overflow (with one extra XOR)y x y x y
n – 1 n – 1 1 1 c 1 c c FA c FA FA c n n - 1 2 s s s n – 1 1
overflow

76. Another way to look at the overflow issue
X= x3 x2 x1 x0
Y= y3 y2 y1 y0
S= s3 s2 s1 s0 +

77. Another way to look at the overflow issue
X= x3 x2 x1 x0
Y= y3 y2 y1 y0
S= s3 s2 s1 s0 +
If both numbers that we are adding have the same sign
but the sum does not, then we have an overflow.

78. Examples of determination of overflow( + 7 ) ( – 7 ) + + + ( + 2 ) + ( + 2 ) ( + 9 ) ( – 5 ) ( + 7 ) ( – 7 ) + + + ( – 2 ) + ( – 2 ) ( + 5 ) 1 ( – 9 ) 1

79. Examples of determination of overflow( + 7 ) ( – 7 ) + + + ( + 2 ) + ( + 2 ) ( + 9 ) ( – 5 ) ( + 7 ) ( – 7 ) + + + ( – 2 ) + ( – 2 ) ( + 5 ) 1 ( – 9 ) 1

80. Examples of determination of overflow3 = y s 1 x 3 1 = y s ( + 7 ) ( – 7 ) + + + ( + 2 ) + ( + 2 ) ( + 9 ) ( – 5 ) x 3 = y 1 s x 3 1 = y s ( + 7 ) ( – 7 ) + + + ( – 2 ) + ( – 2 ) ( + 5 ) 1 ( – 9 ) 1

81. Examples of determination of overflow3 = y s 1 x 3 1 = y s ( + 7 ) ( – 7 ) + + + ( + 2 ) + ( + 2 ) ( + 9 ) ( – 5 ) x 3 = y 1 s x 3 1 = y s ( + 7 ) ( – 7 ) + + + ( – 2 ) + ( – 2 ) ( + 5 ) 1 ( – 9 ) 1
In 2's complement, both +9 and -9 are not representable with 4 bits.

82. Examples of determination of overflow3 = y s 1 x 3 1 = y s ( + 7 ) ( – 7 ) + + + ( + 2 ) + ( + 2 ) ( + 9 ) ( – 5 ) x 3 = y 1 s x 3 1 = y s ( + 7 ) ( – 7 ) + + + ( – 2 ) + ( – 2 ) ( + 5 ) 1 ( – 9 ) 1
Overflow occurs only in these two cases.

83. Examples of determination of overflow3 = y s 1 x 3 1 = y s ( + 7 ) ( – 7 ) + + + ( + 2 ) + ( + 2 ) ( + 9 ) ( – 5 ) x 3 = y 1 s x 3 1 = y s ( + 7 ) ( – 7 ) + + + ( – 2 ) + ( – 2 ) ( + 5 ) 1 ( – 9 ) 1
Overflow = x3 y3 s3 + x3 y3 s3

84. Another way to look at the overflow issue
X= x3 x2 x1 x0
Y= y3 y2 y1 y0
S= s3 s2 s1 s0 +
If both numbers that we are adding have the same sign
but the sum does not, then we have an overflow.
Overflow = x3 y3 s3 + x3 y3 s3

86. How long does it take to compute all sum bits and all carry bits?x y x y x y
n – 1 n – 1 1 1 c 1 c c FA c c n n – 1 2 FA FA s s s n – 1 1

87. Can we perform addition even faster?
The goal is to evaluate very fast if the carry from the previous stage will be equal to 0 or 1.

88. The Full-Adder Circuit
[ Figure 3.3c from the textbook ]

89. The Full-Adder Circuit
Let's take a closer look at this.
[ Figure 3.3c from the textbook ]

90. Decomposing the Carry Expression
ci+1 = xi yi + xi ci + yi ci

91. Decomposing the Carry Expression
ci+1 = xi yi + xi ci + yi ci
ci+1 = xi yi + (xi + yi )ci

92. Decomposing the Carry Expression
ci+1 = xi yi + xi ci + yi ci
ci+1 = xi yi + (xi + yi )ci yi xi
ci+1 ci

93. Another Way to Draw the Full-Adder Circuit
ci+1 = xi yi + xi ci + yi ci
ci+1 = xi yi + (xi + yi )ci yi xi ci
ci+1 si

94. Another Way to Draw the Full-Adder Circuit
ci+1 = xi yi + (xi + yi )ci yi xi ci
ci+1 si

95. Another Way to Draw the Full-Adder Circuit
ci+1 = xi yi + (xi + yi )ci gi pi yi xi ci
ci+1 si

96. Another Way to Draw the Full-Adder Circuit
g - generate
p - propagate
ci+1 = xi yi + (xi + yi )ci gi pi yi xi ci
ci+1 si gi pi

97. Yet Another Way to Draw It (Just Rotate It)ci
ci+1 si xi yi pi gi

98. Now we can Build a Ripple-Carry Adderx 1 y g p s
Stage 1
Stage 0 c 2
[ Figure 3.14 from the textbook ]

99. Now we can Build a Ripple-Carry Adderx 1 y g p s
Stage 1
Stage 0 c 2
[ Figure 3.14 from the textbook ]

100. The delay is 5 gates (1+2+2) x 1 y g p s
Stage 1
Stage 0 c 2

101. n-bit ripple-carry adder: 2n+1 gate delaysx 1 y g p s
Stage 1
Stage 0 c 2
. . .

102. Decomposing the Carry Expression
ci+1 = xi yi + xi ci + yi ci

103. Decomposing the Carry Expression
ci+1 = xi yi + xi ci + yi ci
ci+1 = xi yi + (xi + yi )ci gi pi

104. Decomposing the Carry Expression
ci+1 = xi yi + xi ci + yi ci
ci+1 = xi yi + (xi + yi )ci gi pi
(1 gate delay)
(1 gate delay)

105. Ii takes 1 gate delay to compute all pi signalsx 1 y g p s
Stage 1
Stage 0 c 2
[ Figure 3.14 from the textbook ]

106. Ii takes 1 gate delay to compute all gi signalsx 1 y g p s
Stage 1
Stage 0 c 2
[ Figure 3.14 from the textbook ]

107. Decomposing the Carry Expression
ci+1 = xi yi + xi ci + yi ci
ci+1 = xi yi + (xi + yi )ci gi pi

108. Decomposing the Carry Expression
ci+1 = xi yi + xi ci + yi ci
ci+1 = xi yi + (xi + yi )ci gi pi
ci+1 = gi + pi ci

109. Decomposing the Carry Expression
ci+1 = xi yi + xi ci + yi ci
ci+1 = xi yi + (xi + yi )ci gi pi
recursive
expansion of
ci+1 = gi + pi ci ci
ci+1 = gi + pi (gi-1 + pi-1 ci-1 )

110. Decomposing the Carry Expression
ci+1 = xi yi + xi ci + yi ci
ci+1 = xi yi + (xi + yi )ci gi pi
ci+1 = gi + pi ci
ci+1 = gi + pi (gi-1 + pi-1 ci-1 )
ci+1 = gi + pi gi-1 + pi pi-1 ci-1

111. Now we can Build a Carry-Lookahead Adderx 1 y g p s c 2
[ Figure 3.15 from the textbook ]

112. The first two stages of a carry-lookahead adderx 1 y g p s c 2
. . .
Stage 1
Stage 0
[ Figure 3.15 from the textbook ]

113. Carry for the first stage
c1 = g0 + p0 c0

114. Carry for the first stagex 1 y g p s c 2
c1 = g0 + p0 c0

115. Carry for the second stage
c2 = g1 + p1g0 + p1p0c0

116. Carry for the second stagex 1 y g p s c 2
c2 = g1 + p1g0 + p1p0c0

117. Carry for the first two stages
c1 = g0 + p0 c0
c2 = g1 + p1g0 + p1p0c0

118. Carry for the first two stages
c1 = g0 + p0 c0
c2 = g1 + p1g0 + p1p0c0

119. Carry for the first two stages
c1 = g0 + p0 c0
c2 = g1 + p1g0 + p1p0c0
= g1 + p1 (g0 + p0c0) c1

120. Carry for the first two stages
c1 = g0 + p0 c0
c2 = g1 + p1g0 + p1p0c0
= g1 + p1 (g0 + p0c0) c1
= g1 + p1 c1

121. The first two stages of a carry-lookahead adderx 1 y g p s c 2
[ Figure 3.15 from the textbook ]

122. It takes 3 gate delays to generate c1x 1 y g p s c 2
c1 = g0 + p0 c0

123. It takes 3 gate delays to generate c2x 1 y g p s c 2
c2 = g1 + p1g0 + p1p0c0

124. The first two stages of a carry-lookahead adderx 1 y g p s c c 2

125. It takes 4 gate delays to generate s1x 1 y g p s c c 2

126. It takes 4 gate delays to generate s2x 1 y g p s c 2

127. N-bit Carry-Lookahead Adder
It takes 3 gate delays to generate all carry signals
It takes 1 more gate delay to generate all sum bits
Thus, the total delay through an n-bit carry-lookahead adder is only 4 gate delays!

128. Expanding the Carry Expression
ci+1 = gi + pi ci
c1 = g0 + p0 c0
c2 = g1 + p1g0 + p1p0c0
c3 = g2 + p2g1 + p2p1g0 + p2p1p0c0
. . .
c8 = g7 + p7g6 + p7p6g5 + p7p6p5g4
+ p7p6p5p4g3 + p7p6p5p4p3g2
+ p7p6p5p4p3p2g1+ p7p6p5p4p3p2p1g0
+ p7p6p5p4p3p2p1p0c0

129. Expanding the Carry Expression
ci+1 = gi + pi ci
c1 = g0 + p0 c0
c2 = g1 + p1g0 + p1p0c0
c3 = g2 + p2g1 + p2p1g0 + p2p1p0c0
. . .
c8 = g7 + p7g6 + p7p6g5 + p7p6p5g4
+ p7p6p5p4g3 + p7p6p5p4p3g2
+ p7p6p5p4p3p2g1+ p7p6p5p4p3p2p1g0
+ p7p6p5p4p3p2p1p0c0
Even this takes
only 3 gate delays

130. A hierarchical carry-lookahead adder with ripple-carry between blocksx y x y x y x y 31 – 24 31 – 24 23 – 16 23 – 16 15 – 8 15 – 8 7 – 7 – c 24 c c 8 c
Block
Block 16
Block
Block c 32 3 2 1 s s s s 31 – 24 23 – 16 15 – 8 7 –

131. A hierarchical carry-lookahead adder with ripple-carry between blocksx y x y x y x y 31 – 24 31 – 24 23 – 16 23 – 16 15 – 8 15 – 8 7 – 7 – c 24 c c 8 c
Block
Block 16
Block
Block c 32 3 2 1 s s s s 31 – 24 23 – 16 15 – 8 7 –

132. A hierarchical carry-lookahead adder with ripple-carry between blocksx y x y x y x y 31 – 24 31 – 24 23 – 16 23 – 16 15 – 8 15 – 8 7 – 7 – c 24 c c 16 8 c c 32 s s s s 31 – 24 23 – 16 15 – 8 7 –

133. A hierarchical carry-lookahead adder with ripple-carry between blocksx 31 24 – c 32 y s 15 8 16 7 3 1
[ Figure 3.16 from the textbook ]

134. A hierarchical carry-lookahead adder
Block x 15 8 – y 7 3 1
Second-level lookahead c s P G 31 24 16 32
[ Figure 3.17 from the textbook ]

135. A hierarchical carry-lookahead adder
Block x 15 8 – y 7 3 1
Second-level lookahead c s P G 31 24 16 32 c 32

136. A hierarchical carry-lookahead adder
Block x 15 8 – y 7 3 1
Second-level lookahead c s P G 31 24 16 32 c 32

137. A hierarchical carry-lookahead adder
Block x 15 8 – y 7 3 1
Second-level lookahead c s P G 31 24 16 32 c 32 ? ? ?

138. The Hierarchical Carry Expression
c8 = g7 + p7g6 + p7p6g5 + p7p6p5g4
+ p7p6p5p4g3 + p7p6p5p4p3g2
+ p7p6p5p4p3p2g1+ p7p6p5p4p3p2p1g0
+ p7p6p5p4p3p2p1p0c0

139. The Hierarchical Carry Expression
c8 = g7 + p7g6 + p7p6g5 + p7p6p5g4
+ p7p6p5p4g3 + p7p6p5p4p3g2
+ p7p6p5p4p3p2g1+ p7p6p5p4p3p2p1g0
+ p7p6p5p4p3p2p1p0c0

140. The Hierarchical Carry Expression
c8 = g7 + p7g6 + p7p6g5 + p7p6p5g4
+ p7p6p5p4g3 + p7p6p5p4p3g2
+ p7p6p5p4p3p2g1+ p7p6p5p4p3p2p1g0
+ p7p6p5p4p3p2p1p0c0 G0 P0

141. The Hierarchical Carry Expression
c8 = g7 + p7g6 + p7p6g5 + p7p6p5g4
+ p7p6p5p4g3 + p7p6p5p4p3g2
+ p7p6p5p4p3p2g1+ p7p6p5p4p3p2p1g0
+ p7p6p5p4p3p2p1p0c0 G0 P0
c8 = G0 + P0 c0

142. The Hierarchical Carry Expression
c8 = G0 + P0 c0
c16 = G1 + P1 c8
= G1 + P1 G0 + P1 P0 c0
c24 = G2 + P2 G1 + P2 P1 G0 + P2 P1 P0 c0
c32 = G3 + P3 G2 + P3 P2 G1 + P3 P2 P1 G0+ P3 P2 P1 P0 c0

143. A hierarchical carry-lookahead adder
Block x 15 8 – y 7 3 1
Second-level lookahead c s P G 31 24 16 32
[ Figure 3.17 from the textbook ]

144. A hierarchical carry-lookahead adder
Block x 15 8 – y 7 3 1
Second-level lookahead c s P G 31 24 16 32
c32 =G3+P3G2+P3P2G1 +P3 P2 P1 G0+P3 P2 P1 P0 c0
c16 = G1 + P1 G0 + P1 P0 c0
c8 = G0 + P0 c0
[ Figure 3.17 from the textbook ]

145. Hierarchical CLA Adder Carry Logic
C8 – 5 gate delays C16 – 5 gate delays C24 – 5 Gate delays C32 – 5 Gate delays

146. Hierarchical CLA Critical Path
C9 – 7 gate delays C17 – 7 gate delays C25 – 7 Gate delays

147. Total Gate Delay Through a Hierarchical Carry-Lookahead Adder
Is 8 gates
3 to generate all Gj and Pj
+2 to generate c8, c16, c24, and c32
+2 to generate internal carries in the blocks
+1 to generate the sum bits (one extra XOR)

148. Questions?

149. THE END