Skip to Content
Synthesis of Arithmetic Circuits: FPGA, ASIC and Embedded Systems
book

Synthesis of Arithmetic Circuits: FPGA, ASIC and Embedded Systems

by Jean-Pierre Deschamps, Gery J.A. Bioul, Gustavo D. Sutter
March 2006
Intermediate to advanced
576 pages
11h 43m
English
Wiley-Interscience
Content preview from Synthesis of Arithmetic Circuits: FPGA, ASIC and Embedded Systems

13

DIVIDERS

Chapter 6 shows that division is somewhat more intricate than the other three basic arithmetic operations. In the earliest computer applications, division was most often implemented as an assembly language program using the other arithmetic operations as primitives. Such was the case for multiplication too in elementary pioneer processors. The progress of technology together with increasing user needs have motivated designer efforts toward faster implementations of most arithmetic functions in general, and division in particular. This chapter presents implementations of the two most important classes of division algorithms, namely, digit recurrence (one digit at a time) and convergence types.

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

ASIC and FPGA Verification

ASIC and FPGA Verification

Richard Munden

Publisher Resources

ISBN: 9780471687832Purchase book