Binary canonic signed digit multiplier for high-speed digital signal processing

Abstract

This paper presents a novel high-speed binary CSD (BCSD) multiplier which takes advantage of the benefits coming from the canonic signed digit (CSD) number system, while overcoming the inherent overhead due to the CSD ternary representation. BCSD is a binary number system which allows representing any CSD number using the same word -length used by the two's complement representation. Thus, multipliers which make use of the BCSD technique exhibit a considerable advantage especially when the multiplicand belongs to a set of coefficients stored in a memory in its BCSD notation, requiring in this case nothing but the BCSD decoding scheme which maps the BCSD number back into its CSD representation without introducing any substantial overhead.