Abstract
AbstractSigned-digit number system is an unconventional number system which has been found to cause greater efficacy and efficiency in performing some arithmetic operations. Obviously, it seems interesting to investigate signed-digit number system in wider context, including designing magnitude comparator. Although magnitude comparator is an integral part of every standard arithmetic processor, no significant work on magnitude comparison has been reported yet even for the more propitious categories of signed-digit number system, including canonical signed-digit number system. In this paper, an algorithm for magnitude comparison of canonical signed-digit number system is proposed in terms of comparing the magnitudes and signs of some counterpart portions of the inputs. The proposed algorithm can be immediately implemented at hardware level employing some ordinary logic gates only and in every execution stage of the proposed algorithm, all operations may be completed in a fairly small number of logic levels.KeywordsComputer ArithmeticCanonical Signed-Digit NumberMagnitude ComparisonRecurrence RelationPropagation Delay
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.
