Journal
Scientific and technical journal «Priborostroenie»
UDK621.391
Issue:8 (56)
Download PDF344 Kbyte
The classic Goertzel-Blahut algorithm for computation of discrete Fourier transform over a finite field is considered along with several modifications of the classic algorithm. It is shown that the modified Goertzel—Blahut algorithm is closely related to the fast Fourier transform algorithms rather than to the semi-fast algorithms.