A Note on Fast Base Extension for Residue Number Systems with Three Moduli
- 1 November 1975
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-24 (11), 1132-1133
- https://doi.org/10.1109/T-C.1975.224147
Abstract
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.Keywords
This publication has 4 references indexed in Scilit:
- Remarks on Base Extension for Modular ArithmeticIEEE Transactions on Computers, 1973
- Error Correcting Properties of Redundant Residue Number SystemsIEEE Transactions on Computers, 1973
- Error Correction in Redundant Residue Number SystemsIEEE Transactions on Computers, 1973
- Sign Detection in Residue Number SystemsIEEE Transactions on Computers, 1969