A Note on Fast Base Extension for Residue Number Systems with Three Moduli
Kenneth H. O'Keefe · IEEE Transactions on Computers · 1975
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.