• Publication
  • 1994
  • Issue No. 8 - August
  • Abstract - Hybrid Signed-Digit Number Systems: A Unified Framework for Redundant Number Representations with Bounded Carry Propagation Chains
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Hybrid Signed-Digit Number Systems: A Unified Framework for Redundant Number Representations with Bounded Carry Propagation Chains
August 1994 (vol. 43 no. 8)
pp. 880-891

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] A. Avizienis, "Signed digit number representations for fast parallel arithmetic,"IRE Trans. Electron. Comput., vol. EC-10, pp. 389-400, Sept. 1961.
[2] M. D. Ercegovac and T. Lang, "Fast multiplication without carry-propagate addition,"IEEE Trans. Comput., vol. 39, pp. 1385-1390, Nov. 1990.
[3] M. D. Ercegovac and T. Lang, "Redundant and on-line CORDIC: Application to matrix triangularization and SVD,"IEEE Trans. Comput., vol. 39, pp. 725-740, June 1990.
[4] M. J. Irwin and R. M. Owens, "Digit pipelined arithmetic as illustrated by the paste-up system,"IEEE Comput. Mag., pp. 61-73, Apr. 1987.
[5] S. Kuninobu, T. Nishiyama, H. Edamatsu, T. Taniguchi, and N. Takagi, "Design of high speed MOS multiplier and divider using redundant binary representation," inProc. 8th Symp. Comput. Arithmetic, pp. 80-86, 1987.
[6] H. Makino, Y, Nakase, and H. Shinohara, "A 8.8-ns 54×54- bit multiplier using new redundant binary architecture," inProc. Int. Conf. Comput. Design (ICCD), Cambridge, MA, Oct. 1993, pp. 202-205.
[7] H. R. Srinivas and K. K. Parhi, "A fast VLSI adder architecture,"IEEE J. Solid-State Circuits, vol. 27, May 1992.
[8] N. Takagi, H. Yasuura, and S. Yajima, "High-speed VLSI multiplication algorithm with a redundant binary addition tree,"IEEE Trans. Comput., vol. C-34, no. 9, pp. 789-796, Sept. 1985.
[9] D. S. Phatak, I. Koren and H. Choi, "Hybrid number representations with bounded carry propagation chains," inProc. ICCD, Cambridge, Massachusetts, Oct. 1993, pp. 272-275.
[10] B. Parhami, "Generalized signed-digit number systems: a unifying framework for redundant number representations,"IEEE Trans. Comput., vol. 39, pp. 89-98, Jan. 1990.
[11] I. Koren,Computer Arithmetic Algorithms. Englewood Cliffs, NJ: Prentice-Hall, 1993.
[12] S. M. Yen, C. S. Laih, C. H. Chen, and J. Y. Lee, "An efficient redundant-binary number to binary number converter,"IEEE J. Solid State Circuits, vol. SC-27, pp. 109-112, Jan. 1992.
[13] B. Parhami, Personal Communication.
[14] D. S. Phatak and I. Koren., "Hybrid Signed-Digit number systems: A unified framework for redundant number representations with bounded carry propagation chains," Tech. Rep. TR-93-CSE-2, Elec. and Comput. Eng. Dep., Univ. of Massachusetts, Amherst, Jan. 1993.
[15] N. Weste and K. Eshraghian,Principles of CMOS Design: A Systems Perspective. Reading, MA: Addison-Wesley, 1985, pp. 322-325.
[16] M. Mehta, V. Parmar, and E. Swartzlander, "High-speed multiplier design using multi-input counters and compressor circuits," inProc. Int. Symp. Comput. Arithmetic, 1991, pp. 43-50.

Index Terms:
adders; digital arithmetic; multiplying circuits; carry logic; logic design; hybrid signed-digit number systems; redundant number representations; bounded carry propagation chains; 2s complement representation; signed-digit representation; carry propagation chains; performance analysis; CMOS; execution time; parallel multipliers; adder trees; bounded carry propagation; carry-free addition.
Citation:
D.S. Phatak, I. Koren, "Hybrid Signed-Digit Number Systems: A Unified Framework for Redundant Number Representations with Bounded Carry Propagation Chains," IEEE Transactions on Computers, vol. 43, no. 8, pp. 880-891, Aug. 1994, doi:10.1109/12.295850
Usage of this product signifies your acceptance of the Terms of Use.