"FFAST: An Algorithm for Computing an Exactly k-Sparse DFT in O(k log k) Time."

Sameer Pawar, Kannan Ramchandran (2018)

> Home

Details and statistics

DOI: 10.1109/TIT.2017.2746568

access: closed

type: Journal Article

metadata version: 2020-03-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tit/PawarR18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/PawarR18
Sameer Pawar, Kannan Ramchandran:
FFAST: An Algorithm for Computing an Exactly k-Sparse DFT in O(k log k) Time. IEEE Trans. Inf. Theory 64(1): 429-450 (2018)

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.