A VLSI Modulo m Multiplier

IEEE Transactions on Computers

Volumn 40, Issue 7, 1991, Pages 873-878

  Alia, Giuseppe ^a   Martinelli, Enrico ^b  

^a UNIVERSITY OF PISA   (Italy)

^b ISTI CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY - COMPUTATIONAL COMPLEXITY; INTEGRATED CIRCUITS, VLSI;

AREA-TIME COMPLEXITY; MODULO M MULTIPLIER; RESIDUE NUMBER SYSTEMS; VLSI COMPLEXITY;

COMPUTERS, DIGITAL;

EID: 0026188738     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.83626     Document Type: Article

References (21)

1. G. A. Jullien, “Residue number scaling and other operations using ROM arrays,” IEEE Trans. Comput., vol. C-27, pp. 325–336, Apr. 1978.
2. C. H. Huang, D. G. Peterson, H. E. Rauch, J. W. Teague, and D. F. Fraser, “Implementation of a fast digital processor using the residue number system,” IEEE Trans. Circuits Syst., vol. CAS-28, pp. 32–38, Jan. 1981.
3. M.A. Bayoumi, G. A. Jullien, and W. C. Miller, “A VLSI model for residue number system architecture,” INTEGRATION, VLSI J., vol. 2, pp. 191–221, 1984.
4. G. Alia, F. Barsi, and E. Martinelli, “A fast VLSI conversion between binary and residue systems,” Inform. Processing Lett., vol. 18, pp. 141–145, Mar. 1984.
5. G. Alia and E. Martinelli, “A VLSI algorithm for direct and reverse conversion from weighted binary number system to residue number system,” IEEE Trans. Circuits Syst., vol. CAS-31, pp. 1033–1039, Dec. 1984.
6. C. D. Thompson, “VLSI design with multiple active layers,” Inform. Processing Lett., vol. 21, pp. 109–111, Sept. 1985.
7. W. K. Jenkins and B. J. Leon, “The use of residue number systems in the design of finite impulse response digital filters,” IEEE Trans. Circuits Syst., vol. CAS-24, pp. 191–201, Apr. 1977.
8. M. A. Soderstrand, “A high-speed low cost recursive digital filter using residue number arithmetic,” Proc. IEEE, vol. 65, pp. 1065–1067, July 1977.
9. G. Alia, F. Barsi, and E. Martinelli, “A fast near optimum VLSI implementation of FFT using residue number systems,” INTEGRATION, VLSI J., vol. 2, pp. 133–147, 1984.
10. W. K. Jenkins, “Techniques for residue-to-analog conversion for residue-encoded digital filters,” IEEE Trans. Circuits Syst., vol. CAS-25, pp. 555–562, July 1978.
11. —, “A highly efficient residue-combinatorial architecture for digital filters,” Proc. IEEE, vol. 66, pp. 700–702, June 1978.
12. F. J. Taylor and C. H. Huang, “An autoscaler residue multiplier,” IEEE Trans. Comput., vol. C-31, pp. 321–325, Apr. 1982.
13. F. J. Taylor, “A VLSI residue arithmetic multiplier,” IEEE Trans. Comput., vol. C-31, pp. 540–546, June 1982.
14. —, “An overflow-free residue multiplier,” IEEE Trans. Comput., vol. C-32, pp. 501–504, May 1983.
15. N. S. Szabo and R. I. Tanaka, Residue Arithmetic and its Applications to Computer Technology. New York: McGraw-Hill, 1967.
16. C. D. Thompson, “A complexity theory for VLSI,” Ph.D. dissertation, Dep. Comput. Sci., Carnegie-Mellon Univ., Aug. 1980.
17. R. P. Brent and H.T. Kung, “The area-time complexity of binary multiplication,” J. ACM, vol. 28, pp. 521–534, July 1981.
18. J. E. Savage, “Area-time tradeoffs for matrix multiplication and related problems in VLSI models,” J. Comput. Syst. Sci., vol. 22, pp. 230–242, 1981.
19. C. A. Mead and L. A. Conway, Introduction to VLSI Systems. Reading, MA: Addison-Wesley, 1980.
20. K. Melhorn and F.P. Preparata, “Area-time optimal VLSI integer multiplier with minimum computation time,” Inform. Contr., vol. 58, pp. 137–156, 1983.
21. R. P. Brent and H. T. Kung, “A regular layout for parallel adders,” IEEE Trans. Comput., vol. C-31, pp. 260–264, Mar. 1982.