Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity.

Sameer Pawar Kannan Ramchandran

Published in: ISIT (2013)

Keyphrases

discrete fourier transform
fourier transform
frequency domain
radon transform
discrete cosine transform
computational complexity
sparse representation
training set
fourier series
fourier coefficients
building blocks
pattern classification
texture classification