Computer arithmetic algorithms. (Q2773752)

The book is a systematic presentation of main algorithms available for performing basic arithmetic operations (addition, subtraction, multiplication and division in both fixed- and floating-point presentation) as well as more complex operations such as square root, exponential, logarithmic, trigonometric functions in computers. A lot of material is devoted to high-speed algorithms. Conventional as well as negative-radix, signed-radix, logarithmic, and residue number systems are covered.NEWLINENEWLINENEWLINEThe first edition of this book has appeared in 1993. This is the second edition after 9 years. The contents of this edition is considerably extended. New sections include floating-point, prefix, carry-look-ahead, Ling adders, and fused multiply-add units. The remaining material was enlarged and updated. The focus is concentrated on understanding and fundamental principles of algorithms independently of any particular technology of their implementation. Each of 11 sections is supplemented by numerous exercises and exhaustive list of references. There are a number of ``smart'' exercises requiring something to prove, to show, to design, to estimate. There are given WWW links to additional study materials such as updates of the book, solutions to selected problems, on-line simulator for many algorithms contained in this book (www.ecs.umass.edu/ece/koren/arith/simulator). The book may be used as a textbook for in a senior-level or first year graduate level course in computer arithmetic as well as a reference book for engineers.