"A robust R-FFAST framework for computing a k-sparse n-length DFT in O(k ..."

Sameer Pawar, Kannan Ramchandran (2014)

> Home

Details and statistics

DOI: 10.1109/ISIT.2014.6875154

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/PawarR14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isit/PawarR14
Sameer Pawar, Kannan Ramchandran:
A robust R-FFAST framework for computing a k-sparse n-length DFT in O(k log n) sample complexity using sparse-graph codes. ISIT 2014: 1852-1856

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.