This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Note on Fast Base Extension for Residue Number Systems with Three Moduli
November 1975 (vol. 24 no. 11)
pp. 1132-1133
K.H. O'Keefe, TRW Systems Group
An algorithm is given for the base-extension (BE) computation in residue number systems that requires the standard four steps (for systems with three moduli) but which saves hardware. Furthermore, for the particular moduli m-1, m, and m+1 it is shown that fast-BE in only two steps is possible, for all combinations of the moduli.
Index Terms:
Base extension, modular arithmetic, residue number systems.
Citation:
K.H. O'Keefe, "A Note on Fast Base Extension for Residue Number Systems with Three Moduli," IEEE Transactions on Computers, vol. 24, no. 11, pp. 1132-1133, Nov. 1975, doi:10.1109/T-C.1975.224147
Usage of this product signifies your acceptance of the Terms of Use.