Abstract
Modified signed-digit (MSD) arithmetic can be efficiently performed by using two-step symbolic substitution (SS) for carry-free addition and borrow-free subtraction, where the to-be-added pair of numbers is first mapped into an intermediate pair such that the addition of the latter pair will prohibit carry propagation. Kozaitis1 presented the addition rules for a higherorder (two-bit) SS scheme allowing four bits to be processed at the same time. However, this technique depends on the length of the bit string, thereby producing an unnecessary constraint on the computation speed for operations involving long operands. To incorporate more information in fewer digits and at the same time perform arithmetic operations independent of the length of the bit strings, in this paper we study the higher-order SS technique employing MSD quaternary arithmetic. The necessary SS rules for both addition and subtraction using the proposed technique have been derived by taking into consideration a pair of reference bits from the next-lower-order bit position. Finally, the performances of the higher-order MSD binary, trinary, and quaternary arithmetic with the optical SS technique are compared.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.