New efficient structure for a modular multiplier for RNS

IEEE Transactions on Computers

Volumn 49, Issue 2, 2000, Pages 170-174

  Hiasat, Ahmad A ^a,b  

^a PRINCESS SUMAYA UNIVERSITY FOR TECHNOLOGY   (Jordan)

^b IEEE   (Jordan)

Author keywords

[No Author keywords available]

Indexed keywords

MODULAR MULTIPLIERS;

ADDERS; DIGITAL ARITHMETIC; REAL TIME SYSTEMS; ROM; VLSI CIRCUITS;

MULTIPLYING CIRCUITS;

EID: 0033893444     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.833113     Document Type: Article

References (24)

1. N. Szabo and R. Tanaka, Residue Arithmetic and Its Applications to Computer Technology. New York: McGraw Hill, 1967.
2. Residue Number System Arithmetic: Modern Applications in Digital Signal Processing, M. Soderstrand, M.AW. Jenkins, G. Jullien, and F. Taylor, eds. New York: IEEE Press, 1986.
3. i Multiplier with RNS Arithmetic Application," Proc. IEEE, vol. 68, pp. 529-532, Apr. 1980.
4. G.A. Jullien, "Implementation of Multiplication, Modulo a Prime Number, with Applications to Theoretic Transforms," IEEE Trans Computers, vol. 29, no. 10, pp. 899-905, Oct. 1980.
5. D. Radhakrishnan and Y. Yuan, "Novel Approaches to the Design of VLSI RNS Multipliers," IEEE Trans. Circuits and Systems-II: Analog and Digital Signal Processing, vol. 39, pp. 52-57, Jan. 1992.
6. M. Dugdale, "Residue Multipliers Using Factored Decomposition," IEEE Trans. Circuits and Systems-II: Analog and Digital Signal Processing, vol. 41, pp. 623-627, Sept. 1994.
7. A.S. Ramnarayan, "Practical Realization of mod p, p Prime Multiplier," Electronics Letters, vol. 16, pp. 466-467, June 1980.
8. F.J. Taylor, "A VLSI Residue Arithmetic Multiplier," IEEE Trans. Computers, vol. 31, no. 6, pp. 540-546, June 1982.
9. n ± 1) Residue Multiplier," Electronics Letters, vol. 28, pp. 414-415, Jan. 1991.
10. M. Parker and M. Benaissa, "VLSI Structures for Bit-Serial Modular Multiplication Using Basis Conversion," IEE Proc. Computers and Digital Techniques, vol. 141, no. 6, Nov. 1994.
11. C.D. Walter, "Systolic Modular Multiplier," IEEE Trans. Computers, vol. 42, no. 3, pp. 376-378, Mar. 1993.
12. E. Di Claudio, F. Piazza, and G. Orlandi, "Fast Combinatorial RNS Processors for DSP Applications," IEEE Trans. Computers, vol. 44, no. 5, pp. 624-633, May 1995.
13. G. Alia and E. Martinelli, "A VLSI Modulo m Multiplier," IEEE Trans. Computers, vol. 40, no. 7, pp. 873-878, July 1991.
14. A. Hiasat, "Semi-Custom VLSI Design for RNS Multipliers Using Combinational Logic Approach," Proc. IEEE Int'l Conf. Eng. and Computer Systems '96, vol. 2, pp. 935-938, Oct. 1996.
15. K. Elleithy and M. Bayoumi, "A Systolic Architecture for Modulo Multiplication," IEEE Trans. Circuits and Systems-II: Analog and Digital Signal Processing, vol. 42, pp. 725-729, Nov. 1995.
16. A. Wrzyszcz, D. Milford, and E. Dagless, "A New Approach to Fixed-Coefficient Inner Product Computation over Finite Rings," IEEE Trans. Computers, vol. 45, no. 12, pp. 1,345-1,355, Dec. 1996.
17. J. Bajard, L. Didier, and P. Kornerup, "An RNS Montgomery Modular Multiplication Algorithm," IEEE Trans. Computers, vol. 47, no. 7, pp. 766-776, July 1998.
18. K. Elleithy and M. Bayoumi, "Fast and Flexible Architectures for RNS Arithmetic Decoding," IEEE Trans. Circuits and Systems-II: Analog and Digital Signal Processing, vol. 39, pp. 226-235, Apr. 1992.
19. K. Hwang, Computer Arithmetic: Principles, Architecture, and Design. New York: Wiley, 1979.
20. E.L. Braun, Digital Computer Design. New York: Academic, 1963.
21. C.S. Wallace, "A Suggestion for a Fast Multiplier," IEEE Trans. Electronic Computers, vol. 13, pp. 14-17, Feb. 1964.
22. N. Takagi, H. Yasuura, and S. Yajima, "High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree," IEEE Trans. Computers, vol. 34, no. 9, pp. 789-796, Sept. 1985.
23. B. Sinha and P. Srimani, "Fast Parallel Algorithms for Binary Multiplication and Their Implementation on Systolic Architectures," IEEE Trans. Computers, vol. 38, no. 3, pp. 424-431, Mar. 1989.
24. T. Herman, "Linear Algorithms That Are Efficiently Parallelized to Time O(log n)," Technical Report TR-85-17, Dept. of Computer Science, Univ. of Texas at Austin, Sept. 1985.