The application of core functions to residue number systems
Abstract
A theory of core functions is presented, and the application of this theory to the difficult residue number system (RNS) operations is described. Potential applications for specialpurpose corebased RNS processors include adaptive array processing, Kalman filtering, fastFourier transforms, and image processing. The theoretical developments are motivated by the assumption that lookup tables are available with some limit on the number of addresses per table. The tables are used to implement both the modular and nonmodular operations. The restriction on the number of addresses per table, in turn, places a restriction on the largest permissible modulus, because the tables used to implement the modular operations will be addressed by a pair of residues. The contents of each lookup table may be precomputed by any method, as long as the limit on address space is respected and the number of bits per address is reasonable.
 Publication:

IEEE Transactions on Signal Processing
 Pub Date:
 January 1991
 DOI:
 10.1109/78.80766
 Bibcode:
 1991ITSP...39...69G
 Keywords:

 Complex Variables;
 Scaling Laws;
 Fast Fourier Transformations;
 Floating Point Arithmetic;
 Image Processing;
 Iterative Solution;
 Kalman Filters;
 Communications and Radar