A novel fast canonical-signed-digit conversion technique for multiplication

Abstract—Fast multiplication can be achieved by using canonical signed digit (CSD) to speed-up computations. Conversion to CSD is needed when the multiplier is not known a priori. In this work, a novel approach for converting an unsigned binary number or two’s complement number to its CSD form from least significant bit to most significant bit, (right-to-left), is presented. Comparison shows that our algorithm is faster and requires less area than existing CSD conversion algorithms.

• Type: Journal
• Year: 2011
• Where: ICASSP
• Authors: Rui Guo, Linda DeBrunner
• Keywords: Canonical Signed Digit, ICASSP 2011, Signal Processing, Significant Bit, Unsigned Binary Number