Presentation is loading. Please wait.

Presentation is loading. Please wait.

EE466: VLSI Design Lecture 14: Datapath Functional Units.

Published by Modified over 8 years ago

Similar presentations

Presentation on theme: "EE466: VLSI Design Lecture 14: Datapath Functional Units."— Presentation transcript:

1 EE466: VLSI Design Lecture 14: Datapath Functional Units

2 CMOS VLSI Design12: Datapath Functional UnitsSlide 2 Outline  Comparators  Shifters  Multi-input Adders  Multipliers

3 CMOS VLSI Design12: Datapath Functional UnitsSlide 3 Comparators  0’s detector:A = 00…000  1’s detector: A = 11…111  Equality comparator:A = B  Magnitude comparator:A < B

4 CMOS VLSI Design12: Datapath Functional UnitsSlide 4 1’s & 0’s Detectors  1’s detector: N-input AND gate  0’s detector: NOTs + 1’s detector (N-input NOR)

5 CMOS VLSI Design12: Datapath Functional UnitsSlide 5 Equality Comparator  Check if each bit is equal (XNOR, aka equality gate)  1’s detect on bitwise equality

6 CMOS VLSI Design12: Datapath Functional UnitsSlide 6 Magnitude Comparator  Compute B-A and look at sign  B-A = B + ~A + 1  For unsigned numbers, carry out is sign bit

7 CMOS VLSI Design12: Datapath Functional UnitsSlide 7 Signed vs. Unsigned  For signed numbers, comparison is harder –C: carry out –Z: zero (all bits of A-B are 0) –N: negative (MSB of result) –V: overflow (inputs had different signs, output sign  B)

8 CMOS VLSI Design12: Datapath Functional UnitsSlide 8 Shifters  Logical Shift: –Shifts number left or right and fills with 0’s 1011 LSR 1 = ____1011 LSL1 = ____  Arithmetic Shift: –Shifts number left or right. Rt shift sign extends 1011 ASR1 = ____ 1011 ASL1 = ____  Rotate: –Shifts number left or right and fills with lost bits 1011 ROR1 = ____ 1011 ROL1 = ____

9 CMOS VLSI Design12: Datapath Functional UnitsSlide 9 Shifters  Logical Shift: –Shifts number left or right and fills with 0’s 1011 LSR 1 = 01011011 LSL1 = 0110  Arithmetic Shift: –Shifts number left or right. Rt shift sign extends 1011 ASR1 = 11011011 ASL1 = 0110  Rotate: –Shifts number left or right and fills with lost bits 1011 ROR1 = 11011011 ROL1 = 0111

10 CMOS VLSI Design12: Datapath Functional UnitsSlide 10 Funnel Shifter  A funnel shifter can do all six types of shifts  Selects N-bit field Y from 2N-bit input –Shift by k bits (0  k < N)

11 CMOS VLSI Design12: Datapath Functional UnitsSlide 11 Funnel Shifter Operation  Computing N-k requires an adder

12 CMOS VLSI Design12: Datapath Functional UnitsSlide 12 Funnel Shifter Operation  Computing N-k requires an adder

13 CMOS VLSI Design12: Datapath Functional UnitsSlide 13 Funnel Shifter Operation  Computing N-k requires an adder

14 CMOS VLSI Design12: Datapath Functional UnitsSlide 14 Funnel Shifter Operation  Computing N-k requires an adder

15 CMOS VLSI Design12: Datapath Functional UnitsSlide 15 Funnel Shifter Operation  Computing N-k requires an adder

16 CMOS VLSI Design12: Datapath Functional UnitsSlide 16 Simplified Funnel Shifter  Optimize down to 2N-1 bit input

17 CMOS VLSI Design12: Datapath Functional UnitsSlide 17 Simplified Funnel Shifter  Optimize down to 2N-1 bit input

18 CMOS VLSI Design12: Datapath Functional UnitsSlide 18 Simplified Funnel Shifter  Optimize down to 2N-1 bit input

19 CMOS VLSI Design12: Datapath Functional UnitsSlide 19 Simplified Funnel Shifter  Optimize down to 2N-1 bit input

20 CMOS VLSI Design12: Datapath Functional UnitsSlide 20 Simplified Funnel Shifter  Optimize down to 2N-1 bit input

21 CMOS VLSI Design12: Datapath Functional UnitsSlide 21 Funnel Shifter Design 1  N N-input multiplexers –Use 1-of-N hot select signals for shift amount –nMOS pass transistor design (V t drops!)

22 CMOS VLSI Design12: Datapath Functional UnitsSlide 22 Funnel Shifter Design 2  Log N stages of 2-input muxes –No select decoding needed

23 CMOS VLSI Design12: Datapath Functional UnitsSlide 23 Multi-input Adders  Suppose we want to add k N-bit words –Ex: 0001 + 0111 + 1101 + 0010 = _____

24 CMOS VLSI Design12: Datapath Functional UnitsSlide 24 Multi-input Adders  Suppose we want to add k N-bit words –Ex: 0001 + 0111 + 1101 + 0010 = 10111

25 CMOS VLSI Design12: Datapath Functional UnitsSlide 25 Multi-input Adders  Suppose we want to add k N-bit words –Ex: 0001 + 0111 + 1101 + 0010 = 10111  Straightforward solution: k-1 N-input CPAs –Large and slow

26 CMOS VLSI Design12: Datapath Functional UnitsSlide 26 Carry Save Addition  A full adder sums 3 inputs and produces 2 outputs –Carry output has twice weight of sum output  N full adders in parallel are called carry save adder –Produce N sums and N carry outs

27 CMOS VLSI Design12: Datapath Functional UnitsSlide 27 CSA Application  Use k-2 stages of CSAs –Keep result in carry-save redundant form  Final CPA computes actual result

28 CMOS VLSI Design12: Datapath Functional UnitsSlide 28 CSA Application  Use k-2 stages of CSAs –Keep result in carry-save redundant form  Final CPA computes actual result

29 CMOS VLSI Design12: Datapath Functional UnitsSlide 29 CSA Application  Use k-2 stages of CSAs –Keep result in carry-save redundant form  Final CPA computes actual result

30 CMOS VLSI Design12: Datapath Functional UnitsSlide 30 Multiplication  Example:

31 CMOS VLSI Design12: Datapath Functional UnitsSlide 31 Multiplication  Example:

32 CMOS VLSI Design12: Datapath Functional UnitsSlide 32 Multiplication  Example:

33 CMOS VLSI Design12: Datapath Functional UnitsSlide 33 Multiplication  Example:

34 CMOS VLSI Design12: Datapath Functional UnitsSlide 34 Multiplication  Example:

35 CMOS VLSI Design12: Datapath Functional UnitsSlide 35 Multiplication  Example:

36 CMOS VLSI Design12: Datapath Functional UnitsSlide 36 Multiplication  Example:  M x N-bit multiplication –Produce N M-bit partial products –Sum these to produce M+N-bit product

37 CMOS VLSI Design12: Datapath Functional UnitsSlide 37 General Form  Multiplicand: Y = (y M-1, y M-2, …, y 1, y 0 )  Multiplier: X = (x N-1, x N-2, …, x 1, x 0 )  Product:

38 CMOS VLSI Design12: Datapath Functional UnitsSlide 38 Dot Diagram  Each dot represents a bit

39 CMOS VLSI Design12: Datapath Functional UnitsSlide 39 Array Multiplier

40 CMOS VLSI Design12: Datapath Functional UnitsSlide 40 Rectangular Array  Squash array to fit rectangular floorplan

41 CMOS VLSI Design12: Datapath Functional UnitsSlide 41 Fewer Partial Products  Array multiplier requires N partial products  If we looked at groups of r bits, we could form N/r partial products. –Faster and smaller? –Called radix-2 r encoding  Ex: r = 2: look at pairs of bits –Form partial products of 0, Y, 2Y, 3Y –First three are easy, but 3Y requires adder 

42 CMOS VLSI Design12: Datapath Functional UnitsSlide 42 Booth Encoding  Instead of 3Y, try –Y, then increment next partial product to add 4Y  Similarly, for 2Y, try –2Y + 4Y in next partial product

43 CMOS VLSI Design12: Datapath Functional UnitsSlide 43 Booth Encoding  Instead of 3Y, try –Y, then increment next partial product to add 4Y  Similarly, for 2Y, try –2Y + 4Y in next partial product

44 CMOS VLSI Design12: Datapath Functional UnitsSlide 44 Booth Encoding  Instead of 3Y, try –Y, then increment next partial product to add 4Y  Similarly, for 2Y, try –2Y + 4Y in next partial product

45 CMOS VLSI Design12: Datapath Functional UnitsSlide 45 Booth Encoding  Instead of 3Y, try –Y, then increment next partial product to add 4Y  Similarly, for 2Y, try –2Y + 4Y in next partial product

46 CMOS VLSI Design12: Datapath Functional UnitsSlide 46 Booth Encoding  Instead of 3Y, try –Y, then increment next partial product to add 4Y  Similarly, for 2Y, try –2Y + 4Y in next partial product

47 CMOS VLSI Design12: Datapath Functional UnitsSlide 47 Booth Encoding  Instead of 3Y, try –Y, then increment next partial product to add 4Y  Similarly, for 2Y, try –2Y + 4Y in next partial product

48 CMOS VLSI Design12: Datapath Functional UnitsSlide 48 Booth Encoding  Instead of 3Y, try –Y, then increment next partial product to add 4Y  Similarly, for 2Y, try –2Y + 4Y in next partial product

49 CMOS VLSI Design12: Datapath Functional UnitsSlide 49 Booth Encoding  Instead of 3Y, try –Y, then increment next partial product to add 4Y  Similarly, for 2Y, try –2Y + 4Y in next partial product

50 CMOS VLSI Design12: Datapath Functional UnitsSlide 50 Booth Hardware  Booth encoder generates control lines for each PP –Booth selectors choose PP bits

51 CMOS VLSI Design12: Datapath Functional UnitsSlide 51 Sign Extension  Partial products can be negative –Require sign extension, which is cumbersome –High fanout on most significant bit

52 CMOS VLSI Design12: Datapath Functional UnitsSlide 52 Simplified Sign Ext.  Sign bits are either all 0’s or all 1’s –Note that all 0’s is all 1’s + 1 in proper column –Use this to reduce loading on MSB

53 CMOS VLSI Design12: Datapath Functional UnitsSlide 53 Even Simpler Sign Ext.  No need to add all the 1’s in hardware –Precompute the answer!

54 CMOS VLSI Design12: Datapath Functional UnitsSlide 54 Advanced Multiplication  Signed vs. unsigned inputs  Higher radix Booth encoding  Array vs. tree CSA networks

Download ppt "EE466: VLSI Design Lecture 14: Datapath Functional Units."

Similar presentations

Multiplication and Shift Circuits Dec 2012 Shmuel Wimer Bar Ilan University, Engineering Faculty Technion, EE Faculty 1.

Multiplication and Shift Circuits Dec 2012 Shmuel Wimer Bar Ilan University, Engineering Faculty Technion, EE Faculty 1.
ECE2030 Introduction to Computer Engineering Lecture 13: Building Blocks for Combinational Logic (4) Shifters, Multipliers Prof. Hsien-Hsin Sean Lee School.

ECE2030 Introduction to Computer Engineering Lecture 13: Building Blocks for Combinational Logic (4) Shifters, Multipliers Prof. Hsien-Hsin Sean Lee School.
Arithmetic Functions and Circuits

Arithmetic Functions and Circuits
Datapath Functional Units. Outline  Comparators  Shifters  Multi-input Adders  Multipliers.

Datapath Functional Units. Outline  Comparators  Shifters  Multi-input Adders  Multipliers.
EE 382 Processor DesignWinter 98/99Michael Flynn 1 AT Arithmetic Most concern has gone into creating fast implementation of (especially) FP Arith. Under.

EE 382 Processor DesignWinter 98/99Michael Flynn 1 AT Arithmetic Most concern has gone into creating fast implementation of (especially) FP Arith. Under.
Design and Implementation of VLSI Systems (EN1600) Lecture 27: Datapath Subsystems 3/4 Prof. Sherief Reda Division of Engineering, Brown University Spring.

Design and Implementation of VLSI Systems (EN1600) Lecture 27: Datapath Subsystems 3/4 Prof. Sherief Reda Division of Engineering, Brown University Spring.
1 CS 140 Lecture 14 Standard Combinational Modules Professor CK Cheng CSE Dept. UC San Diego Some slides from Harris and Harris.

1 CS 140 Lecture 14 Standard Combinational Modules Professor CK Cheng CSE Dept. UC San Diego Some slides from Harris and Harris.
S. Reda EN160 SP’07 Design and Implementation of VLSI Systems (EN0160) Lecture 29: Datapath Subsystems 3/3 Prof. Sherief Reda Division of Engineering,

S. Reda EN160 SP’07 Design and Implementation of VLSI Systems (EN0160) Lecture 29: Datapath Subsystems 3/3 Prof. Sherief Reda Division of Engineering,
EECS 150 - Components and Design Techniques for Digital Systems Lec 18 – Arithmetic II (Multiplication) David Culler Electrical Engineering and Computer.

EECS Components and Design Techniques for Digital Systems Lec 18 – Arithmetic II (Multiplication) David Culler Electrical Engineering and Computer.
Fixed-Point Arithmetics: Part I

Fixed-Point Arithmetics: Part I
ECE C03 Lecture 61 Lecture 6 Arithmetic Logic Circuits Hai Zhou ECE 303 Advanced Digital Design Spring 2002.

ECE C03 Lecture 61 Lecture 6 Arithmetic Logic Circuits Hai Zhou ECE 303 Advanced Digital Design Spring 2002.
UNIVERSITY OF MASSACHUSETTS Dept

UNIVERSITY OF MASSACHUSETTS Dept
Lecture 8 Arithmetic Logic Circuits

Lecture 8 Arithmetic Logic Circuits
Contemporary Logic Design Arithmetic Circuits © R.H. Katz Lecture #24: Arithmetic Circuits -1 Arithmetic Circuits (Part II) Randy H. Katz University of.

Contemporary Logic Design Arithmetic Circuits © R.H. Katz Lecture #24: Arithmetic Circuits -1 Arithmetic Circuits (Part II) Randy H. Katz University of.
Combinational Comparators

Combinational Comparators
1 EE365 Three-state Outputs Encoders Multiplexers XOR gates.

1 EE365 Three-state Outputs Encoders Multiplexers XOR gates.
Introduction to CMOS VLSI Design Datapath Functional Units

Introduction to CMOS VLSI Design Datapath Functional Units
ECE 301 – Digital Electronics

ECE 301 – Digital Electronics
1 Lecture 4: Arithmetic for Computers (Part 4) CS 447 Jason Bakos.

1 Lecture 4: Arithmetic for Computers (Part 4) CS 447 Jason Bakos.
EE365 Adv. Digital Circuit Design Clarkson University Lecture #8 Buffers, Drivers, Encoders, MUXs & XORs.

EE365 Adv. Digital Circuit Design Clarkson University Lecture #8 Buffers, Drivers, Encoders, MUXs & XORs.

Similar presentations

Ads by Google