Skip to main content

Functional Analysis and Synthesis of Binary Division Devices

  • Chapter
Computer Arithmetic
  • 2246 Accesses

Abstract

Similarly to the chapter dedicated to the multiplication operation, this chapter begins with the presentation of the fundamental methods for binary division. In the same unitary manner used throughout the entire book, the synthesis of a sequential device for division is described, based on the non-restoring procedure for unsigned binary integer numbers. The description of the combinational array structures follows, which are favorable with respect to the hardware implementations of the binary division operation. Solutions are given for dividing signed fractional binary numbers based on the non-restoring procedure, respectively, for dividing unsigned binary integer numbers based on the restoring procedure. A distinct section is dedicated to the SRT procedures for binary division, both for radix-2 and for radix-4. The chapter concludes with a section dedicated to the division methods based on rapid convergence.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Elisardo Antelo, Tomas Lang, Paolo Montuschi, Alberto Nannarelli: “Digit-Recurrence Dividers with Reduced Logical Depth” IEEE Trans. Comput., vol. 54, no. 7, 2005, pp. 837–851.

    Article  Google Scholar 

  2. Miloš D. Ercegovac, Tomas Lang: “Digital Arithmetic” Morgan Kaufmann, San Mateo, 2004.

    Google Scholar 

  3. John P. Hayes: “Computer Architecture and Organization” McGraw-Hill, New York, Third Edition, 1998.

    Google Scholar 

  4. John L. Hennessy, David A. Patterson: “Computer Architecture. A Quantitative Approach” Morgan Kaufmann, San Mateo, Third Edition, 2003; Appendix H: Computer Arithmetic by David Goldberg.

    Google Scholar 

  5. Peter Kornerup, Jean-Michel Muller: “Leading Guard Digits in Finite Precision Redundant Representations” IEEE Trans. Comput., vol. 55, no. 5, 2006, pp. 541–548.

    Article  Google Scholar 

  6. Israel Koren: “Computer Arithmetic Algorithms” Prentice Hall International, Englewood Cliffs, 1993.

    Google Scholar 

  7. Peter Kornerup: “Revisiting SRT Quotient Digit Selector” Proc. 16th IEEE Symp. Computer Arithmetic, 2003, pp. 38–45.

    Chapter  Google Scholar 

  8. Peter Kornerup: “Digit Selection for SRT Division and Square Root” IEEE Trans. Comput., vol. 54, no. 3, 2005, pp. 294–303.

    Article  MathSciNet  Google Scholar 

  9. Ulrich W. Kulisch: “Advanced Arithmetic for the Digital Computer. Design of Arithmetic Units” Springer, Berlin, 2002.

    Book  MATH  Google Scholar 

  10. Tomas Lang, Elisardo Antelo: “Radix-4 Reciprocal Square Root and Its Combination with Division and Square Root” IEEE Trans. Comput., vol. 52, no. 9, 2003, pp. 1100–1114.

    Article  Google Scholar 

  11. Stuart F. Oberman: “Floating Point Division and Square Root Algorithms and Implementation in the AMD-K7 Microprocessor” Proc. 14th Symp. Computer Arithmetic (ARITH 14), 1999, pp. 106–115.

    Google Scholar 

  12. Stuart F. Oberman, Michael J. Flynn: “Division Algorithms and Implementations” IEEE Trans. Comput., vol. 46, no. 8, 1997, pp. 833–854.

    Article  MathSciNet  Google Scholar 

  13. Amos R. Omondi: “Computer Arithmetic Systems. Algorithms, Architecture and Implementations” 1994. C.A.R. Hoare Series Editor.

    MATH  Google Scholar 

  14. Behrooz Parhami: “Computer Arithmetic. Algorithms and Hardware Designs” Oxford University Press, London, 2000.

    Google Scholar 

  15. Behrooz Parhami: “Tight Upper Bounds on the Minimum Precision Required of the Divisor and the Partial Remainder in High-Radix Division” IEEE Trans. Comput., vol. 52, no. 11, 2003, pp. 1509–1514.

    Article  Google Scholar 

  16. Jose-Alejandro Piñeiro, Javier D. Bruguera: “High-Speed Double-Precision Computation of Reciprocal, Division, Square Root and Inverse Square Root” IEEE Trans. Comput., vol. 51, no. 12, 2002, pp. 1377–1388.

    Article  MathSciNet  Google Scholar 

  17. L. Howard Pollard: “Computer Design and Architecture” Prentice-Hall International, Englewood Cliffs, 1990.

    Google Scholar 

  18. William Stallings: “Computer Organization and Architecture. Designing for Performance” Prentice Hall International, Englewood Cliffs, 1999.

    Google Scholar 

  19. M. Vlăduţiu, N. Petrakis: “Adapted Combinational Array for Exact Binary Division with Signed Operands” International Conference on Technical Informatics, Proceedings vol. 5, Timişoara, 1994, pp. 1–10.

    Google Scholar 

  20. John F. Wakerly: “Digital Design. Principles and Practices” Prentice-Hall, New York, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Vlăduţiu, M. (2012). Functional Analysis and Synthesis of Binary Division Devices. In: Computer Arithmetic. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18315-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-18315-7_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-18314-0

  • Online ISBN: 978-3-642-18315-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics