VLSI implementation of new arithmetic residue to binary decoders

This paper introduces two arithmetic decoders that decode the residue number system into its binary equivalent. The first one deals with the moduli set: (2/sup n/,2/sup n/-1,2/sup n/+1,2/sup n/-2/sup (n+1/2)/+1,2/sup n/+2/sup (n+1/2)/+1), while the other deals with the moduli set: (2/sup n+1/,2/sup n/-1,2/sup n/+1,2/sup n/-2/sup (n+1/2)/+1,2/sup n/+2/sup (n+1/2)/+1), where n is odd. Compact forms for the multiplicative inverse of each modulus is introduced, which facilitates the implementation of these arithmetic decoders. The proposed hardware realizations for these decoders are based on using six carry save adders and one carry propagate adder. The hardware and time requirements of these decoders are much better than other similar decoders found in literature. A sub-micron silicon implementation for the decoder has been performed and reported.

[1]  A. Hiasat.  Efficient residue to binary converter , 2003 .

[2]  Chip-Hong Chang,et al.  An efficient reverse converter for the 4-moduli set {2/sup n/ - 1, 2/sup n/, 2/sup n/ + 1, 2/sup 2n/ + 1} based on the new Chinese remainder theorem , 2003 .

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

[4]  A. Hiasat,et al.  Residue-to-binary arithmetic converter for the moduli set (2/sup k/, 2/sup k/-1, 2/sup k-1/-1) , 1998 .

[5]  M.N.S. Swamy,et al.  A Note on "A High-Speed Residue-to-Binary Converter for Three-Moduli RNS and a Scheme for Its VLSI Implementation" , 2000 .

[6]  Thu V. Vu.  Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding , 1985, IEEE Trans. Computers.

[7]  Ahmad A. Hiasat,et al.  New Efficient Structure for a Modular Multiplier for RNS , 2000, IEEE Trans. Computers.

[8]  Alexander Skavantzos,et al.  An efficient residue to weighted converter for a new residue number system , 1998, Proceedings of the 8th Great Lakes Symposium on VLSI (Cat. No.98TB100222).

[9]  Robert W. Brodersen.  Anatomy of a Silicon Compiler , 1992 .

[10]  Yuke Wang.  Residue-to-binary converters based on new Chinese remainder theorems , 2000 .

[11]  F. Pourbigharaz,et al.  A Signed-Digit Architecture for Residue to Binary Transformation , 1997, IEEE Trans. Computers.

[12]  Jimson Mathew,et al.  Residue-to-Binary Arithmetic Converter for the Moduli Set { 2 n-1 , 2 n , 2 n + 1 , 2 n + 1 + 1 , 2 n + 2-1 } , 1999 .

[13]  Richard Conway,et al.  Fast Converter for 3 Moduli RNS Using New Property of CRT , 1999, IEEE Trans. Computers.

[14]  Haridimos T. Vergos,et al.  High-Speed Parallel-Prefix Modulo 2n-1 Adders , 2000, IEEE Trans. Computers.

[15]  Wei Wang,et al.  A note on "A high-speed residue-to-binary converter for three-moduli (2/sup k/ 2/sup k/ - 1, 2/sup k-1/ - 1) RNS and a scheme for its VLSI implementation" , 2000 .

[16]  Mark Horowitz,et al.  IRSIM: An Incremental MOS Switch-Level Simulator , 1989, 26th ACM/IEEE Design Automation Conference.