Skip to Main Content
Computer Arithmetic and Validity
book

Computer Arithmetic and Validity

by Ulrich Kulisch
April 2013
Intermediate to advanced content levelIntermediate to advanced
456 pages
16h 7m
English
De Gruyter
Content preview from Computer Arithmetic and Validity
Section 6.1 A brief review of the realization of integer arithmetic 197
FA FA FA FA FAFA FA
Figure 6.10. Arrangement of full adders in a carry-save-adder.
A full adder has three binary inputs and two binary outputs, the sum and the carry
digit. Thus a CSA accepts three binary words as input and it produces two binary words
as output. Since no carry propagation is performed between adjacent full adders the
response time is very short. For b revity we shall use the following symbol for a CSA:
CSA
If the output of a CSA is fed back into the input registers a and b (as in the John
von Neumann adder), the unit can be used to add in a new summand in each
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Arithmetic and Logic in Computer Systems

Arithmetic and Logic in Computer Systems

Mi Lu
Interval Analysis

Interval Analysis

Günter Mayer

Publisher Resources

ISBN: 9783110301731