MODIFICATION OF GOERTZEL-BLAHUT ALGORITHM
St. Petersburg State University of Aerospace Instrumentation, Department of Information Systems Security; Professor
Abstract. 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.
Keywords: discrete Fourier transform, fast Fourier transform, algorithm complexity, fast algorithm, semifast algorithm, finite field