Maximally Redundant High-Radix Signed-Digit Adder: New Algorithm and Implementation

Redundant Number Systems have been widely used in fast arithmetic circuits design. Signed-Digit (SD) or generally High-Radix SD (HRSD) number system is one of the most important redundant number systems. HRSD additions are used in many arithmetic functions as basic operations. Hence, improving the additions characteristics will improve the performance of almost all arithmetic modules. Several HRSD adders have been introduced in literatures. In this paper a new maximally redundant HRSD adder is proposed. This adder is compared to some most efficient HRSD adders previously published. The proposed adder is fabricated using a standard TSMC 65nm CMOS technology at 1volt supply voltage. The adder consumes 2.5% less power than the best previous published HRSD design. These implementations are also synthesized with FPGA flow on Xilinx Virtex2. The experimental result shows 5% and 6% decreases in the area and delay, respectively.

[1]  Algirdas Avizienis,et al.  Signed-Digit Numbe Representations for Fast Parallel Arithmetic , 1961, IRE Trans. Electron. Comput..

[2]  Keivan Navi,et al.  A new high dynamic range moduli set with efficient reverse converter , 2008, Comput. Math. Appl..

[3]  Omid Kavehei,et al.  Low Power Modulo 2n+1 Adder Based on Carry Save Diminished-One Number System , 2008 .

[4]  G Jaberipour,et al.  High Radix Signed Digit Number Systems: Representation Paradigms , 2003 .

[5]  Mohammad S. Alam,et al.  Parallel computation of complex elementary functions using quaternary signed-digit arithmetic , 2000 .

[6]  Behrooz Parhami,et al.  Computer arithmetic - algorithms and hardware designs , 1999 .

[7]  K. Navi,et al.  A Novel DCVS Tree Reduction Algorithm , 2006, 2006 IEEE International Conference on IC Design and Technology.

[8]  M. K. Ibrahim,et al.  New high radix maximally-redundant signed digit adder , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

[9]  A. Avizeinis,et al.  Signed Digit Number Representations for Fast Parallel Arithmetic , 1961 .

[10]  Keivan Navi,et al.  Algorithms and multi-valued circuits for the multioperand addition in the binary stored-carry number system , 1993, Proceedings of IEEE 11th Symposium on Computer Arithmetic.

[11]  Omid Kavehei,et al.  Low-Power and High-Performance 1-Bit CMOS Full-Adder Cell , 2008, J. Comput..

[12]  Keivan Navi,et al.  Arithmetic Circuits of Redundant SUT-RNS , 2009, IEEE Transactions on Instrumentation and Measurement.

[13]  Michael J. Flynn,et al.  The case for a redundant format in floating point arithmetic , 2003, Proceedings 2003 16th IEEE Symposium on Computer Arithmetic.

[14]  Pinaki Mazumder,et al.  Redundant arithmetic, algorithms and implementations , 2000, Integr..

[15]  Abdallah K. Cherri,et al.  High-radix signed-digit arithmetic using symbolic substitution computations , 1996 .

[16]  Mohammad S. Alam,et al.  Trinary signed-digit arithmetic using an efficient encoding scheme , 2000 .

[17]  Behrooz Pamami,et al.  Generalized Signed-Digit Number Systems : A Unifying Framework for Redundant Number Representations , 1990 .

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