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: CoRR (2013)

Keyphrases

discrete fourier transform
fourier transform
frequency domain
pattern recognition
radon transform
image segmentation
high quality
computational complexity
neural network
multiresolution
building blocks
sparse representation
filter bank
discrete cosine transform
fourier series
fourier coefficients