<--- Back to Details
First PageDocument Content
Fourier analysis / Fast Fourier transform / FFTW / Sinc function / Discrete Fourier transform / Discrete Hartley transform / Mathematical analysis / Digital signal processing / Mathematics
Date: 2013-12-10 15:35:29
Fourier analysis
Fast Fourier transform
FFTW
Sinc function
Discrete Fourier transform
Discrete Hartley transform
Mathematical analysis
Digital signal processing
Mathematics

Recent  Developments  in  the   Sparse  Fourier  Transform   Piotr  Indyk   MIT   Joint  work  with  Fadel  Adib,  Badih  Ghazi,  Haitham  Hassanieh,  Michael  

Add to Reading List

Source URL: people.csail.mit.edu

Download Document from Source Website

File Size: 1,93 MB

Share Document on Facebook

Similar Documents

Frobenius Additive Fast Fourier Transform Wen-Ding Li Ming-Shing Chen  Po-Chun Kuo

Frobenius Additive Fast Fourier Transform Wen-Ding Li Ming-Shing Chen Po-Chun Kuo

DocID: 1xVYf - View Document

Polynomials and the Fast Fourier Transform (FFT)

Polynomials and the Fast Fourier Transform (FFT)

DocID: 1xUw0 - View Document

Lecture XI: The Fast Fourier Transform (FFT) algorithm Maxim Raginsky BME 171: Signals and Systems Duke University

Lecture XI: The Fast Fourier Transform (FFT) algorithm Maxim Raginsky BME 171: Signals and Systems Duke University

DocID: 1ubp9 - View Document

Fast Fourier Transform on FPGA: Design Choices and Evaluation Peter A. Milder, Franz Franchetti, James C. Hoe, and Markus P¨uschel Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh,

Fast Fourier Transform on FPGA: Design Choices and Evaluation Peter A. Milder, Franz Franchetti, James C. Hoe, and Markus P¨uschel Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh,

DocID: 1seVm - View Document

© DIGITAL VISION  A Tutorial on Fast Fourier Sampling [How to apply it to problems] C. Gilbert,

© DIGITAL VISION A Tutorial on Fast Fourier Sampling [How to apply it to problems] C. Gilbert,

DocID: 1rugj - View Document