Fast parallel arithmetic via modular representation
SIAM Journal on Computing
Modulo Reduction in Residue Number Systems
IEEE Transactions on Parallel and Distributed Systems
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Integer Division in Residue Number Systems
IEEE Transactions on Computers
Error Analysis of Approximate Chinese-Remainder-Theorem Decoding
IEEE Transactions on Computers
| Hi-index | 0.01 |
This paper describes a library of platform independent functions for performing modular arithmetic on a range of parallel hardware. It is based around an approximate Chinese remainder reconstruction which allows the most significant bits of the stored number to be calculated without the cost of a full reconstruction. We describe how this can be used to calculate the length of a modular number, and also its applications to comparison and division.