The Goertzel-Blahut algorithm is closely related to the fast fourier transform

Abstract

The Goertzel-Blahut algorithm for the discrete Fourier transform computation presented in the paper belongs to a class of semifast algorithms, but its modification is closely related to the fast Fourier transform algorithms.