MultiOperand Addition

0 downloads 0 Views 1MB Size Report
Powerful concept – 4-bit binary full adder can be viewed as. (2,2,2,3 : 5)-counter. • Goal is to reduce n Numbers to 2 Numbers in Carry-Save Adder.
Multioperand Adders

Dr. Shadrokh Samavi

1

1

Contents 1. 2. 3. 4. 5. 6.

Using Two-Operand Adders Carry-Save Adders Wallace and Dadda Trees Parallel Counters Generalized Parallel Counters Adding Multiple Signed Numbers

Textbook: Computer Arithmetic: Algorithms and Hardware Designs, Oxford University Press, New York, 2000 , by Parhami, B. Many of the slides are either from the textbook or from Parhami’s slides.

Dr. Shadrokh Samavi

2

2

1. Using Two-Operand Adders

Dr. Shadrokh Samavi

3

3

Multioperand Addition • Consider the Following Addition: SUM = a[0]; for (i=1; i