R-FFAST: A Robust Sub-Linear Time Algorithm for Computing a Sparse DFT

DOI10.1109/TIT.2017.2679053zbMath1477.65274MaRDI QIDQ4566645

Sameer A. Pawar, Kannan Ramchandran

Publication date: 27 June 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11)

Related Items (2)

Performance of the multiscale sparse fast Fourier transform algorithm ⋮ Peeling decoding of LDPC codes with applications in compressed sensing

This page was built for publication: R-FFAST: A Robust Sub-Linear Time Algorithm for Computing a Sparse DFT