The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Discrete Convolutions via Mersenne Transrorms
IEEE Transactions on Computers
Hi-index | 0.00 |
An approach is described for computing complex convolutions modulo a Fermat number. It is shown that this technique is particularly efficient when the complex convolution is computed by means of Fermat Number Transforms and leads to improved implementation of complex digital filters.