The Community for Technology Leaders
Green Image
Issue No. 11 - November (1975 vol. 24)
ISSN: 0018-9340
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.
Base extension, modular arithmetic, residue number systems.

K. O'Keefe, "A Note on Fast Base Extension for Residue Number Systems with Three Moduli," in IEEE Transactions on Computers, vol. 24, no. , pp. 1132-1133, 1975.
85 ms
(Ver 3.3 (11022016))