"Computing a k-sparse n-length Discrete Fourier Transform using at most 4k ..."

Sameer Pawar, Kannan Ramchandran (2013)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2018-08-13

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-1305-0870
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1305-0870
Sameer Pawar, Kannan Ramchandran:
Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity. CoRR abs/1305.0870 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.