Introduction to Computer Data Representation

Computer Arithmetic

Author(s): Peter Fenwick

Pp: 77-102 (26)

DOI: 10.2174/9781608058822114010008

* (Excluding Mailing and Handling)


This chapter firstly extends the earlier principles of addition to provide faster adders. It then describes the underlying principles of binary multiplication and division, and especially techniques for fast operations.

Keywords: Adders, carry-lookahead adder, carry-skip adder, asynchronous adder, carry-save adder, fast carry-path adder, multipliers, twos-complement multiplication, skipping over 0s and 1s, high radix multiplier, combinational multiplier, restoring division, non-restoring division, SRT division, approximate quotient digit division, additive refinement division.

Related Journals
Related Books
© 2024 Bentham Science Publishers | Privacy Policy