This Article 
 Bibliographic References 
 Add to: 
Constant-Time Addition and Simultaneous Format Conversion Based on Redundant Binary Representations
November 2001 (vol. 50 no. 11)
pp. 1267-1278

Abstract—It is well-known that constant-time addition, in which the execution delay is independent of operand lengths, is feasible only if the output is expressed in a redundant representation. There are many ways of introducing redundancy and the specifics of the redundant format employed can have a major impact on the performance of constant-time addition and digit set conversion. This paper presents a comprehensive analysis of constant-time addition and simultaneous format conversion. We consider full as well as partially redundant representations, where not all digit positions are redundant. The number of redundant digits and their positions can be arbitrary, yielding many possible redundant representations. Format conversion refers to changing the number and/or position of redundant digits in a representation. It is shown that such a format conversion is feasible during (i.e., simultaneous with) constant time addition, even if all three operands (the two inputs and single output) are represented in distinct redundant formats. We exploit “equal-weight grouping” (EWG), wherein bits having the same weight are grouped together to achieve the constant-time addition and possible simultaneous format conversion. The analysis and data show that EWG leads to efficient implementations. We compare VLSI implementations of various constant-time addition cells and demonstrate that the conventional 4:2 compressor is the most efficient way to execute constant time-addition. We show interesting connections to prior results and indicate possible directions for further extensions.

[1] T.M. Carter and J.E. Robertson, “The Set Theory of Arithmetic Decomposition,” IEEE Trans. Computers, vol. 39, no. 8, pp. 993-1005, Aug. 1990.
[2] P. Kornerup, “Necessary and Sufficient Conditions for Parallel and Constant Time Conversion and Addition,” Proc. 14th IEEE Symp. Computer Arithmetic, pp. 152-156, Apr. 1999.
[3] P. Kornerup, “Digit-Set Conversions: Generalizations and Applications,” IEEE Trans. Computers, vol. 43, pp. 622-629, 1994.
[4] A.M. Nielsen and P. Kornerup, “Redundant Radix Representation of Rings,” IEEE Trans. Computers, vol. 48, no. 11, pp. 1153-1165, Nov. 1999.
[5] M.D. Ercegovac and T. Lang, “On Recoding in Arithmetic Algorithms,” J. VLSI Signal Processing, vol. 14, pp. 283-294, 1996.
[6] A. Avizienis, “Signed-Digit Number Representations for Fast Parallel Arithmetic,” IRE Trans. Electronic Computers, vol. 10, pp. 389-400, Sept. 1961.
[7] D.S. Phatak and I. Koren, "Hybrid Signed-Digit Number Systems: A Unified Framework for Redundant Number Representations with Bounded Carry Propagation Chains," IEEE Trans. Computers, special issue on computer arithmetic, vol. 43, no. 8, pp. 880-891, Aug. 1994. (An unabridged version is available on the web at.)
[8] T. Goff, D.S. Phatak, and I. Koren, “Redundancy Management in Arithmetic Processing via Redundant Binary Representations,” Proc. ASILOMAR '99 (Ann. Conf. Signals Systems and Computers), pp. 1475-1479, Oct. 1999.
[9] B. Parhami, "Generalized Signed-Digit Number Systems: A Unifying Framework for Redundant Number Representations," IEEE Trans. Computers, vol. 39, no. 1, pp. 89-98, Jan. 1990.
[10] C. Nagendra, R.M. Owens, and M.J. Irwin, “Unifying Carry-Sum and Signed-Digit Number Representations,” Technical Report CSE-96-036, Computer Science and Eng. Dept., Pennsylvania State Univ., 1996.
[11] I. Koren, Computer Arithmetic Algorithms. Amherst, Mass.: Brookside Court Publishers, 1998.
[12] B. Parhami, Computer Arithmetic—Algorithms and Hardware Designs. New York: Oxford Univ. Press, 2000.
[13] R.T. Borovec, “The Logical Design of a Class of Limited Carry-Borrow Propagation Adders,” Technical Report 275, Computer Science Dept., Univ. of Illinois, Champaign-Urbana, 1968.
[14] C.Y. Chow and J.E. Robertson, “Logical Design of a Redundant Binary Adder,” Proc. Fourth IEEE Symp. Computer Arithmetic, pp. 109-115, 1978.
[15] N. Takagi,H. Yasuura,, and S. Yajima,“High-speed VLSI multiplication algorithm with a redundant binary addition tree,” IEEE Trans. Computers, vol. 34, no. 9, pp. 789-796, Sept. 1985.
[16] S. Kuninobu, T. Nishiyama, H. Edamatsu, T. Taniguchi, and N. Takagi, “Design of High Speed MOS Multiplier and Divider Using Redundant Binary Representation,” Proc. Eighth Symp. Computer Arithmetic, pp. 80-86, 1987.
[17] M.D. Ercegovac and T. Lang, “Effective Coding for Fast Redundant Adders using the Radix-2 Digit Set {0, 1, 2, 3},” Proc. 31st Asilomar Conf. Signals Systems and Computers, pp. 1163-1167, 1997.
[18] T. Goff, D.S. Phatak, and I. Koren, “Efficient Arithmetic Implementations Based on Carry-Save Representations,” Proc. SPIE 45th Ann. Meeting, Int'l Symp. Optical Science and Technology, Aug. 2000.
[19] D.S. Phatak, T. Goff, and I. Koren, “On Constant Time Addition and Simultaneous Format Conversion,” Technical Report TR-01-CSEE-2, Computer Science and Electrical Eng. Dept., Univ. of Maryland Baltimore County (UMBC), Feb. 2001.
[20] J.J.J. Lue and D.S. Phatak, “Area$\times$Delay ($A \cdot T$) Efficient Multiplier Based on an Intermediate Hybrid Signed-Digit (HSD-1) Representation,” Proc. 14th IEEE Int'l Symp. Computer Arithmetic, pp. 216-224, Apr. 1999.
[21] N. Ohkubo et al., “A 4.4-ns CMOS 54$\times$54-b Multiplier Using Pass-Transistor Multiplexor,” IEEE J. Solid-State Circuits, vol. 30, pp. 251-256, Mar. 1995.
[22] T. Akoi, Y. Sawada, and T. Higuchi, “Signed Weight Arithmetic and Its Application to Field Programmable Digital Filter Architecture,” IEICE Trans. Electronics, vol. E82-C, pp. 1687-1698, Sept. 1997.

Index Terms:
Redundant representations, constant-time addition, simultaneous format conversion, redundant adders, carry-save addition, signed-digit addition, 4:2 compressor.
Dhananjay S. Phatak, Tom Goff, Israel Koren, "Constant-Time Addition and Simultaneous Format Conversion Based on Redundant Binary Representations," IEEE Transactions on Computers, vol. 50, no. 11, pp. 1267-1278, Nov. 2001, doi:10.1109/12.966499
Usage of this product signifies your acceptance of the Terms of Use.