Low-weight left-to-right binary signed-digit representation of N integers
An algorithm for computing the binary signed-digit representation of N integers is introduced. The algorithm operates from left to right (i.e., from the most significant bit to the least significant bit) and the resulting representation has minimum joint weight. Such an algorithm is useful in ellipt...
Saved in:
Published in | International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings p. 547 |
---|---|
Main Authors | , |
Format | Conference Proceeding |
Language | English |
Published |
Piscataway NJ
IEEE
2004
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!