This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Radix-4 Square Rot Without Initial PLA
August 1990 (vol. 39 no. 8)
pp. 1016-1024

A systematic derivation of a radix-4 square-root algorithm using redundant residual and result is presented. Unlike other similar schemes it does not use a table lookup or PLA for the initial step, resulting in a simpler implementation without any time penalty. The scheme can be integrated with division and incorporates an on-the-fly conversion and rounding of the result, thus eliminating a carry-propagate step to obtain the final result. The result-digit selection uses 3 bits of the result and 7 bits of the estimate of the residual.

[1] L. Ciminiera and P. Montuschi, "Higher radix square rooting," Intern. Rep., Politecnico di Torino, Dipartimento di Automatica e Informatica, I.R. DAI/ARC 4-87, Dec. 1987.
[2] M. D. Ercegovac and T. Lang, "On-the-fly conversion of redundant into conventional representations,"IEEE Trans. Comput., vol. C-36, no. 7, pp. 895-897, July 1987.
[3] M. D. Ercegovac and T. Lang, "On-the-fly rounding for division and square root," inProc. 9th Symp. Comput. Arithmetic, 1989, pp. 169-173.
[4] M. D. Ercegovac and T. Lang, "Division and square root algorithms and implementations," monograph in preparation.
[5] J. Fandrianto, "Algorithm for high speed shared radix-4 division and radix-4 square root," inProc. 8th Symp. Comput. Arithmetic, 1987, pp. 73-79.
[6] J. B. Gosling and C. M. S. Blakeley, "Arithmetic unit with integral division and square-root,"IEE Proc., vol. 134, pt. E, no. 1, pp. 17-23, Jan. 1987.
[7] S. Kuninobuet al., "Design of high speed MOS multiplier and divider using redundant binary representation," inProc. 8th Int. Symp. Comput. Arithmetic, 1987, pp. 80-86.
[8] P. Montuschi and L. Ciminiera, "On the efficient implementation of higher radix square root algorithms," inProc. 9th Symp. Comput. Arithmetic, Sept. 1989, pp. 154-161.
[9] M. B. Vineberg, "A radix-4 square-rooting algorithm," Rep. 182, Dep. Comput. Sci., Univ. of Illinois, Urbana-Champaign, June 1965.
[10] J. H. Zurawski and J. B. Gosling, "Design of a high-speed square root multiply and divide unit,"IEEE Trans. Comput., vol. C-36, pp. 13-23, Jan. 1987.

Index Terms:
redundant result; on-the-fly rounding; radix-4 square-root algorithm; redundant residual; division; on-the-fly conversion; result-digit selection; digital arithmetic; logic arrays; number theory.
Citation:
M.D. Ercegovac, T. Lang, "Radix-4 Square Rot Without Initial PLA," IEEE Transactions on Computers, vol. 39, no. 8, pp. 1016-1024, Aug. 1990, doi:10.1109/12.57040
Usage of this product signifies your acceptance of the Terms of Use.