Fast Mersenne-prime transforms for digital filtering
I.S. Reed, T. K. Truong · Proceedings of the Institution of Electrical Engineers · 1978
It is shown that Winograd's algorithm can be used to compute an integer transform over GF(q), where q is a Mersenne prime. This new algorithm requires fewer multiplications than the conventional fast Fourier transform (f.f.t). The transform over GF(q) can be implemented readily on a digital computer. This fact makes it possible to more easily encode b.c.h. and r.s. codes.