EECS 150 Digital Design Lecture 12 Combinational Logic
EECS 150 - Digital Design Lecture 12 - Combinational Logic Circuits Part 3 March 4, 2002 John Wawrzynek Spring 2002 EECS 150 - Lec 12 -cl 3 1
In the News. . . Spring 2002 EECS 150 - Lec 12 -cl 3 2
Multiplication a 3 b 3 a 3 b 2 a 2 b 3 X a 3 b 1 a 2 b 2 a 1 b 3 a 3 b 3 a 2 b 2 a 1 b 1 a 0 b 0 a 3 b 0 a 2 b 1 a 1 b 2 a 0 b 3 a 2 b 0 a 1 b 1 a 0 b 2 a 1 b 0 a 0 b 1 a 0 b 0 . . . a 1 b 0+a 0 b 1 a 0 b 0 Multiplicand Multiplier Partial products Product Many different circuits exist for multiplication. Each one has a different balance between speed (performance) and amount of logic (cost). Spring 2002 EECS 150 - Lec 12 -cl 3 3
“Shift and Add” Multiplier • Sums each partial product, one at a time. • In binary, each partial product is shifted versions of A or 0. • Cost n, = n clock cycles. • What is the critical path for determining the min clock period? Spring 2002 Control Algorithm: 1. P 0, A multiplicand, B multiplier 2. If LSB of B==1 then add A to P else add 0 3. Shift [P][B] right 1 4. Repeat steps 2 and 3 n-1 times. 5. [P][B] has product. EECS 150 - Lec 12 -cl 3 4
“Shift and Add” Multiplier Signed Multiplication: Remember for 2’s complement numbers MSB has negative weight: ex: -6 = 110102 = 0 • 20 + 1 • 21 + 0 • 22 + 1 • 23 - 1 • 24 = 0 + 2 + 0 + 8 - 16 = -6 • Therefore for multiplication: a) subtract final partial product b) sign-extend partial products • Modifications to shift & add circuit: a) adder/subtractor b) sign-extender on P shifter register Spring 2002 EECS 150 - Lec 12 -cl 3 5
Array Multiplier Generates all partial products simultaneously. Each row: n-bit adder with AND gates. What is the critical path? Delay ? , cost ? Spring 2002 EECS 150 - Lec 12 -cl 3 6
Carry-save Addition • Speeding up multiplication is a matter of speeding up the summing of the partial products. • “Carry-save” addition can help. • Carry-save addition passes (saves) the carries to the output, rather than propagating them. carry-save add carry-propagate add • • Example: sum three numbers, 310 = 0011, 210 = 0010, 310 = 0011 310 + 210 c s 0011 0010 0100 = 410 0001 = 110 carry-save add 310 0011 c 0010 = 210 s 0110 = 610 1000 = 810 In general, carry-save addition takes in 3 numbers and produces 2. Whereas, carry-propagate takes 2 and produces 1. With this technique, we can avoid carry propagation until final addition Spring 2002 EECS 150 - Lec 12 -cl 3 7
Spring 2002 EECS 150 - Lec 12 -cl 3 8
Array Multiplier with Carry-Save Spring 2002 EECS 150 - Lec 12 -cl 3 9
Spring 2002 EECS 150 - Lec 12 -cl 3 10
Spring 2002 EECS 150 - Lec 12 -cl 3 11
CL Circuits from Mano • Magnitude Comparator • Multiplexors (revisited) • Decoders – basic – hierarchical • Encoders – standard – Priority Encoder Spring 2002 EECS 150 - Lec 12 -cl 3 12
Magnitude Comparator • We studied magnitude comparators in CS 61 c as part of the MIPS processor design. • What was that method? Why that then and not now? (A>B) = A 3 B’ 3 + x 3 A 2 B’ 2 + x 3 x 2 A 1 B’ 1 + x 3 x 2 x 1 A 0 B’ 0 (A>B) = A’ 3 B 3 + x 3 A’ 2 B 2 + x 3 x 2 A’ 1 B 1 + x 3 x 2 x 1 A’ 0 B 0 (A=B) = x 3 x 2 x 1 x 0 Spring 2002 EECS 150 - Lec 12 -cl 3 13
Multiplexors Revisited • • • Basic AND/OR form NAND/NAND tristate buffer based transmission gate based hierarchical decoder based – delay analysis Spring 2002 EECS 150 - Lec 12 -cl 3 14
Decoders Spring 2002 EECS 150 - Lec 12 -cl 3 15
Hierarchical Decoders Spring 2002 EECS 150 - Lec 12 -cl 3 16
Encoders • Generates binary code at output corresponding to input code. • Example: one-hot to binary encoder. (Opposite of decoder) abcd xy 1000 00 01 0010 10 0001 11 • Priority Encoder: – If two or more inputs are equal to 1 at the same time the input with the highest “priority” will take precedence. • Example: abcd 0000 1000 - 100 - - 10 - - - 1 xy V - - 0 00 0 01 1 10 1 11 1 • “V” is the valid signal, “d” has highest priority. Spring 2002 EECS 150 - Lec 12 -cl 3 17
- Slides: 17