Zobrazeno 1 - 10
of 91
pro vyhledávání: '"Pawar, Sameer"'
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. The proposed algorithm is based on mixed concepts from signal processi
Externí odkaz:
http://arxiv.org/abs/1509.05849
We consider the problem of computing the Walsh-Hadamard Transform (WHT) of some $N$-length input vector in the presence of noise, where the $N$-point Walsh spectrum is $K$-sparse with $K = {O}(N^{\delta})$ scaling sub-linearly in the input dimension
Externí odkaz:
http://arxiv.org/abs/1508.06336
Autor:
Milosavljevic, Nebojsa, Pawar, Sameer, Rouayheb, Salim El, Gastpar, Michael, Ramchandran, Kannan
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-information. Assuming that the file is broken into packets, the side-in
Externí odkaz:
http://arxiv.org/abs/1502.06149
Autor:
Pawar, Sameer, Ramchandran, Kannan
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 complexity of O(n log n). If the DFT X of the signal x has only k non-zero coe
Externí odkaz:
http://arxiv.org/abs/1501.00320
We study the support recovery problem for compressed sensing, where the goal is to reconstruct the a high-dimensional $K$-sparse signal $\mathbf{x}\in\mathbb{R}^N$, from low-dimensional linear measurements with and without noise. Our key contribution
Externí odkaz:
http://arxiv.org/abs/1412.7646
Autor:
Pawar, Sameer, Ramchandran, Kannan
Given an $n$-length input signal $\mbf{x}$, it is well known that its Discrete Fourier Transform (DFT), $\mbf{X}$, can be computed in $O(n \log n)$ complexity using a Fast Fourier Transform (FFT). If the spectrum $\mbf{X}$ is exactly $k$-sparse (wher
Externí odkaz:
http://arxiv.org/abs/1305.0870
Autor:
Milosavljevic, Nebojsa, Pawar, Sameer, Rouayheb, Salim El, Gastpar, Michael, Ramchandran, Kannan
In this paper we study the multisource multicast problem where every sink in a given directed acyclic graph is a client and is interested in a common file. We consider the case where each node can have partial knowledge about the file as a side infor
Externí odkaz:
http://arxiv.org/abs/1203.2298
Autor:
Milosavljevic, Nebojsa, Pawar, Sameer, Rouayheb, Salim El, Gastpar, Michael, Ramchandran, Kannan
In this paper we construct a deterministic polynomial time algorithm for the problem where a set of users is interested in gaining access to a common file, but where each has only partial knowledge of the file. We further assume the existence of anot
Externí odkaz:
http://arxiv.org/abs/1202.1612
In this paper, we quantify how much codes can reduce the data retrieval latency in storage systems. By combining a simple linear code with a novel request scheduling algorithm, which we call Blocking-one Scheduling (BoS), we show analytically that it
Externí odkaz:
http://arxiv.org/abs/1202.1359