Computer Arithmetic Algorithms [Facsimile] [Paperback]

Israel Koren (Author)

Book Description

Publication Date: December 26, 1993 | ISBN-10: 0131519522 | ISBN-13: 978-0131519527

An explanation of the principles of the algorithms available for performing arithmetic operations in digital computers. The algorithms are described independently of specific implementation technology and within the same framework, so that similarities between algorithms become evident.

Editorial Reviews

Review

" ""This is one of the best available textbooks on computer arithmetic design..."" -Vladimir Botchev, Analogue Dialogue, May 2005
""I highly recommend this book for computer arithmetic professionals. Its value is its summary of the most interesting aspects of arithmetic algorithms."" -J. Z., IEEE Computer Magazine, March 1995" --This text refers to the Hardcover edition.

From the Publisher

An explanation of the fundamental principles of the algorithms available for performing arithmetic operations in digital computers.

See all Editorial Reviews

Product Details

• Paperback: 464 pages
• Publisher: Prentice Hall (December 26, 1993)
• Language: English
• ISBN-10: 0131519522
• ISBN-13: 978-0131519527
• Product Dimensions: 9.1 x 7.2 x 0.9 inches
• Shipping Weight: 1.4 pounds
• Average Customer Review: 3.8 out of 5 stars  See all reviews (6 customer reviews)
• Amazon Best Sellers Rank: #2,168,825 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

7 of 9 people found the following review helpful:

4.0 out of 5 stars Up-to-date Computer Arithmetic reference text, March 16, 1998

By A Customer

This review is from: Computer Arithmetic Algorithms (Paperback)

As stated in the authors' introduction, this book derives from a series of lectures, and as such the subject area is developed in a clear and linear fashion. A number of number systems are covered in the text as well as a good treatment of the usual topics such as addition and multiplication as well as other algorithms such as division, square-root and logarithmic number systems which are not so well covered in other texts (Hwang). I would rate the book as being good rather than excellent for the following reasons: - Overall the book is a little too compact and my copy has a PAPER cover ... not what I would expect for a reference. - The amateur finish lets down a good performance in terms of content - Addition section short ... does not cover BLC or Brent-Kung adders - Multiplication section and others very "thin" on references.

1 of 1 people found the following review helpful:

4.0 out of 5 stars Excellent but challenging book on computer arithmetic algorithms, November 26, 2009

By 

Todd Ebert (Long Beach California) - See all my reviews

Amazon Verified Purchase

This review is from: Computer Arithmetic Algorithms, Second Edition (Hardcover)

Although I found this book very challenging to read at times, the author gave enough examples for each algorithm to help steer me in the right direction. To succeed in reading and understanding the book's content one has to carefully work through the examples and practice with self-created ones to help get the needed insight. Many of the terse explanations and equations require careful thought and analysis from the reader. Often I found myself working out the deatails of some equation to convince myself of the author's assertion. In other words, one has to be actively engaged when working throug the book. The reward for doing seems very profound: namely one gains an understanding of how arithmetic is efficiently performed, and how transcendental functions are realized on a computer. The ability to reduce the foundations of mathematics to a Boolean structural level will no doubt find many applications that go far beyond hardware arithmetic component design. With that said, from basic addition to cosh and sinh, the author delivers as advertised. Dr. Koren has an impressive mastery of this subject.

5 of 7 people found the following review helpful:

4.0 out of 5 stars Amazing collection of ideas but terse in explanation, August 30, 2004

By 

M. Hamed (Baltimore, MD United States) - See all my reviews

This review is from: Computer Arithmetic Algorithms, Second Edition (Hardcover)

On a first reading, this book looked horrible. Little explanation is given. Well, the author gives you just a clue for you to do a lot of brainstorming to understand the concepts. While this helps to put you right in the mood for the material, since most of it are highly intellectual, but I think some more explanation and insight would have helped anyway. And actually it would have helped a lot. Instead of relying on each reader's understanding, giving more clues and more explanation means more insight for the reader and more getting the big picture. The big picture here is so important since many of the concepts in this book are highly interrelated.

On a second reading, this book was a very good reference. A good collection of well made, highly intellectual algorithms.

I recommend this book for every computer arithmetic enthusiast, but I suggest it to be read sequentially, and be prepared to a lot of brain storming.