The number one requirement for computer arithmetic has always been speed. It is the main force that drives the technology. With increased speed larger problems can be attempted. To gain speed, advanced processors and pro gramming languages offer, for instance, compound arithmetic operations like matmul and dotproduct. But there is another side to the computational coin - the accuracy and reliability of the computed result. Progress on this side is very important, if not essential. Compound arithmetic operations, for instance, should always deliver a correct result. The user should not be obliged to perform an error analysis every time a compound arithmetic operation, implemented by the hardware manufacturer or in the programming language, is employed. This treatise deals with computer arithmetic in a more general sense than usual. Advanced computer arithmetic extends the accuracy of the elementary floating-point operations, for instance, as defined by the IEEE arithmetic standard, to all operations in the usual product spaces of computation: the complex numbers, the real and complex intervals, and the real and complex vectors and matrices and their interval counterparts. The implementation of advanced computer arithmetic by fast hardware is examined in this book. Arithmetic units for its elementary components are described. It is shown that the requirements for speed and for reliability do not conflict with each other. Advanced computer arithmetic is superior to other arithmetic with respect to accuracy, costs, and speed.

Innovative techniques and cutting-edge research in computer arithmetic design Computer arithmetic is a fundamental discipline that drives many modern digital technologies. High-performance VLSI implementations of 3-D graphics, encryption, streaming digital audio and video, and signal processing all require fast and efficient computer arithmetic algorithms. The demand for these fast implementations has led to a wealth of new research in innovative techniques and designs. Advanced Computer Arithmetic Design is the result of ten years of effort at Stanford University under the Sub-Nanosecond Arithmetic Processor (SNAP) project, which author Michael Flynn directs. Written with computer designers and researchers in mind, this volume focuses on design, rather than on other aspects of computer arithmetic such as number systems, representation, or precision. Each chapter begins with a review of conventional design approaches, analyzes the possibilities for improvement, and presents new research that advances the state of the art. The authors present new data in these vital areas: ? Addition and the Ling adder ? Improvements to floating-point addition ? Encoding to reduce execution times for multiplication ? The effects of technology scaling on multiplication ? Techniques for floating-point division ? Approximation techniques for high-level functions such as square root, logarithms, and trigonometric functions ? Assessing cost performance of arithmetic units ? Clocking to increase computer operation frequency ? New implementation of continued fractions to the approximation of functions This volume presents the results of a decade's research in innovative and progressive design techniques. Covering all the most important research topics in the field, Advanced Computer Arithmetic Design is the most up-to-date and comprehensive treatment of new research currently available.

This is the revised and extended second edition of the successful basic book on computer arithmetic. It is consistent with the newest recent standard developments in the field. The book shows how the arithmetic capability of the computer can be enhanced. The work is motivated by the desire and the need to improve the accuracy of numerical computing and to control the quality of the computed results (validity). The accuracy requirements for the elementary floating-point operations are extended to the customary product spaces of computations including interval spaces. The mathematical properties.

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 http://www.ece.ucsb.edu/~parhami/text_comp_arit.htm contains instructor resources, including complete lecture slides

This text explains the fundamental principles of algorithms available for performing arithmetic operations on digital computers. These include basic arithmetic operations like addition, subtraction, multiplication, and division in fixed-point and floating-point number systems as well as more complex operations such as square root extraction and evaluation of exponential, logarithmic, and trigonometric functions. The algorithms described are independent of the particular technology employed for their implementation.

This is often considered the first book on computer programming. It was written for the EDSAC (Electronic Delay Storage Automatic Calculator) computer that began operation in 1949 as the world's first regularly operated stored program computer. The idea of a library of subroutines was developed for the EDSAC, and is described in this book. Maurice Wilkes lead the development of the EDSAC.

Modern Computer Arithmetic focuses on arbitrary-precision algorithms for efficiently performing arithmetic operations such as addition, multiplication and division, and their connections to topics such as modular arithmetic, greatest common divisors, the Fast Fourier Transform (FFT), and the computation of elementary and special functions. Brent and Zimmermann present algorithms that are ready to implement in your favorite language, while keeping a high-level description and avoiding too low-level or machine-dependent details. The book is intended for anyone interested in the design and implementation of efficient high-precision algorithms for computer arithmetic, and more generally efficient multiple-precision numerical algorithms. It may also be used in a graduate course in mathematics or computer science, for which exercises are included. These vary considerably in difficulty, from easy to small research projects, and expand on topics discussed in the text. Solutions are available from the authors.