论文信息 - Reverse converters for the moduli sets {2/sup 2N/-1, 2/sup N/, 2/sup 2N/+1} and {2/sup N/-3, 2/sup N/+1, 2/sup N/-1, 2/sup N/+3}

Reverse converters for the moduli sets {2/sup 2N/-1, 2/sup N/, 2/sup 2N/+1} and {2/sup N/-3, 2/sup N/+1, 2/sup N/-1, 2/sup N/+3}

Some observations are made on the choice of a recently proposed moduli set. Further, an alternative moduli set {2/sup 2N/-1, 2/sup N/, 2/sup 2N/+1} is suggested which has been shown to reduce the reverse conversion time and area requirements, without in any way affecting the speed of computation of other modulo operations needed in a RNS based Processor. A reverse converter for another recently described moduli set {2/sup N/-3, 2/sup N/+1, 2/sup N/-1, 2/sup N/+3} which does not need ROMs also has been described.

P.V. Anandha Mohan

[1] Colin D. Walter. Space/Time Trade-Offs for Higher Radix Modular Multiplication Using Repeated Addition , 1997, IEEE Trans. Computers.

[2] S. Meehan,et al. A universal input and output RNS converter , 1989, IEEE Military Communications Conference, 'Bridging the Gap. Interoperability, Survivability, Security'.

[3] Tolga Acar,et al. Analyzing and comparing Montgomery multiplication algorithms , 1996, IEEE Micro.

[4] G. Jullien,et al. An improved residue-to-binary converter , 2000 .

[5] S. Piestrak. A high-speed realization of a residue to binary number system converter , 1995 .

[6] P. L. Montgomery. Modular multiplication without trial division , 1985 .

[7] Ming-Hwa Sheu,et al. An efficient VLSI design for a residue to binary converter for general balance moduli (2n-3, 2n+1, 2n-1, 2n+3) , 2004, IEEE Trans. Circuits Syst. II Express Briefs.