3k citations · 10.2k across the 110 of their papers we have counts for
6 papers · 1 filter
Hybrid Approximate Message Passing
Sundeep Rangan, Alyson K. Fletcher, Vivek K. Goyal +2
Gaussian and quadratic approximations of message passing algorithms on graphs have attracted considerable recent attention due to their computational simplicity, analytic tractabil…
Ranked Sparse Signal Support Detection
Alyson K. Fletcher, Sundeep Rangan, Vivek K Goyal
This paper considers the problem of detecting the support (sparsity pattern) of a sparse vector from random noisy measurements. Conditional power of a component of the sparse vecto…
Estimation of Sparse MIMO Channels with Common Support
Yann Barbotin, Ali Hormati, Sundeep Rangan +1
We consider the problem of estimating sparse communication channels in the MIMO context. In small to medium bandwidth communications, as in the current standards for OFDM and CDMA…
Orthogonal Matching Pursuit: A Brownian Motion Analysis
Alyson K. Fletcher, Sundeep Rangan
A well-known analysis of Tropp and Gilbert shows that orthogonal matching pursuit (OMP) can recover a k-sparse n-dimensional real vector from 4 k log(n) noise-free linear measureme…
Message-Passing Estimation from Quantized Samples
Ulugbek Kamilov, Vivek K. Goyal, Sundeep Rangan
Estimation of a vector from quantized linear measurements is a common problem for which simple linear techniques are suboptimal -- sometimes greatly so. This paper develops general…
Optimal Quantization for Compressive Sensing under Message Passing Reconstruction
Ulugbek Kamilov, Vivek K Goyal, Sundeep Rangan
We consider the optimal quantization of compressive sensing measurements following the work on generalization of relaxed belief propagation (BP) for arbitrary measurement channels.…