Issue No.07 - July (1999 vol.48)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.780883
<p><b>Abstract</b>—Previous scaling schemes have used iterative algorithms, which lead to computation time and memory requirements that increase with the number of moduli. This paper presents a two look-up cycle scaling scheme which allows a diminution of the required memory when nonlarge sets of moduli are considered. This scheme can be combined with previous algorithms for larger sets of moduli.</p>
Residue number system (RNS), scaling, look-up table implementation.
Antonio García, Antonio Lloris, "A Look-Up Scheme for Scaling in the RNS", IEEE Transactions on Computers, vol.48, no. 7, pp. 748-751, July 1999, doi:10.1109/12.780883