Skip header Section
Skip Bibliometrics Section
Computer arithmetic algorithmsMarch 1993
- Author:
- Israel Koren
Abstract
No abstract available.
Cited By
- Souza Rosa L, Dasu A, C. Diniz P and Bonato V (2018). A Faddeev Systolic Array for EKF-SLAM and its Arithmetic Data Representation Impact on FPGA, Journal of Signal Processing Systems, 90:3, (357-369), Online publication date: 1-Mar-2018.
Ward S, Papa D, Li Z, Sze C, Alpert C and Swartzlander E Quantifying academic placer performance on custom designs Proceedings of the 2011 international symposium on Physical design, (91-98)- Le Lann C, Boland D and Constantinides G The Krawczyk algorithm Proceedings of the 7th international conference on Reconfigurable computing: architectures, tools and applications, (287-295)
- Cilardo A A new speculative addition architecture suitable for two's complement operations Proceedings of the Conference on Design, Automation and Test in Europe, (664-669)
- Park K, Park H, Jeun W and Ha S (2009). Boolean circuit programming, Journal of Discrete Algorithms, 7:2, (267-277), Online publication date: 1-Jun-2009.
- Jose B and Radhakrishnan D (2009). Redundant binary partial product generators for compact accumulation in Booth multipliers, Microelectronics Journal, 40:11, (1606-1612), Online publication date: 1-Nov-2009.
- Verma A, Brisk P and Ienne P Variable latency speculative addition Proceedings of the conference on Design, automation and test in Europe, (1250-1255)
- Carneiro D, Pinheiro P, Prudêncio P, Cavalcante D, Sousa D, Braquehais R, Marrocos T and Fernandez M IP-checksum incremental update method proposal for efficient use of energy in wireless environments Proceedings of the 2007 Euro American conference on Telematics and information systems, (1-7)
- Chen O and Chen L (2007). A hardware-efficient programmable FIR processor using input-data and tap folding, EURASIP Journal on Advances in Signal Processing, 2007:1, (55-55), Online publication date: 1-Jan-2007.
- Dadda L (2007). Multioperand Parallel Decimal Adder, IEEE Transactions on Computers, 56:10, (1320-1328), Online publication date: 1-Oct-2007.
- Wey C, Lin S and Shiue M A pipelined divider with a small lookup table Proceedings of the 6th WSEAS International Conference on Instrumentation, Measurement, Circuits and Systems, (181-185)
- Hong I (2006). A developing approach of the space-based SIFP using rectangular algorithm, Signal Processing, 86:12, (3904-3914), Online publication date: 1-Dec-2006.
- Fu Z and Malik S On solving the partial MAX-SAT problem Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing, (252-265)
- Blömer J, Otto M and Seifert J Sign change fault attacks on elliptic curve cryptosystems Proceedings of the Third international conference on Fault Diagnosis and Tolerance in Cryptography, (36-52)
- Wires K and Schulte M (2006). Reciprocal and Reciprocal Square Root Units with Operand Modification and Multiplication, Journal of VLSI Signal Processing Systems, 42:3, (257-272), Online publication date: 1-Mar-2006.
- Rajagopal S and Cavallaro J (2006). Truncated Online Arithmetic with Applications to Communication Systems, IEEE Transactions on Computers, 55:10, (1240-12529), Online publication date: 1-Oct-2006.
- Cardarilli G, Ottavi M, Pontarelli S, Re M and Salsano A (2006). Fault Localization, Error Correction, and Graceful Degradation in Radix 2 Signed Digit-Based Adders, IEEE Transactions on Computers, 55:5, (534-540), Online publication date: 1-May-2006.
- Even G On teaching fast adder designs Theoretical Computer Science, (313-347)
- Muscedere R, Dimitrov V, Jullien G and Miller W (2005). Efficient Techniques for Binary-to-Multidigit Multidimensional Logarithmic Number System Conversion Using Range-Addressable Look-Up Tables, IEEE Transactions on Computers, 54:3, (257-271), Online publication date: 1-Mar-2005.
- Yehia S, Clark N, Mahlke S and Flautner K Exploring the design space of LUT-based transparent accelerators Proceedings of the 2005 international conference on Compilers, architectures and synthesis for embedded systems, (11-21)
- Jeong J, Park W, Jeong W, Han T and Lee M (2004). A Cost-Effective Pipelined Divider with a Small Lookup Table, IEEE Transactions on Computers, 53:4, (489-495), Online publication date: 1-Apr-2004.
- Aoki T, Homma N and Higuchi T (2019). Evolutionary Synthesis of Arithmetic Circuit Structures, Artificial Intelligence Review, 20:3-4, (199-232), Online publication date: 1-Dec-2003.
- Vergos H, Nikolos D, Bellos M and Efstathiou C (2003). Deterministic BIST for RNS Adders, IEEE Transactions on Computers, 52:7, (896-906), Online publication date: 1-Jul-2003.
- Efstathiou C, Vergos H and Nikolos D (2003). Modulo 2n ± 1 Adder Design Using Select-Prefix Blocks, IEEE Transactions on Computers, 52:11, (1399-1406), Online publication date: 1-Nov-2003.
- Avižienis A Adder Encyclopedia of Computer Science, (17-20)
- Avižienis A Arithmetic-logic unit (ALU) Encyclopedia of Computer Science, (77-81)
- Hong J and Wu C (2003). Cellular-array modular multiplier for fast RSA public-key cryptosystem based on modified Booth's algorithm, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 11:3, (474-484), Online publication date: 1-Jun-2003.
- Lam S and Srikanthan T (2019). Environment Modelling for Robot Navigation Using VLSI-Efficient Logarithmic Approximation Method, Journal of Intelligent and Robotic Systems, 35:1, (23-40), Online publication date: 1-Sep-2002.
- Vergos H, Efstathiou C and Nikolos D (2002). Diminished-One Modulo 2^n +1 Adder Design, IEEE Transactions on Computers, 51:12, (1389-1399), Online publication date: 1-Dec-2002.
- Montuschi P and Lang T (2001). Boosting Very-High Radix Division with Prescaling and Selection by Rounding, IEEE Transactions on Computers, 50:1, (13-27), Online publication date: 1-Jan-2001.
- Lee J, Kim E and Lee D Imprecise data computation for high performance asynchronous processors Proceedings of the 2001 Asia and South Pacific Design Automation Conference, (261-266)
- Mukherjee N, Rajski J and Tyszer J (2001). Testing Schemes for FIR Filter Structures, IEEE Transactions on Computers, 50:7, (674-688), Online publication date: 1-Jul-2001.
- Park I and Kang H Digital filter synthesis based on minimal signed digit representation Proceedings of the 38th annual Design Automation Conference, (468-473)
- Parks M (2000). Number-Theoretic Test Generation for Directed Rounding, IEEE Transactions on Computers, 49:7, (651-658), Online publication date: 1-Jul-2000.
- Kalampoukas L, Nikolos D, Efstathiou C, Vergos H and Kalamatianos J (2000). High-Speed Parallel-Prefix Modulo 2n - 1 Adders, IEEE Transactions on Computers, 49:7, (673-680), Online publication date: 1-Jul-2000.
- Yeh W and Jen C (2000). High-Speed Booth Encoded Parallel Multiplier Design, IEEE Transactions on Computers, 49:7, (692-701), Online publication date: 1-Jul-2000.
- Chen C, Chen R and Yang C (2000). Pipelined Computation of Very Large Word-Length LNS Addition/Subtraction with Polynomial Hardware Cost, IEEE Transactions on Computers, 49:7, (716-726), Online publication date: 1-Jul-2000.
- Joye M and Yen S (2000). Optimal Left-to-Right Binary Signed-Digit Recoding, IEEE Transactions on Computers, 49:7, (740-748), Online publication date: 1-Jul-2000.
- Choi J, Jeon J and Choi K Power minimization of functional units partially guarded computation Proceedings of the 2000 international symposium on Low power electronics and design, (131-136)
- Hong J and Wu C Radix-4 modular multiplication and exponentiation algorithms for the RSA public-key cryptosystem Proceedings of the 2000 Asia and South Pacific Design Automation Conference, (565-570)
- Even G and Paul W (2000). On the Design of IEEE Compliant Floating Point Units, IEEE Transactions on Computers, 49:5, (398-413), Online publication date: 1-May-2000.
- Gizopoulos D, Paschalis A and Zorian Y (1999). An Effective Built-In Self-Test Scheme for Parallel Multipliers, IEEE Transactions on Computers, 48:9, (936-950), Online publication date: 1-Sep-1999.
- Noufal I and Nicolaidis M A CAD framework for generating self-checking multipliers based on residue codes Proceedings of the conference on Design, automation and test in Europe, (29-es)
- Nicolaidis M and Duarte R (1999). Fault-Secure Parity Prediction Booth Multipliers, IEEE Design & Test, 16:3, (90-101), Online publication date: 1-Jul-1999.
- Leong M, Yeung M, Yeung C, Fu C, Heng P and Leong P Automatic Floating to Fixed Point Translation and its Application to Post-Rendering 3D Warping Proceedings of the Seventh Annual IEEE Symposium on Field-Programmable Custom Computing Machines
- Girau B, Marchal P, Nussbaum P, Tisserand A and Restrepo H Evolvable Platform for Array Processing Proceedings of the 7th International Conference on Microelectronics for Neural, Fuzzy and Bio-Inspired Systems
- Al-Asaad H, Hayes J and Murray B (2019). Scalable Test Generators for High-Speed Datapath Circuits, Journal of Electronic Testing: Theory and Applications, 12:1-2, (111-125), Online publication date: 1-Feb-1998.
- Phatak D (1998). Double Step Branching CORDIC, IEEE Transactions on Computers, 47:5, (587-602), Online publication date: 1-May-1998.
- Stan M, Tenca A and Ercegovac M (1998). Long and Fast Up/Down Counters, IEEE Transactions on Computers, 47:7, (722-735), Online publication date: 1-Jul-1998.
- Wey C and Shieh M (1998). Design of a High-Speed Square Generator, IEEE Transactions on Computers, 47:9, (1021-1026), Online publication date: 1-Sep-1998.
- Phatak D (1998). Comments on Duprat and Muller's Branching CORDIC Paper, IEEE Transactions on Computers, 47:9, (1037-1040), Online publication date: 1-Sep-1998.
- Lo J (1997). A Fast Binary Adder with Conditional Carry Generation, IEEE Transactions on Computers, 46:2, (248-253), Online publication date: 1-Feb-1997.
- Rojas R (2018). Konrad Zuse's Legacy, IEEE Annals of the History of Computing, 19:2, (5-16), Online publication date: 1-Apr-1997.
- Srinivas H, Parhi K and Montalvo L (1997). Radix 2 Division with Over-Redundant Quotient Selection, IEEE Transactions on Computers, 46:1, (85-92), Online publication date: 1-Jan-1997.
- Ito M, Takagi N and Yajima S (1997). Efficient Initial Approximation for Multiplicative Division and Square Root by a Multiplication with Operand Modification, IEEE Transactions on Computers, 46:4, (495-498), Online publication date: 1-Apr-1997.
- Hasan M (1997). Division-and-Accumulation over GF(2m), IEEE Transactions on Computers, 46:6, (705-708), Online publication date: 1-Jun-1997.
- Nicolaidis M, Duarte R, Manich S and Figueras J (1997). Fault-Secure Parity Prediction Arithmetic Operators, IEEE Design & Test, 14:2, (60-71), Online publication date: 1-Apr-1997.
- Becker B, Drechsler R and Reddy S (Quasi-) Linear Path Delay Fault Tests for Adders Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications
- Negoi A, Guyot A and Zimmermann J A dedicated circuit for charged particles simulation using the Monte Carlo method Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures and Processors
- Schulte M and Stine J Accurate Function Approximations by Symmetric Table Lookup and Addition Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures and Processors
- Mukherjee N, Rajski J and Tyszer J Parameterizable Testing Scheme for FIR Filters Proceedings of the 1997 IEEE International Test Conference
- Kantabutra V (1996). On Hardware for Computing Exponential and Trigonometric Functions, IEEE Transactions on Computers, 45:3, (328-339), Online publication date: 1-Mar-1996.
- Dadda L and Piuri V (1996). Pipelined Adders, IEEE Transactions on Computers, 45:3, (348-356), Online publication date: 1-Mar-1996.
- Acken K, Irwin M and Owens R Power comparisons for barrel shifters Proceedings of the 1996 international symposium on Low power electronics and design, (209-212)
- Becker B, Drechsler R, Krieger R and Reddy S A Fast Optimal Robust Path Delay Fault Testable Adder Proceedings of the 1996 European conference on Design and Test
- Nicolaidis M, Manich S and Figueras J Achieving Fault Secureness in Parity Prediction Arithmetic Operators Proceedings of the 1996 European conference on Design and Test
- Trahan J, Lu C and Vaidyanathan R Integer and Floating Point Matrix-Vector Multiplication on the Reconfigurable Mesh Proceedings of the 10th International Parallel Processing Symposium, (702-706)
- Frezza S, Levitan S and Chrysanthis P Requirements-based design evaluation Proceedings of the 32nd annual ACM/IEEE Design Automation Conference, (76-81)
- Kassab M, Mukherjee N, Rajski J and Tyszer J Software accelerated functional fault simulation for data-path architectures Proceedings of the 32nd annual ACM/IEEE Design Automation Conference, (333-338)
- Nagendra C, Owens R and Irwin M Unifying carry-sum and signed-digital number representations for low power Proceedings of the 1995 international symposium on Low power design, (15-20)
- Musoll E and Cortadella J High-level synthesis techniques for reducing the activity of functional units Proceedings of the 1995 international symposium on Low power design, (99-104)
- Musoll E and Cortadella J Scheduling and resource binding for low power Proceedings of the 8th international symposium on System synthesis, (104-109)
- Mukherjee N, Rajski J and Tyszer J On testable multipliers for fixed-width data path architectures Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design, (541-547)
- Phatak D and Koren I (2019). Hybrid Signed-Digit Number Systems, IEEE Transactions on Computers, 43:8, (880-891), Online publication date: 1-Aug-1994.
Index Terms
- Computer arithmetic algorithms
Reviews
James Martin Varah
An excellent introduction to the rich field of algorithms for computer arithmetic is provided. The book begins with a discussion of binary number systems and floating-point representations, including the IEEE standard. The next several chapters deal with algorithms for the fundamental operations of addition, multiplication, and division. There is a chapter on algorithms for the computation of elementary functions and finally one on logarithm and residue number systems. The book is well written, with exercises and a bibliography in each chapter, and it could be used as a text for senior undergraduate or first-year graduate students. As the author mentions, complex algorithms for even the basic operations of multiplication and division have become more prevalent recently with the ever-increasing availability of memory and the demands for faster arithmetic processors. Yet it is rare to find these algorithms discussed in a readily available text like this one. Moreover, Koren discusses all these algorithms within the same framework, so their similarities and differences are more apparent. The focus of the text is on the basic floating-point operations of addition, multiplication, and division, and these areas are covered well. The chapter on elementary functions is rather short, however; additional information and more examples here would have been welcome.
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.