The book "Computer Arithmetic" by Behrooz Parhami, published by Oxford University Press in 2000, is a comprehensive resource on the algorithms and hardware designs for computer arithmetic. The content is divided into several parts, covering number representation, addition/subtraction, multiplication, division, real arithmetic, function evaluation, and implementation topics. - **Part I: Number Representation** discusses various number systems, including fixed-radix positional systems, signed numbers, redundant number systems, and residue number systems. - **Part II: Addition/Subtraction** explores basic and fast adders, carry lookahead adders, and multioperand addition techniques. - **Part III: Multiplication** covers basic and high-radix multiplication schemes, tree and array multipliers, and variations in multipliers. - **Part IV: Division** delves into basic and high-radix division algorithms, variations in dividers, and convergence methods for division. - **Part V: Real Arithmetic** addresses floating-point representations and operations, errors and error control, and precise and certifiable arithmetic. - **Part VI: Function Evaluation** discusses methods for evaluating square roots, the CORDIC algorithm, and other function evaluation techniques. - **Part VII: Implementation Topics** covers high-throughput, low-power, and fault-tolerant arithmetic, as well as historical perspectives on computer arithmetic. Each chapter includes problems and references for further study, making it a valuable resource for both students and professionals in the field of computer arithmetic.The book "Computer Arithmetic" by Behrooz Parhami, published by Oxford University Press in 2000, is a comprehensive resource on the algorithms and hardware designs for computer arithmetic. The content is divided into several parts, covering number representation, addition/subtraction, multiplication, division, real arithmetic, function evaluation, and implementation topics. - **Part I: Number Representation** discusses various number systems, including fixed-radix positional systems, signed numbers, redundant number systems, and residue number systems. - **Part II: Addition/Subtraction** explores basic and fast adders, carry lookahead adders, and multioperand addition techniques. - **Part III: Multiplication** covers basic and high-radix multiplication schemes, tree and array multipliers, and variations in multipliers. - **Part IV: Division** delves into basic and high-radix division algorithms, variations in dividers, and convergence methods for division. - **Part V: Real Arithmetic** addresses floating-point representations and operations, errors and error control, and precise and certifiable arithmetic. - **Part VI: Function Evaluation** discusses methods for evaluating square roots, the CORDIC algorithm, and other function evaluation techniques. - **Part VII: Implementation Topics** covers high-throughput, low-power, and fault-tolerant arithmetic, as well as historical perspectives on computer arithmetic. Each chapter includes problems and references for further study, making it a valuable resource for both students and professionals in the field of computer arithmetic.