Computer Arithmetic: Algorithms and Hardware Designs

Features

• Cover Type: Hard Cover with 490 pages
• Published by: Oxford University Press, USA
• Edition: 1st Edition September 9, 1999
• Written in: English
• ISBN 10 Number: 0195125835
• ISBN 13 Number: 978-0195125832
• Book Dimensions: 9.5 x 7.6 x 1.2 inches
• Weighs: 2.3 pounds

Product Description
Ideal for graduate and senior undergraduate level courses in computer arithmetic and advanced digital design, Computer Arithmetic: Algorithms and Hardware Designs provides a balanced, comprehensive treatment of computer arithmetic, covering topics in arithmetic unit design and circuit implementation that complement the architectural and algorithmic speedup techniques used in high-performance computer architecture and parallel processing. Using a unified and consistent framework, the text begins with number representation and proceeds through basic arithmetic operations, floating-point arithmetic, and function evaluation methods. Later chapters cover broad design and implementation topics--including techniques for high-throughput, low-power, and fault-tolerant arithmetic--and also feature brief case studies.
An indispensable resource for instruction, professional development, and research in digital computer arithmetic, Computer Arithmetic: Algorithms and Hardware Designs combines broad coverage of the underlying theories of computer arithmetic with numerous examples of practical designs, worked-out examples, and a large collection of meaningful problems.
Features:
DT Divided into 28 lecture-size chapters
DT Emphasizes both the underlying theories of computer arithmetic and actual hardware designs
DT Carefully links computer arithmetic to other subfields of computer engineering
DT Includes over 450 end-of-chapter problems ranging in complexity from simple exercises to mini-projects
DT Incorporates many examples of practical designs
DT Uses consistent standardized notation throughout
DT Instructor's manual includes solutions to text problems, additional exercises, test questions, and enlarged versions of figures and charts

About The Author
Behrooz Parhami, Professor in the Department of Electrical and Computer Engineering, University of California, Santa Barbara.

Reader Reviews
I just finished a course that used this book and I was so disgusted with the book that I felt a review was necessary. It seems that this book was written for people who already have a background in computer algorithms. The examples, where rarely provided, leave out basic information necessary to comprehend the material. The author uses notation and figures without explaning how to read them. I learned almost nothing form this book and would not suggest it to anyone. In fact, if this author has written any other books, I would stay away from them as well.