Abstract
Real time digital signal processing demands high performance implementations of division and square root. This can only be achieved by the design of fast and efficient arithmetic algorithms which address practical VLSI architectural design issues. In this paper, new algorithms for division and square root are described. The new schemes are based on pre-scaling the operands and modifying the classical SRT method such that the result digits and the remainders are computed concurrently and the computations in adjacent rows are overlapped. Consequently, their performance exceeds that of the SRT methods. The hardware cost for higher radices is considerably more than that of the SRT methods but for many applications, this is not prohibitive. A system of equations is presented which enables both an analysis of the method for any radix and the parameters of implementations to be easily determined. This is illustrated for the case of radix 2 and radix 4. In addition, a highly regular array architecture combining the division and square root method is described.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.E. Robertson, “A new class of digital division methods,”IRE Trans. on Elect. Compt., vol. EC-7, 1958, pp. 218–222.
S.E. McQuillan and J.V. McCanny, “A Systematic Methodology for the Design of High Performance Recursive Digital Filters,” Submitted to theIEEE Transactions on Computers (Jan 1993).
M.D. Ercegovac and T. Lang, “On-line Arithmetic: A Design Methodology and Applications,”VLSI Signal Processing III, 1988, pp. 252–263.
M.D. Ercegovac and T. Lang, “Fast Radix-2 Division With Quotient-Digit Prediction,”Journal of VLSI Signal Processing, 1, 1989, pp. 169–180.
N. Burgess, “A Fast Division Algorithm for VLSI,”IEEE Intl. Conf. on Compt. Design, 1991, pp. 560–563.
D.E. Atkins, “Introduction to the Role of Redundancy in Computer Arithmetic,”IEEE Computer, 1975, pp. 74–77.
A. Avizienis, “Signed Digit Number Representations for Fast Parallel Arithmetic,”IRE Trans. on Compt, Vol. EC-10, 1961, pp. 389–400.
S. Kuninobu, T. Nishiyama, T. Taniguchi, and N. Takagi, “Design of High Speed MOS Multiplier and Divider using Redundant Binary Representation,”Proc. 8th Symp. on Compt. Arith., 1987, pp. 80–86.
S. Majerski, “Square Rooting Algorithms for High Speed Digital Circuits,”IEEE Trans. on Compt., Vol. C-34, 1985, pp. 724–733.
M. Lapointe, P. Fortier, and H.T. Huynh, “A very fast realization of a time-domain block LMS filter,”Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing, 1991, pp. 2101–2104.
K. Hwang,Computer Arithmetic: Principles and Design, J. Wiley and Sons, 1979.
IEEE Standard for Floating Point Arithmetic, IEEE Standard 754,IEEE Computer Society, 1985.
A. Svoboda, “An Algorithm for Division,”Information Processing Machines, No. 9, 1963, pp. 25–34.
C. Tung, “A Division Algorithm for Signed-Digit Arithmetic,”IEEE Trans. on Compts., Vol. C-17, 1968, pp. 887–889.
S.E. McQuillan and J.V. McCanny, “A VLSI Module for High Performance Multiplication, Division and Square Root”,IEE Proc. on Computers and Digital Techniques, Part E, Vol. 139, 1992, pp. 505–510.
M.D. Ercegovac and T. Lang, “On-the-fly conversion of redundant into conventional representations,”IEEE Trans. on Compt., Vol. C-36, 1987, pp. 895–897.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
McQuillan, S.E., McCanny, J.V. Fast VLSI algorithms for division and square root. Journal of VLSI Signal Processing 8, 151–168 (1994). https://doi.org/10.1007/BF02109382
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02109382