Fast algorithms for complex integer transforms
Kwang Liu, I.S. Reed, T. K. Truong · IEEE Transactions on Acoustics Speech and Signal Processing · 1977
In this correspondence both high-radix and real-valued input FFT algorithms are applied to transforms over the finite field GF(q2), where q is a Mersenne prime. Such transforms can be used to implement fast circular convolutions without roundoff error. Of particular interest is a new radix 8 FFT algorithm, which requires fewer multiplications than the conventional radix 8 FFT algorithm.