A new method for conversion of a 2's complement to canonic signed digit number system and its representation
A new technique is developed to generate canonic sign digit numbers. The technique is shown to be computationally simple and fast. In addition, a binary representation of CSD numbers, known as binary coded CSD (BCSD) number, is also presented. It is shown that a BCSD number uniquely represents its e...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | A new technique is developed to generate canonic sign digit numbers. The technique is shown to be computationally simple and fast. In addition, a binary representation of CSD numbers, known as binary coded CSD (BCSD) number, is also presented. It is shown that a BCSD number uniquely represents its equivalent 2's complement number in the same size data-word. This property allows conversion of the number onto itself with no extra space added. An algorithm is developed to directly convert a 2's complement number to its BCSD equivalent. |
---|---|
ISSN: | 1058-6393 2576-2303 |
DOI: | 10.1109/ACSSC.1996.599075 |