This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Generalized Signed-Digit Number Systems: A Unifying Framework for Redundant Number Representations
January 1990 (vol. 39 no. 1)
pp. 89-98

Signed-digit (SD) number representation systems have been defined for any radix r≤3 with digit values ranging over the set (- alpha , . . ., -1, 0, 1, . . ., alpha ), where alpha is an arbitrary integer in the range 1/2r> alpha >r. Such number representation systems possess sufficient redundancy to allow for the annihilation of carry or borrow chains and hence result in fast propagation-free addition and subtraction. The author refers to the above as ordinary SD number systems and defines generalized SD number systems which contain them as a special symmetric subclass. It is shown that the generalization not only provides a unified view of all redundant number systems which have proven useful in practice (including stored-carry and stored-borrowed systems), but also leads to new number systems not examined before. Examples of such new number systems are stored-carry-or-borrow systems, stored-double-carry systems, and certain redundant decimal representations.

[1] S. F. Andersonet al., "The IBM System/360 Model 91: Floating-point execution unit,"IBM J. Res. Develop., pp. 34-53, Jan. 1967.
[2] A. Avizienis, "Signed-digit number representation for fast parallel arithmetic,"IRE Trans. Comput., vol. EC-10, pp. 389-400, 1961.
[3] A. Avizienis, "On a flexible implementation of digital computer arithmetic," inInform. Processing '62. Amsterdam: North-Holland, 1963, pp. 664-670.
[4] A. Avizienis, "Binary-compatible signed-digit arithmetic," inAFIPS Conf. Proc. (1964 Fall Joint Comput. Conf.), pp. 663-672.
[5] A. Avizienis, "Arithmetic error codes: Cost and effectiveness studies for applications in digital system design,"IEEE Trans. Comput., vol. C- 20, no. 11, pp. 1322-1331, Nov. 1971.
[6] A. D. Booth, "A signed binary multiplication technique,"Quarterly J. Mech. Appl. Math., vol. 4, part 2, pp. 236-240, 1951.
[7] T. C. Chen, "Maximal redundancy signed-digit systems," inProc. Symp. Comput. Arithmetic, Urbana, IL, June 1985, IEEE Computer Society Press, pp. 296-300.
[8] C. Y. Chow and J. E. Robertson, "Logical design of a redundant binary adder," inProc. Symp. Comput. Arithmetic, Santa Monica, CA, Oct. 1978, pp. 109-115.
[9] L. J. Guibas and F. M. Liang, "Systolic stacks, queues, and counters," inProc. Conf. Advanced Res. VLSI, MIT, 1982, pp. 155-164.
[10] L. B. Jackson,Digital Filters and Signal Processing. Boston, MA: Kluwer, 1986.
[11] R. W. Hockney and C. R. Jesshope,Parallel Computers. Bristol, England: Adam Hilger, 1981.
[12] D. E. Knuth,The Art of Computer Programming, Vol. 2, Seminumerical Algorithms. Reading, MA: Addison-Wesley, 1981.
[13] S.-Y. Kung, R. E. Owen, and J. G. Nash, Eds.,VLSI Signal Processing II. New York: IEEE Press, 1986.
[14] O. L. MacSorley, "High-speed arithmetic in binary computers,"Proc. IRE, vol. 49, pp. 67-91, Jan. 1961.
[15] N. Metropolis and R. L. Ashenhurst, "Significant digit computer arithmetic,"IRE Trans. Electron. Comput., vol. EC-7, pp. 265- 267, 1958.
[16] G. Metze and J. E. Robertson, "Elimination of carry propagation in digital computers," inInform. Processing '59 (Proc. UNESCO Conf., June 1959), 1960, pp. 389-396.
[17] B. Parhami and A. Avizienis, "Detection of storage errors in mass memories using low-cost arithmetic error codes,"IEEE Trans. Comput., vol. C-27, no. 4, pp. 302-308, Apr. 1978.
[18] B. Parhami, "Systolic up/down counters with zero and sign detection," inProc. Symp. Comput. Arithmetic, Como, Italy, May 1987, pp. 174-178.
[19] B. Parhami, "A general theory of carry-free and limited-carry computer arithmetic," inProc. Canadian Conf. VLSI, Winnipeg, Canada, Oct. 1987, pp. 167-172.
[20] B. Parhami, "Carry-free addition of recoded binary signed-digit numbers,"IEEE Trans. Comput., pp. 1470-1476, Nov. 1988.
[21] B. Parhami, "On the practical implementation of arithmetic functions with generalized signed-digit number representation," submitted for publication.
[22] J. E. Robertson, "A new class of digital division methods,"IEEE Trans. Comput., vol. C-7, pp. 218-222, Sept. 1958.
[23] 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.
[24] K. D. Tocher, "Technique for multiplication and division for automatic binary computers,"Quarterly J. Mech. Appl. Math., vol. 11, part 3, pp. 364-384, 1958.
[25] C. S. Wallace, "A suggestion for a fast multiplier,"IEEE Trans. Electron. Comput., vol. EC-14, no. 1, pp. 14-17, Feb. 1964.
[26] V. Zakharov, "Parallelism and array processing,"IEEE Trans. Comput., vol. C-33, no. 1, pp. 45-78, Jan. 1984.

Index Terms:
generalised signed-digit number systems; unifying framework; redundant number representations; carry; borrow; fast propagation-free addition; subtraction; digital arithmetic.
Citation:
B. Parhami, "Generalized Signed-Digit Number Systems: A Unifying Framework for Redundant Number Representations," IEEE Transactions on Computers, vol. 39, no. 1, pp. 89-98, Jan. 1990, doi:10.1109/12.46283
Usage of this product signifies your acceptance of the Terms of Use.