Abstract
Binary Signed Digit(BSD) representation of an integer is widely used in computer arithmetic,cryptography and digital signal processing.An integer of length n bits can have several BSD representations.In this paper,the authors studied the properties of the number of BSD representation of an integer,and presented two improved non-recursion algorithms.They can rapidly calculate the exact number of BSD representations of an integer of a certain length,and the storage requirements get reduced.
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.
