Loading [MathJax]/jax/output/CommonHTML/jax.js
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code

    https://doi.org/10.1142/S0219876220500048Cited by:2 (Source: Crossref)

    The Chinese remainder theorem (CRT), which appeared in ancient China, is widely used in many modern computer applications. This paper presents the CRT implementation by using the interval-index characteristic and minimum redundancy residue code. The proposed algorithm does not use large modulo addition operations and provides low computational complexity compared to conventional non-redundant RNS. The efficiency factors of using the minimally redundant RNS increase with the number k of non-redundant moduli, asymptotically approaching the threshold k/2. The new approach presented here will have a significant impact on many non-modular operations in RNS arithmetic, which currently use the CRT.

    Remember to check out the Most Cited Articles!

    Check out these titles in finite element methods!