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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
