
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
S. Arno, F.S. Wheeler, "Signed Digit Representations of Minimal Hamming Weight," IEEE Transactions on Computers, vol. 42, no. 8, pp. 10071010, August, 1993.  
BibTex  x  
@article{ 10.1109/12.238495, author = {S. Arno and F.S. Wheeler}, title = {Signed Digit Representations of Minimal Hamming Weight}, journal ={IEEE Transactions on Computers}, volume = {42}, number = {8}, issn = {00189340}, year = {1993}, pages = {10071010}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.238495}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Signed Digit Representations of Minimal Hamming Weight IS  8 SN  00189340 SP1007 EP1010 EPD  10071010 A1  S. Arno, A1  F.S. Wheeler, PY  1993 KW  signed digit representations; minimal Hamming weight; online algorithm; combinatorial techniques; probability distributions; random variable; uniform probability space; kdigit integers; Markov chain analysis; digital arithmetic. VL  42 JA  IEEE Transactions on Computers ER   
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 kdigit integers is computed. Also, using a Markov chain analysis, it is shown that E(K/sub r/) approximately (r1)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. 124, 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. 823826, 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: AddisonWesley, 1981.
[5] F. Morain and J. Olivos, "Speeding up the computations on an elliptic curve using additionsubtraction chains,"RAIRO Inform. Theory, vol. 24, pp. 531543, 1990.
[6] B. Parhami, "Generalized signeddigit number systems: A unifying framework for redundant number representations,"IEEE Trans. Comput., vol. 39, pp. 8998, 1990.
[7] G. W. Reitwiesner,Binary Arithmetic(Advances in Computers, vol. 1), F. L. Alt, Ed. New York: Academic, 1960, pp. 232308.
[8] A. Rényi,Foundations of Probability. San Francisco, CA: HoldenDay, 1970.