Alternatives to the Discrete Fourier Transform
author: Aliaksei Sandryhaila, Carnegie Mellon University
author: Jonathan Gross, Carnegie Mellon University
author: Markus Püschel, Carnegie Mellon University
published: Dec. 20, 2008, recorded: December 2008, views: 9096
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
It is well-known that the discrete Fourier transform (DFT) of a finite length discrete-time signal samples the discrete-time Fourier transform of the same signal at equidistant points on the unit circle. Hence, as the signal length goes to infinity, the DFT approaches the DTFT. Associated with the DFT are circular convolution and a periodic signal extension. In this paper we identify a large class of alternatives to the DFT using the theory of polynomial algebras. Each of these Fourier transforms approaches the DTFT just as the DFT does, but has its own signal extension and notion of convolution, which therefore are not periodic. Furthermore, these Fourier transforms have Vandermonde structure, which enables their computation via fast $O(n \log^2(n))$ algorithms.
Download slides: aml08_balcan_adft_01.ppt (2.4 MB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !
Write your own review or comment: