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...

Full description

Saved in:
Bibliographic Details
Published inInternational Symposium onInformation Theory, 2004. ISIT 2004. Proceedings p. 547
Main Authors Ruan, X., Katti, R.S.
Format Conference Proceeding
LanguageEnglish
Published Piscataway NJ IEEE 2004
Subjects
Online AccessGet full text

Cover

Loading…