A new method for conversion of a 2's complement to canonic signed digit number system and its representation

Abstract

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.