# Computer Arithmetic: Algorithms and Hardware Designs

This preview shows pages 1–9. Sign up to view the full content.

CSE 246: Computer Arithmetic Algorithms and Hardware Design Instructor: Prof. Chung-Kuan Cheng Fall 2006 Lecture 5: Addition and Multiplication

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
CSE 246 2 Topics: False Path: Cycles Multi-Operands Addition Carry Save Addition Multiplication 2’s Complement Booth Recoding
CSE 246 3 False Path: Cycles Cycles of False Paths: Eg. 1’s complement number addition Positive: x Negative: (2 n -1)-x Addition (2 n -1)-x + (2 n -1)-y = 2 n +(2 n -1)-(x+y)-1 C out A 3,0 B 3,0 S 3,0 Adder C in

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
CSE 246 4 Example -3-5 = -8 11100 -3 + 11010 -5 110110 110111 -8 0+0=0 11111 0 + 11111 0 111110 111111 0

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
CSE 246 6 Example A (3,2) counter compresses X rows to 2/3X rows each time Tree structure in implementation A G H D C B F E A E C B F H G D
CSE 246 7 Other Counters (5,3) counter C a C b S 0 (7,3) counter 7 S 0 S 2 S 1 Design of (5,3) counter using full adders FA FA C a C b S 0

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
8 Multiplication
This is the end of the preview. Sign up to access the rest of the document.

### Page1 / 19

let5-Adders and Multipliers - CSE 246 Computer Arithmetic...

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online