Question

What is the transform that is suitable for evaluating the z-transform of a set of data on a variety of contours in the z-plane?

(a) Goertzel Algorithm

(b) Fast Fourier transform

(c) Chirp-z transform

(d) None of the mentioned

I have been asked this question in class test.

Origin of the question is Linear Filtering Approach to Computation of DFT topic in division DFT Efficient Computation – Fast Fourier Transform Algorithms of Digital Signal Processing

Answer 1

Correct choice is (c) Chirp-z transform

For explanation I would say: Chirp-z transform algorithm is suitable for evaluating the z-transform of a set of data on a variety of contours in the z-plane. This algorithm is also formulated as a linear filtering of a set of input data. As a consequence, the FFT algorithm can be used to compute the Chirp-z transform.