DatapathFunctionalUnits.pptVIP

Datapath Functional Units Adapted from David Harris of Harvey Mudd College Outline Comparators Shifters Multi-input Adders Multipliers Comparators 0’s detector: A = 00…000 1’s detector: A = 11…111 Equality comparator: A = B Magnitude comparator: A B 1’s 0’s Detectors 1’s detector: N-input AND gate 0’s detector: NOTs + 1’s detector (N-input NOR) Equality Comparator Check if each bit is equal (XNOR, aka equality gate) 1’s detect on bitwise equality Magnitude Comparator Compute B-A and look at sign B-A = B + ~A + 1 For unsigned numbers, carry out is sign bit 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) 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 = ____ Shifters Logical Shift: Shifts number left or right and fills with 0’s 1011 LSR 1 = 0101 1011 LSL1 = 0110 Arithmetic Shift: Shifts number left or right. Rt shift sign extends 1011 ASR1 = 1101 1011 ASL1 = 0110 Rotate: Shifts number left or right and fills with lost bits 1011 ROR1 = 1101 1011 ROL1 = 0111 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) Funnel Shifter Operation Computing N-k requires an adder Funnel Shifter Operation Computing N-k requires an adder Funnel Shifter Operation Computing N-k requires an adder Funnel Shifter Operation Computing N-k requires an adder Funnel Shifter Operation Computing N-k requires an adder Simplified Funnel Shifter Optimize down to 2N-1 bit input Simplified Funnel Shifter Optimize down to 2N-1 bit input Simplified Funnel Shifter Optimize down to 2N-1 bit