30 citations · 36 across the 3 of their papers we have counts for
Showing cs.ITShow all
3 papers · 1 filter
cs.IT2009★ 6 cited
Near-Optimal Detection in MIMO Systems using Gibbs Sampling
Morten Hansen, Babak Hassibi, Alexandros G. Dimakis +1
In this paper we study a Markov Chain Monte Carlo (MCMC) Gibbs sampler for solving the integer least-squares problem. In digital communication the problem is equivalent to performi…
cs.IT2008★ 30 cited
Efficient and Robust Compressed Sensing using High-Quality Expander Graphs
Sina Jafarpour, Weiyu Xu, Babak Hassibi +1
Expander graphs have been recently proposed to construct efficient compressed sensing algorithms. In particular, it has been shown that any -dimensional vector that is -spars…
cs.IT2007
A Local Tree Structure is NOT Sufficient for the Local Optimality of Message-Passing Decoding in Low Density Parity Check Codes
Weiyu Xu
We address the problem,`Is a local tree structure sufficient for the local optimality of message passing algorithm in low density parity check codes?'.It is shown that the answer i…