Abstract
This paper describes two sets of algorithms in positive radix arithmetic for conversions between positive and negative integral radix representation of numbers. Each set consists of algorithms for conversions in either direction; these algorithms are mutually complementary in the sense they involve inverse operations depending upon the direction of conversion. The first set of algorithms for conversion of numbers from positive to negative radix (negative to positive radix) proceeds serially from the least significant end of the number and involves complementation and addition (subtraction) of unity on single-digit numbers. The second set of algorithms for conversion of numbers from positive to negative radix (negative to positive radix) proceeds in parallel starting from the full number (the most significant end of the number) and involves complementation and right (left) shift operations. The applications of these algorithms to integers, mixed integer-fractions, floating-point numbers, and for real-time conversions are given.
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.
