51 citations · 182 across the 15 of their papers we have counts for
15 papers
Fast and Efficient Sparse 2D Discrete Fourier Transform using Sparse-Graph Codes
Frank Ong, Sameer Pawar, Kannan Ramchandran
We present a novel algorithm, named the 2D-FFAST, to compute a sparse 2D-Discrete Fourier Transform (2D-DFT) featuring both low sample complexity and low computational complexity.…
SPRIGHT: A Fast and Robust Framework for Sparse Walsh-Hadamard Transform
Xiao Li, Joseph K. Bradley, Sameer Pawar +1
We consider the problem of computing the Walsh-Hadamard Transform (WHT) of some -length input vector in the presence of noise, where the -point Walsh spectrum is -sparse w…
Efficient Algorithms for the Data Exchange Problem
Nebojsa Milosavljevic, Sameer Pawar, Salim El Rouayheb +2
In this paper we study the data exchange problem where a set of users is interested in gaining access to a common file, but where each has only partial knowledge about it as side-i…
A robust sub-linear time R-FFAST algorithm for computing a sparse DFT
Sameer Pawar, Kannan Ramchandran
The Fast Fourier Transform (FFT) is the most efficiently known way to compute the Discrete Fourier Transform (DFT) of an arbitrary n-length signal, and has a computational complexi…
Sub-linear Time Support Recovery for Compressed Sensing using Sparse-Graph Codes
Xiao Li, Dong Yin, Sameer Pawar +2
We study the support recovery problem for compressed sensing, where the goal is to reconstruct the a high-dimensional -sparse signal , from low-dimens…
Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity
Sameer Pawar, Kannan Ramchandran
Given an -length input signal $\mbf{x}$, it is well known that its Discrete Fourier Transform (DFT), $\mbf{X}$, can be computed in complexity using a Fast Fourier…