Koren I. Computer Arithmetic Algorithms

A K Peters, 2002. — 292 p.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. An on-line JavaScript-based simulator for many of the algorithms contained in the book is available at : www.ecs.umass.edu/ece/koren/arith/simulatorConventional Number Systems
Unconventional Fixed-Radix Number Systems
Sequential Algorithms for Multplication and Division
Binary Floating-Point Numbers
Fast Addition
High-speed Multiplication
Fast Division -
Division through Multiplication
Elementary Function Evaluation
Logarithmic Number Systems
The Residue Number System