The discrete Fourier transform of a sequence of N points, where N is a prime number, is shown to be essentially a circular correlation. This can be recognized by rearranging the members of the… Expand

A computational algorithm for numerically evaluating the z -transform of a sequence of N samples is discussed. This algorithm has been named the chirp z -transform (CZT) algorithm. Using the CZT… Expand

1. Introduction. Characterization of Signals. Characterization of Linear Time-Invariant Systems. Sampling of Signals. Linear Filtering Methods Based on the DFT. The Cepstrum. Summary and References.… Expand

We discuss a computational algorithm for numerically evaluating the z-transform of a sequence of N samples. This algorithm has been named the chirp z-transform algorithm. Using this algorithm one can… Expand

A class of transformation matrices, analogous to the Householder Matrices, is developed, with a nonorthogonal property designed to permit the efficient deletion of data from least-squares problems.Expand

An alternative form of the fast Fourier transform (FFT) is developed. The new algorithm has the peculiarity that none of the multiplying constants required are complex-most are pure imaginary. The… Expand