Abstract

Redundant Binary Signed Digit Number System may not be convenient for manual computations but may be useful in designing high‐speed arithmetic machines. This number system is gaining popularity in computationally intensive environments particularly due to possessing of the carry‐free addition/subtraction properties. This property has enabled arithmetic operations such as addition, multiplication, division, square root, etc., to be performed much faster than with conventional binary number systems. In RBSD number system carry propagation chains are eliminated which reduces the computational time substantially, thus enhancing the speed of the machine. The credit of RBSD number system goes to Robertson, who proposed it in 1959 and Avizienis in 1961.In this paper, some of the recent contributions in the area of design of redundant arithmetic based addition and multiplication algorithms and architectures are briefly discussed. Also use of parallel implementation for architectures is discussed so that the enhancement in speed through the use of redundant arithmetic is possible. Also, in this paper, RBSD adder is designed. After calculation and comparison it is concluded that efficiency of RBSD adder is much better than the other adders. An addition of two’s complement circuit will make an RBSD subtractor. These Adders/Subtractors can further be used as building blocks for fast multiplication, division and square root operation.

Full Text
Paper version not known

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 call

Disclaimer: 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.