Publisher Description

Ideal for graduate and senior undergraduate courses in computer arithmetic and advanced digital design, Computer Arithmetic: Algorithms and Hardware Designs, Second Edition, provides a balanced, comprehensive treatment of computer arithmetic. It covers 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 aunified and consistent framework, the text begins with number representation and proceeds through basic arithmetic operations, floating-point arithmetic, and function evaluation methods. Later chapters coverbroad design and implementation topics-including techniques for high-throughput, low-power, fault-tolerant, and reconfigurable arithmetic. An appendix provides a historical view of the field and speculates on its future.An indispensable resource for instruction, professional development, and research, Computer Arithmetic: Algorithms and Hardware Designs, Second Edition, combines broad coverage of the underlying theories of computer arithmetic with numerousexamples of practical designs, worked-out examples, and a large collection of meaningful problems. This second edition includes a new chapter on reconfigurable arithmetic, in order to address the fact that arithmeticfunctions are increasingly being implemented on field-programmable gate arrays (FPGAs) and FPGA-like configurable devices. Updated and thoroughly revised, the book offers new and expanded coverage of saturating adders and multipliers, truncated multipliers, fused multiply-add units, overlapped quotient digit selection, bipartite and multipartite tables, reversible logic, dot notation, modular arithmetic, Montgomery modular reduction, division by constants, IEEE floating-point standard formats,and interval arithmetic.Features:* Divided into 28 lecture-size chapters * Emphasizes both the underlying theories of computer arithmetic andactual hardware designs * Carefully links computer arithmetic to other subfields of computer engineering * Includes 717 end-of-chapter problems ranging in complexity from simple exercises to mini-projects * Incorporates many examples of practical designs * Uses consistent standardized notation throughout * Instructor's manual includes solutions to text problems * An author-maintained website /~parhami/textcomp arit.htm contains instructor resources, including complete lecture slides

Author Biography

Behrooz Parhami is Professor of Computer Engineering at the University of California, Santa Barbara. He has written several textbooks, including Computer Arithmetic (OUP, 2000), and more than 200 research papers. He is a fellow of both the Institute of Electrical and Electronics Engineers (IEEE) and
the British Computer Society (BCS). He is a member of the Association for Computing Machinery (ACM), and a distinguished member of the Informatics Society of Iran, for which he served as a founding member and the first president.

Table of Contents

Table of ContentsPrefacePart I: NUMBER REPRESENTATION1. Numbers and Arithmetic2. Representing Signed Numbers3. Redundant Number Systems4. Residue Number SystemsPart II: ADDITION/SUBTRACTION5. Basic Addition and Counting6. Carry - Lookahead Adders7. Variations in Fast Adders8. Multioperand AdditionPart III: MULTIPLICATION9. Basic Multiplication Schemes10. High - Radix Multipliers11. Tree and Array Multipliers12. Variations in MultipliersPart IV: DIVISION13. Basic Division Schemes14. High - Radix Dividers15. Variations in Dividers16. Division by ConvergencePART V: REAL ARITHMETIC17. Floating - Point Representations18. Floating - Point Operations19. Errors and Error Control20. Precise and Certifiable ArithmeticPART VI: FUNCTION EVALUATION21. Square - Rooting Methods22. The CORDIC Algorithms23. Variations in Function Evaluation24. Arithmetic by Table Lookup25. High - Throughput ArithmeticPART VII: IMPLEMENTATION TOPICS26. Low - Power Arithmetic27. Fault - Tolerant Arithmetic28. Reconfigurable ArithmeticAPPENDIX: PAST, PRESENT, AND FUTUREA.1 Historical PerspectiveA.2 Early High - Performance MachineA.3 Deeply Pipelined Vector MachinesA.4 The DSP RevolutionA.5 Supercomputers on Our LapsA.6 Trends Outlook and Resources

Promotional

A text that integrates new material with an already strong organization--featuring more than 700 practice problems

Long Description

Ideal for graduate and senior undergraduate courses in computer arithmetic and advanced digital design, Computer Arithmetic: Algorithms and Hardware Designs, Second Edition, provides a balanced, comprehensive treatment of computer arithmetic. It covers 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,
fault-tolerant, and reconfigurable arithmetic. An appendix provides a historical view of the field and speculates on its future.An indispensable resource for instruction, professional development, and research, Computer Arithmetic: Algorithms and Hardware Designs, Second Edition, 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.
This second edition includes a new chapter on reconfigurable arithmetic, in order to address the fact that arithmetic functions are increasingly being implemented on field-programmable gate arrays (FPGAs) and FPGA-like configurable devices. Updated and thoroughly revised, the book offers new and expanded
coverage of saturating adders and multipliers, truncated multipliers, fused multiply-add units, overlapped quotient digit selection, bipartite and multipartite tables, reversible logic, dot notation, modular arithmetic, Montgomery modular reduction, division by constants, IEEE floating-point standard formats, and interval arithmetic.Features:* Divided into 28 lecture-size chapters * Emphasizes both the underlying theories
of computer arithmetic and actual hardware designs * Carefully links computer arithmetic to other subfields of computer engineering * Includes 717 end-of-chapter problems ranging in complexity from simple exercises to mini-projects * Incorporates many examples of practical designs
* Uses consistent standardized notation throughout * Instructor's manual includes solutions to text problems * An author-maintained website /~parhami/text comp arit.htm contains instructor resources, including complete lecture slides

Details