New Efficient Structure for a Modular Multiplier for RNS

Modular multiplication is a very important arithmetic operation in residue-based real-time computing systems. In realizing these multipliers, ROM-based structures are more efficient for small moduli. Due to the exponential growth of ROM sizes, implementations with arithmetic components are more suitable for medium and large moduli. This paper presents a new modular multiplier that can deal efficiently with medium and large size moduli. The design of this modular multiplier that multiplies two n bit residue digits consists, basically, of a (n/spl times/n) binary multiplier, a ((n-1-k)/spl times/k) binary multiplier (k<n), three n-bit adders, and a small-size combinational circuit. When compared with the most competitive published work, the new multiplier reduces, significantly, both time delay and hardware requirements. The design is very suitable for VLSI realization.

[1]  D. Radhakrishnan,et al.  Novel approaches to the design of VLSI RNS multipliers , 1992 .

[2]  Richard I. Tanaka,et al.  Residue arithmetic and its applications to computer technology , 1967 .

[3]  A. S. Ramnarayan.  Practical realisation of mod p, p prime multiplier , 1980 .

[4]  Graham A. Jullien,et al.  Implementation of Multiplication, Modulo a Prime Number, with Applications to Number Theoretic Transforms , 1980, IEEE Transactions on Computers.

[5]  Ted Herman.  Linear Algorithms That Are Efficiently Parallelized to Time O(logn) , 1985 .

[6]  Francesco Piazza,et al.  Fast Combinatorial RNS Processors for DSP Applications , 1995, IEEE Trans. Computers.

[7]  A. A. Hiasat,et al.  Semi-custom VLSI design for RNS multipliers using combinational logic approach , 1996, Proceedings of Third International Conference on Electronics, Circuits, and Systems.

[8]  Giuseppe Alia,et al.  A VLSI Modulo m Multiplier , 1991, IEEE Trans. Computers.

[9]  M. Dugdale,et al.  Residue multipliers using factored decomposition , 1994 .

[10]  Pradip K. Srimani,et al.  Fast Parallel Algorithms for Binary Multiplication and Their Implementation on Systolic Architectures , 1989, IEEE Trans. Computers.

[11]  Khaled Elleithy,et al.  A systolic architecture for modulo multiplication , 1995 .

[12]  Fred J. Taylor,et al.  A VLSI Residue Arithmetic Multiplier , 1982, IEEE Transactions on Computers.

[13]  Raymond M. Kline,et al.  Digital computer design , 1977 .

[14]  Hiroto Yasuura,et al.  High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree , 1985, IEEE Transactions on Computers.

[15]  Christopher S. Wallace,et al.  A Suggestion for a Fast Multiplier , 1964, IEEE Trans. Electron. Comput..

[16]  A. Hiasat,et al.  New memoryless, mod (2n±1) residue multiplier , 1992 .

[17]  C. D. Walter,et al.  Systolic Modular Multiplication , 1993, IEEE Trans. Computers.

[18]  Matthew G. Parker,et al.  VLSI structures for bit-serial modular multiplication using basis conversion , 1994 .

[19]  Jean-Claude Bajard,et al.  An RNS Montgomery Modular Multiplication Algorithm , 1998, IEEE Trans. Computers.

[20]  K. Elleithy,et al.  Fast and flexible architectures for RNS arithmetic decoding , 1992 .

[21]  M. A. Soderstrand,et al.  A high-speed low-cost modulo P i multiplier with RNS arithmetic applications , 1980 .

[22]  Erik L. Dagless,et al.  A New Approach to Fixed-Coefficient Inner Product Computation Over Finite Rings , 1996, IEEE Trans. Computers.

[23]  Kai Hwang,et al.  Computer arithmetic: Principles, architecture, and design , 1979 .