About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
IEEE Transactions on Audio and Electroacoustics
Paper
The Finite Fourier Transform
Abstract
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. Copyright © 1969 by The Institute of Electrical and Electronics Engineers, Inc.