Fast algorithm for computer complex number-theoretic transforms
I.S. Reed, K.Y. Liu, T. K. Truong · Electronics Letters · 1977
A high-radix f.f.t. algorithm for computing transforms over GF(q2), where q is a Mersenne prime, is developed to implement fast circular convolutions. This new algorithm requires substantially fewer multiplications than the conventional f.f.t.