This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Signed Digit Representations of Minimal Hamming Weight
August 1993 (vol. 42 no. 8)
pp. 1007-1010

The authors give an online algorithm for computing a canonical signed digit representation of minimal Hamming weight for any integer n. Using combinatorial techniques, the probability distributions Pr(K/sub r/=h), where K/sub r/ is taken to be a random variable on the uniform probability space of k-digit integers is computed. Also, using a Markov chain analysis, it is shown that E(K/sub r/) approximately (r-1)k/(r+1) as k to infinity.

[1] E. F. Brickell, D. M. Gordon, K. S. McCurley, and D. B. Wilson, "Fast exponentiation with precomputations: Algorithms and lower bounds," pp. 1-24, 1992, preprint.
[2] W. E. Clark and J. J. Liang, "On arithmetic weight for a general radix representation of integers,"IEEE Trans. Inform. Theory, vol. 19, pp. 823-826, Nov. 1973.
[3] K. Hwang,Computer Arithmetic. New York: Wiley, 1979.
[4] D. E. Knuth,The Art of Computer Programming, Vol. 2, Seminumerical Algorithms. Reading, MA: Addison-Wesley, 1981.
[5] F. Morain and J. Olivos, "Speeding up the computations on an elliptic curve using addition-subtraction chains,"RAIRO Inform. Theory, vol. 24, pp. 531-543, 1990.
[6] B. Parhami, "Generalized signed-digit number systems: A unifying framework for redundant number representations,"IEEE Trans. Comput., vol. 39, pp. 89-98, 1990.
[7] G. W. Reitwiesner,Binary Arithmetic(Advances in Computers, vol. 1), F. L. Alt, Ed. New York: Academic, 1960, pp. 232-308.
[8] A. Rényi,Foundations of Probability. San Francisco, CA: Holden-Day, 1970.

Index Terms:
signed digit representations; minimal Hamming weight; online algorithm; combinatorial techniques; probability distributions; random variable; uniform probability space; k-digit integers; Markov chain analysis; digital arithmetic.
Citation:
S. Arno, F.S. Wheeler, "Signed Digit Representations of Minimal Hamming Weight," IEEE Transactions on Computers, vol. 42, no. 8, pp. 1007-1010, Aug. 1993, doi:10.1109/12.238495
Usage of this product signifies your acceptance of the Terms of Use.