Modulo 2n+1 addition and multiplication for redundant operands

Complex arithmetic operations are widely used in Digital Signal Processing (DSP) applications. Keeping the intermediate results in a redundant representation (e.g. carry-save) is a common technique to speed up chained arithmetic operations due to the elimination of the intermediate parallel additions which occupy significant area and largely increase the overall critical delay. Thus, arithmetic units with operands in a redundant representation are of considerable practical interest. In this work, we propose an efficient modulo 2n+1 addition unit with one or both operands in the redundant carry-save representation and, also, we introduce an efficient modulo 2n+1 multiplier with the one of two operands in the redundant carry-save form.

[1]  C. Efstathiou,et al.  On the modulo 2n+1 multiplication for diminished-1 operands , 2008, 2008 2nd International Conference on Signals, Circuits and Systems.

[2]  Laurent Imbert,et al.  a full RNS implementation of RSA , 2004, IEEE Transactions on Computers.

[3]  L. Leibowitz.  A simplified binary arithmetic for the Fermat number transform , 1976 .

[4]  A. Omondi,et al.  Residue Number Systems: Theory and Implementation , 2007 .

[5]  Haridimos T. Vergos,et al.  Efficient modulo 2n+1 adder architectures , 2009, Integr..

[6]  Reto Zimmermann,et al.  Optimized synthesis of sum-of-products , 2003, The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003.

[7]  Giorgos Dimitrakopoulos,et al.  On Modulo 2^n+1 Adder Design , 2012, IEEE Transactions on Computers.

[8]  A. Nannarelli,et al.  Implementation of digital filters in carry-save residue number system , 2001, Conference Record of Thirty-Fifth Asilomar Conference on Signals, Systems and Computers (Cat.No.01CH37256).

[9]  Hong Wang,et al.  Redundant Arithmetic Optimizations (Research Note) , 2000, Euro-Par.

[10]  Aviral Shrivastava,et al.  Exploiting residue number system for power-efficient digital signal processing in embedded processors , 2009, CASES '09.

[11]  P. V. Mohan,et al.  Residue Number Systems: Algorithms and Architectures , 2011 .

[12]  Haridimos T. Vergos,et al.  A Unifying Approach for Weighted and Diminished-1 Modulo $2^n+1$ Addition , 2008, IEEE Transactions on Circuits and Systems II: Express Briefs.

[13]  Haridimos T. Vergos,et al.  Design of efficient modulo 2n+1 multipliers , 2007, IET Comput. Digit. Tech..

[14]  Giuseppe Alia,et al.  Optimal VLSI complexity design for high speed pipeline FFT using RNS , 1998 .

[15]  Yong Liu,et al.  Moduli Set Selection and Cost Estimation for RNS-Based FIR Filter and Filter Bank Design , 2004, Des. Autom. Embed. Syst..

[16]  Haridimos T. Vergos,et al.  Fast parallel-prefix modulo 2/sup n/+1 adders , 2004, IEEE Transactions on Computers.

[17]  Vassilis Paliouras,et al.  Residue Arithmetic for Variation-Tolerant Design of Multiply-Add Units , 2009, PATMOS.

[18]  T. Stouraitis,et al.  A new approach to elliptic curve cryptography: an RNS architecture , 2006, MELECON 2006 - 2006 IEEE Mediterranean Electrotechnical Conference.

[19]  Zhi-Jian Mou.  A study of VLSI symmetric FIR filter structures , 1992, J. VLSI Signal Process..

[20]  A. Lloris,et al.  Fast RNS-based 2D-DCT computation on field-programmable devices , 2000, 2000 IEEE Workshop on SiGNAL PROCESSING SYSTEMS. SiPS 2000. Design and Implementation (Cat. No.00TH8528).

[21]  Jian Wen Chen,et al.  Efficient modulo 2n + 1 multipliers for diminished-1 representation , 2010, IET Circuits Devices Syst..

[22]  Ricardo Chaves,et al.  Improving residue number system multiplication with more balanced moduli sets and enhanced modular arithmetic structures , 2007, IET Comput. Digit. Tech..

[23]  Kiamal Z. Pekmestzi,et al.  On the Design of Modulo 2^n+1 Multipliers , 2011, 2011 14th Euromicro Conference on Digital System Design.

[24]  Antonio García,et al.  U. Meyer-Baese, A. Lloris: Fast RNS FPL-based Communications Receiver Design and Implementation , 2002, FPL.

[25]  Kiamal Z. Pekmestzi,et al.  On the design of modulo 2n±1 residue generators , 2013, 2013 IFIP/IEEE 21st International Conference on Very Large Scale Integration (VLSI-SoC).

[26]  A. Lloris,et al.  RNS-based implementation of 8 /spl times/ 8 point 2D-DCT over field-programmable devices [image compression] , 2003 .

[27]  Haridimos T. Vergos,et al.  Diminished-One Modulo 2n+1 Adder Design , 2002, IEEE Trans. Computers.

[28]  Reto Zimmermann,et al.  Efficient VLSI implementation of modulo (2/sup n//spl plusmn/1) addition and multiplication , 1999, Proceedings 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336).

[29]  Gian Carlo Cardarilli,et al.  Low-power adaptive filter based on RNS components , 2007, 2007 IEEE International Symposium on Circuits and Systems.

[30]  Ricardo Chaves,et al.  RDSP: a RISC DSP based on residue number system , 2003, Euromicro Symposium on Digital System Design, 2003. Proceedings..

[31]  L. Sousa,et al.  A universal architecture for designing efficient modulo 2/sup n/+1 multipliers , 2005, IEEE Transactions on Circuits and Systems I: Regular Papers.