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

Sameer Pawar, Kannan Ramchandran (2013)

> Home

Details and statistics

DOI: 10.1109/ISIT.2013.6620269

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isit/PawarR13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isit/PawarR13
Sameer Pawar, Kannan Ramchandran:
Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity. ISIT 2013: 464-468

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.