Key points are not available for this paper at this time.
Complex Mersenne Transforms are defined in a ring of integers modulo a Mersenne or pseudo-Mersenne number and can be computed without multiplications. It is shown that under certain conditions, these transforms can be computed by means of fast transform algorithms and permit the evaluation of digital convolutions with better efficiency and accuracy than does the Fast Fourier Transform.
H. Nussbaumer (Wed,) studied this question.