The finite Fourier transform

The finite Fourier transform of a finite sequence is defined and its elementary properties are developed. The convolution and term-by-term product operations are defined and their equivalent operations in transform space are given. A discussion of the transforms of stretched and sampled functions leads to a sampling theorem for finite sequences. Finally, these results are used to give a simple derivation of the fast Fourier transform algorithm.