Computer arithmetic algorithms.
The book is a systematic presentation of main algorithms available for performing basic arithmetic operations (addition, subtraction, multiplication and division in both fixed- and floating-point presentation) as well as more complex operations such as square root, exponential, logarithmic, trigonometric functions in computers. A lot of material is devoted to high-speed algorithms. Conventional as well as negative-radix, signed-radix, logarithmic, and residue number systems are covered.NEWLINENEWLINENEWLINEThe first edition of this book has appeared in 1993. This is the second edition after 9 years. The contents of this edition is considerably extended. New sections include floating-point, prefix, carry-look-ahead, Ling adders, and fused multiply-add units. The remaining material was enlarged and updated. The focus is concentrated on understanding and fundamental principles of algorithms independently of any particular technology of their implementation. Each of 11 sections is supplemented by numerous exercises and exhaustive list of references. There are a number of ``smart exercises requiring something to prove, to show, to design, to estimate. There are given WWW links to additional study materials such as updates of the book, solutions to selected problems, on-line simulator for many algorithms contained in this book (www.ecs.umass.edu/ece/koren/arith/simulator). The book may be used as a textbook for in a senior-level or first year graduate level course in computer arithmetic as well as a reference book for engineers.
- An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
- Precise numerical computation
- Regular numeral systems for data structures
- Incremental column-wise verification of arithmetic circuits using computer algebra
- Constant-time sorting
- Functional verification of high performance adders in \textsc{Coq}
- An efficient universal addition scheme for all hybrid-redundant representations with weighted bit-set encoding
- Reciprocal and reciprocal square root units with operand modification and multiplication
- An efficient parity detection technique using the two-moduli set \(\{2^{h} - 1, 2^{h} + 1\}\)
- An optimized quantum circuit for converting from sign-magnitude to two's complement
- An improved Chen's parity detection technique for the two-moduli set
- Modern computer arithmetic
- Computer arithmetic. Algorithms and hardware implementations.
- Novel quantum compressor designs using new genetic algorithm-based simulator, analyzer and synthesizer software in nanotechnology
- Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem
- scientific article; zbMATH DE number 3874603 (Why is no real title available?)
- Computer-hardware evaluation of mathematical functions
- Formal proof of integer adders using all-prefix-sums operation
- scientific article; zbMATH DE number 3938520 (Why is no real title available?)
- scientific article; zbMATH DE number 3749094 (Why is no real title available?)
- scientific article; zbMATH DE number 48134 (Why is no real title available?)
- scientific article; zbMATH DE number 50839 (Why is no real title available?)
- scientific article; zbMATH DE number 603361 (Why is no real title available?)
- scientific article; zbMATH DE number 605662 (Why is no real title available?)
- scientific article; zbMATH DE number 641702 (Why is no real title available?)
- Fast exponentiation by folding the signed-digit exponent in half
- Beyond-Binary Arithmetic: Algorithms and VLSI Implementations.
- scientific article; zbMATH DE number 3992805 (Why is no real title available?)
- scientific article; zbMATH DE number 4117837 (Why is no real title available?)
- Arithmetic and Logic in Computer Systems
- Rethinking arithmetic for deep neural networks
- GenMul: Generating Architecturally Complex Multipliers to Challenge Formal Verification Tools
- Computer arithmetic. Volume III
- Guest editors' introduction: Special section on computer arithmetic
- Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques
- Efficient CRT-based residue-to-binary converter for the arbitrary moduli set
- “Logical” arithmetic on computers with two's complement binary arithmetic
- Correction to “logical” arithmetric on computers with two's complement binary arithmetic
- Arithmetic Algorithms in a Negative Base
- Inside your calculator. From simple programs to significant insights.
- Computer arithmetic and validity. Theory, implementation, and applications
- On the Possibility of Increasing the Accuracy of Computations in the Floating-Point Format with Multiple Exponents
- Formal proof of prefix adders
- Balanced non-adjacent forms
- Efficient realization of large size two's complement multipliers using embedded blocks in FPGAs
- An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques
- Fast modular multi-exponentiation using modified complex arithmetic
This page was built for publication: Computer arithmetic algorithms.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2773752)
