Abstract
Redundant binary (RB) representation is one of the signed-digit number systems originally introduced by Avizienis, which provides carry-propagation-free addition. Since the multiplication of two numbers is generally performed by the addition of partial products, the carry-propagation-free feature of the RB arithmetic can be used to design high-speed multipliers and multiply-and-accumulate units. However, a RB-NB (redundant binary to normal binary) converter is required to provide a 2's-complement representation of the results. Previous research was conducted for the RB-NB converter. In this paper, based on Yen's method and Ling's adder scheme, we propose an improved RB-NB converter. The proposed RB-NB converter shows improvement in area and speed over other methods. The new RB-NB converter has been adopted in our proposed high-performance Complex Arithmetic Signal Processor.
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.
