SRT Division and Square Root

  • David M. Russinoff


The simplest and most common approach to computer division is digit recurrence, an iterative process whereby at each step, a multiple of the divisor is subtracted from the current remainder and the quotient is updated accordingly by appending a fixed number of bits k, determined by the underlying radix, r = 2k. Thus, quotient convergence is linear, resulting in fairly high latencies of high-precision operations for the most common radices, r = 2, 4, and 8.


  1. 4.
    Cocke, J., Sweeney, D. W.: High speed arithmetic in a parallel device (1957). Available at
  2. 5.
    Ercegovac, M. D., Lang, T.: Division and Square Root Digit-Recurrence Algorithms and Implementations. Kluwer Academic Publishers (1994)Google Scholar
  3. 26.
    Robertson, J. E.: A new class of digital division methods. IRE Transactions on Electronic Computers EC-7 (1958)Google Scholar
  4. 31.
    Russinoff, D. M.: Computation and formal verification of SRT quotient and square root digit selection tables. IEEE Trans. Comput. 62(5), 900–913 (2013). Available at MathSciNetCrossRefGoogle Scholar
  5. 35.
    Tocher, K. D.: Techniques of multiplication and division for automatic binary computers. Quarterly Journal of Mechanics and Applied Mathematics 2 (1958)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • David M. Russinoff
    • 1
  1. 1.Arm HoldingsAustinUSA

Personalised recommendations