Abstract
In this paper, we introduce a new algorithm for sign detection in a residue number system, which can be applied to any number of moduli set. This technique is faster than most competitive published works, based on MRC or CRT. The CRT requires large modulo M and is therefore costly to implement. The mix radix conversion (MRC) is a sequential process which causes long delay. The proposed algorithm is based on CRT 11. No big modulo M = Π i=1 pi n pi operations are needed for the CRT II. The modulo multipliers in the CRT II are bounded by size √ M. The new sign detector uses less hardware than previous techniques. Using the new moduli set (2, 2 n − 1, 2 n + 2 n−1 − 1, 2 n+1 + 2 n − 1), the implementation of a sign detector is further simplified.
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.