ISSN 0021-3454 (print version)
ISSN 2500-0381 (online version)
Menu

2
Issue
vol 67 / February, 2024
Article
UDC 621.391

MODIFICATION OF GOERTZEL-BLAHUT ALGORITHM

S. V. Fedorenko
St. Petersburg State University of Aerospace Instrumentation, Department of Information Systems Security; Professor


Read the full article 

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