Practical Cellular Dividers

IEEE Transactions on Computers

Volumn 39, Issue 5, 1990, Pages 605-614

  Preparata, Franco P ^a,b   Vuillemin, Jean E ^c,d  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b ECOLE NORMALE SUPÉRIEURE   (France)

^c HEWLETT PACKARD COMPANY   (United States)

^d INRIA ROCQUENCOURT   (France)

Author keywords

Computer arithmetic; division; greatest common divisor; multiplication; on line algorithms; systolic networks

Indexed keywords

COMPUTER SYSTEMS, DIGITAL--PARALLEL PROCESSING; MATHEMATICAL TECHNIQUES--DIGITAL ARITHMETIC;

MODULAR ARITHMETIC; PARALLEL DIVISION ALGORITHMS;

COMPUTERS, DIGITAL;

EID: 0025432115     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.53574     Document Type: Article

References (17)

1. D. E. Knuth, The Art of Computer Programming, Vol. 2: Seminumerical Algorithms. Reading, MA: Addison-Wesley, 1981.
2. K. Hwang, Computer Arithmetic. New York: Wiley, 1979.
3. K. Mehlhorn, “AT2-optimal VLSI integer division and integer square routing,” Integration, vol. 2, pp. 163–167, 1984.
4. P. W. Beame, S. A. Cook, and H. J. Hoover, “Log depth circuit for division and related problems,” in Proc. 25th FOCS Symp., 1984, pp. 1–6.
5. K. Mehlhorn and F. P. Preparata, “Area-time optimal division for T = Ω((logn)1+ε),” Inform. Computat., vol. 72, no. 3, pp. 270–282, 1987.
6. J. E. Robertson, “A new class of digital methods,” IEEE Trans. Comput., vol. C-7, pp. 218–222, Sept. 1958.
7. C. N. Purdy and G. B. Purdy, “Integer division in linear time with bounded fan-in,” IEEE Trans. Comput., vol. C-36, no. 5, pp. 640–644, 1987.
8. K. S. Trivedi and M. D. Ercegovac, “On-line algorithms for division and multiplication,” IEEE Trans. Comput., vol. 26, no. 7, pp. 681–687, July 1977.
9. N. Takagi, H. Yasuura, and S. Yajima, “A VLSI-oriented high-speed divider using redundant binary representations,” Trans. IECE Japan, J67D, no. 4, pp. 450–457, Apr. 1984.
10. A. J. Atrubin, “An iterative one-dimensional real-time multiplier,” IEEE Trans. Comput., vol. C-14, no. 3, pp. 394–399, 1965.
11. D. E. Muller, “Asynchronous logic and applications to information processing,” Switching Theory and Space Technology, Hiken and Marin, Eds. Stanford, CA: Stanford University Press, 1963.
12. H. T. Kung, “Why systolic architectures?,” IEEE Comput. Mag., vol. 15, pp. 37–46, Feb. 1982.
13. R. L. Rivest, A. Shamir, and L. Adleman, “Public key cryptography,” Commun. ACM, vol. 21, pp. 120–126, 1979.
14. R. P. Brent and H. T. Kung, “A systolic algorithm for integer GCD computation,” in Proc. VLSI '83, F. Anceau and E. J. Aas, Eds. North-Holland, 1983, pp. 145–154.
15. —, “A regular layout for parallel adders,” IEEE Trans. Comput., vol. C–31, no. 3, pp. 260–264, Mar. 1982.
16. J. E. Vuillemin and L. Guibas, “A fast n-MOS implementation of addition,” in Proc. ICCC82 Conf. Circuits Comput., 1982, pp. 147–150.
17. C. A. Mead and L. A. Conway, Introduction to VLSI Systems. Reading, MA: Addison-Wesley, 1980.