The Community for Technology Leaders
Green Image
Issue No. 08 - August (1993 vol. 42)
ISSN: 0018-9340
pp: 1007-1010
<p> 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.</p>
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.

S. Arno and F. Wheeler, "Signed Digit Representations of Minimal Hamming Weight," in IEEE Transactions on Computers, vol. 42, no. , pp. 1007-1010, 1993.
89 ms
(Ver 3.3 (11022016))