A New Fast Algorithm for Computing a Complex Number--Theoretic Transforms
I.S. Reed, K. Y. Liu, T. K. Truong · Deep Space Network Progress Report · 1977
A high-radix fast Fourier transformation (FFT) algorithm for computing transforms over GF(sq q), where q is a Mersenne prime, is developed to implement fast circular convolutions. This new algorithm requires substantially fewer multiplications than the conventional FFT.