Fast Base Extension Using a Redundant Modulus in RNS

Authors

A. P. Shenoy, University of Rhode Island
R. Kumaresan, University of Rhode IslandFollow

Document Type

Article

Date of Original Version

1-1-1989

Abstract

A novel technique to extend the base of a residue number system (RNS) based on the Chinese remainder theorem (CRT) and the use of a redundant modulus is proposed. The proposed technique obtains the residue(s) of a given number in the extended moduli without resorting to the traditional mixed radix conversion (MRC) algorithm. The base extension can be achieved in log2n table lookup cycles where n is the number of moduli in the RNS. The superiority of the technique compared in terms of latency and hardware requirements to the traditional Szabo-Tanaka method is demonstrated. © 1989 IEEE

Publication Title, e.g., Journal

IEEE Transactions on Computers

Volume

38

Issue

2

Citation/Publisher Attribution

Shenoy, A. P., and R. Kumaresan. "Fast Base Extension Using a Redundant Modulus in RNS." IEEE Transactions on Computers 38, 2 (1989): 292-297. doi: 10.1109/12.16508.