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.
FREE Two-Day Shipping for Students. Learn more |
| |||||||||||||||
 Sell Back Your Copy for $27.47
Whether you buy it new on Amazon for $67.01 or somewhere else, you can sell it back through our Book Trade-In Program at the current price of $27.47.
New Price$67.01
Trade-in Price$27.47
Price after
Trade-in$39.54 |
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Frequently Bought Together
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"
""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"
From the Publisher
An explanation of the fundamental principles of the algorithms available for performing arithmetic operations in digital computers.
--This text refers to an out of print or unavailable edition of this title.
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
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,
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,
By Todd Ebert (Long Beach California) - See all my reviews
Amazon Verified Purchase(What's this?)
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,
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.
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
First Sentence:
In conventional digital computers, integers are represented as binary numbers of fixed length. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
postnormalization step, new partial remainder, accumulated partial product, conventional number systems, nonrestoring division, outgoing carry, evaluating elementary functions, incoming carry, prefix graph, significand field, denormalized numbers, truncated multiplier, array divider, quotient bits, quotient digit, final remainder, array multiplier, conditional sum adder, residue number system, residue code, residue check, square root extraction, radix complement, multiplicative normalization, exception flag Key Phrases - Capitalized Phrases (CAPs): (learn more)
New York, Solid-State Circuits, Binary Floating-Point Numbers, Englewood Cliffs, Prentice Hall, Journal Res, Logarithmic Number Systems, Electronic Computers, Morgan Kaufmann New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
In conventional digital computers, integers are represented as binary numbers of fixed length. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
postnormalization step, new partial remainder, accumulated partial product, conventional number systems, nonrestoring division, outgoing carry, evaluating elementary functions, incoming carry, prefix graph, significand field, denormalized numbers, truncated multiplier, array divider, quotient bits, quotient digit, final remainder, array multiplier, conditional sum adder, residue number system, residue code, residue check, square root extraction, radix complement, multiplicative normalization, exception flag Key Phrases - Capitalized Phrases (CAPs): (learn more)
New York, Solid-State Circuits, Binary Floating-Point Numbers, Englewood Cliffs, Prentice Hall, Journal Res, Logarithmic Number Systems, Electronic Computers, Morgan Kaufmann New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 2
books:
35
books
cite this book:
See all 35 books citing this book
- Computer Arithmetic (Ieee Computer Society Press Tutorial) by Earl E. Swartzlander on page 139, and page 246
- Advances in Computers, Vol. 40 by Marvin Zelkowitz Ph.D. MS BS. on page 33
- Logic Design (Principles and Applications in Engineering, 5) by Wai-Kai Chen on page 64, page 72, and page 82
- OpenGL ES Game Development (Premier Press Game Development) by Dave Astle on page 81, and page 87
- Formal Methods in Computer-Aided Design: First International Conference, FMCAD '96, Palo Alto, CA, USA, November 6 - 8, 1996, Proceedings (Lecture Notes in Computer Science) by Mandayam and Camilleri, Albert editors Srivas on page 78, and page 93
- RTL Hardware Design Using VHDL: Coding for Efficiency, Portability, and Scalability by Pong P. Chu on page 600, and Back Matter
- Topics in Cryptology -- CT-RSA 2004: The Cryptographers' Track at the RSA Conference 2004, San Francisco, CA, USA, February 23-27, 2004, Proceedings (Lecture Notes in Computer Science) by Tatsuaki Okamoto on page 276
See all 35 books citing this book
Books on Related Topics
(learn more)
|
What Other Items Do Customers Buy After Viewing This Item?
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
