A VLSI implementation of residue adders

The efficient hardware implementation of residue number system (RNS) architectures has evolved based on the development of integrated circuit technology. The implementation of RNS adders is discussed in this paper. Three approaches (the binary adder, the look-up table, and the hybrid implementation) are analyzed in the scope of VLSI criteria where the performance measures are area and time. Two layout design procedures have been used. They are flexible and support any type of moduli. The implementation complexity depends on the form and size of the modulus, but, in general, the look-up table approach is preferable in both area and time for moduli up to five bits, while the binary adder and the hybrid approaches offer better performance for larger moduli.

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

[2]  W.K. Jenkins.  A highly efficient residue-combinatorial architecture for digital filters , 1978, Proceedings of the IEEE.

[3]  W. Kenneth Jenkins,et al.  The use of residue number systems in the design of finite impulse response digital filters , 1977 .

[4]  Magdy A. Bayoumi,et al.  Models for VLSI implementation of residue number system arithmetic modules , 1983, 1983 IEEE 6th Symposium on Computer Arithmetic (ARITH).

[5]  W. Kenneth Jenkins,et al.  The Design of Error Checkers for Self-Checking Residue Number Arithmetic , 1983, IEEE Transactions on Computers.

[6]  Michael A. Soderstrand,et al.  Multipliers for residue-number-arithmetic digital filters , 1977 .

[7]  Magdy A. Bayoumi,et al.  An area-time efficient NMOS adder , 1983, Integr..

[8]  H. Rauch,et al.  Implementation of a fast digital processor using the residue number system , 1981 .

[9]  Graham A. Jullien,et al.  Residue Number Scaling and Other Operations Using ROM Arrays , 1978, IEEE Transactions on Computers.

[10]  Dilip K. Banerji.  A Novel Implementation Method for Addition and Subtraction in Residue Number Systems , 1974, IEEE Transactions on Computers.

[11]  Graham A. Jullien,et al.  Processor Architectures for Two-Dimensional Convolvers Using a Single Multiplexed Computational Element with Finite Field Arithmetic , 1983, IEEE Transactions on Computers.

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