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

researchr

You are not signed in
Sign in
Sign up

Sameer Pawar, Kannan Ramchandran. Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity. In Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, July 7-12, 2013. pages 464-468, IEEE, 2013. [doi]

Abstract is missing.

runs on WebDSL