Hybrid Signed-Digit Number Systems: A Unified Framework for Redundant Number Representations With Bounded Carry Propagation Chains

A novel hybrid number representation is proposed. It includes the two's complement representation and the signed-digit representation as special cases. The hybrid number representations proposed are capable of bounding the maximum length of carry propagation chains during addition to any desired value between 1 and the entire word length. The framework reveals a continuum of number representations between the two extremes of two's complement and signed-digit number systems and allows a unified performance analysis of the entire spectrum of implementations of adders, multipliers and alike. We present several static CMOS implementations of a two-operand adder which employ the proposed representations. We then derive quantitative estimates of area (in terms of the required number of transistors) and the maximum carry propagation delay for such an adder. The analysis clearly illustrates the trade-offs between area and execution time associated with each of the possible representations. We also discuss adder trees for parallel multipliers and show that the proposed representations lead to compact adder trees with fast execution times. In practice, the area available to a designer is often limited. In such cases, the designer can select the particular hybrid representation that yields the most suitable implementation (fastest, lowest power consumption, etc.) while satisfying the area constraint. Similarly, if the worst case delay is predetermined, the designer can select a hybrid representation that minimizes area or power under the delay constraint. >

[1]  D. Zuras,et al.  Balanced delay trees and combinatorial division in VLSI , 1986 .

[2]  Tomás Lang,et al.  Fast Multiplication Without Carry-Propagate Addition , 1990, IEEE Trans. Computers.

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

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

[5]  Keshab K. Parhi,et al.  A fast VLSI adder architecture , 1992 .

[6]  M. Mehta,et al.  High-speed multiplier design using multi-input counter and compressor circuits , 1991, [1991] Proceedings 10th IEEE Symposium on Computer Arithmetic.

[7]  Sung-Ming Yen,et al.  An efficient redundant-binary number to binary number converter , 1992 .

[8]  Neil Weste,et al.  Principles of CMOS VLSI Design , 1985 .

[9]  Mary Jane Irwin,et al.  Digit-Pipelined Arnthmetic as Illustrated by the Paste-Up System: A Tutorial , 1987, Computer.

[10]  Hiroto Yasuura,et al.  High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree , 1985, IEEE Transactions on Computers.

[11]  TakagiNaofumi,et al.  High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree , 1985 .

[12]  Tomás Lang,et al.  Redundant and On-Line CORDIC: Application to Matrix Triangularization and SVD , 1990, IEEE Trans. Computers.

[13]  Dhananjay S. Phatak,et al.  Hybrid number representations with bounded carry propagation chains , 1993, Proceedings of 1993 IEEE International Conference on Computer Design ICCD'93.

[14]  Behrooz Parhami,et al.  Generalized Signed-Digit Number Systems: A Unifying Framework for Redundant Number Representations , 1990, IEEE Trans. Computers.

[15]  Trevor York,et al.  Book Review: Principles of CMOS VLSI Design: A Systems Perspective , 1986 .

[16]  Israel Koren.  Computer arithmetic algorithms , 1993 .

[17]  N. Takagi,et al.  A high-speed multiplier using a redundant binary adder tree , 1987 .

[18]  Naofumi Takagi,et al.  Design of high speed MOS multiplier and divider using redundant binary representation , 1987, 1987 IEEE 8th Symposium on Computer Arithmetic (ARITH).

[19]  Hiroshi Makino,et al.  A 8.8-ns 54/spl times/54-bit multiplier using new redundant binary architecture , 1993, Proceedings of 1993 IEEE International Conference on Computer Design ICCD'93.