Computer Arithmetic Algorithms

by A A K PETERS LT

This text explains the fundamental principles of algorithms available for performing arithmetic operations on digital computers. These include basic arithmetic operations like addition, subtraction, multiplication, and division in fixed-point and floating-point number systems as well as more complex operations such as square root extraction and evaluation of exponential, logarithmic, and trigonometric functions. The algorithms described are independent of the particular technology employed for their implementation.

Numerical examples illustrate the working of the algorithms presented and explain the concepts behind the algorithms without relying on gate diagrams.

This new edition includes sections on floating-point adders, floating-point exceptions, general carry-look-ahead adders, prefix adders, Ling adders, and fused multiply-add units. New algorithms and implementations have been added to almost all chapters.

Unknown Binding

First published October 1, 1992

Reviews

[Janez Perme · Rating 3 out of 5]

I was honestly expecting much more from this title. First of all, the intentions of the author were good, but he ruined his work by omitting many additional clarifications of his equations. Much effort has been put from reader just to decipher what was done from one equation to the next. Makes no sense for such a book to be painful for a student or any other individual who is interested in inner workings of computer arithmetic. By the way: Parhami is not much better (yes, you read it right: NOT MUCH BETTER). I'll try Hwang: Computer Arithmetic: Principles, Architecture and Design. Maybe his work will be better in terms of clarity. On the other hand, there are some pretty good tricks in this title. Bonus: there are different number systems explained, used also in DSPs. Again, author's intentions were good, but explanations unfortunately suck.