Residue number system implementations of number theoretic transforms in complex residue rings

This paper discusses the implementation of number theoretic transforms defined in complex residue rings. A selection of transform parameters for lookup table and microprocessor realizations are discussed. When the length of the convolution is moderate, the lookup table approach offers greater flexibility in the choice of dynamic range. The microprocessor implementation is shown to handle a number theoretic transform of 840 complex samples.