The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Digital Processing of Signals
Discrete Convolutions via Mersenne Transrorms
IEEE Transactions on Computers
Fast Multipliers for Number Theoretic Transforms
IEEE Transactions on Computers
Algorithms and pipeline architectures for 2-D FFT and FFT-like transforms
Digital Signal Processing
| Hi-index | 0.01 |
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.