返回
MCMC Sampling-Based Randomized Likelihood Decoding for Sparse Recovery
DOI:10.1109/TCOMM.2023.3324658.png)
摘要
En 中文
We investigate whether randomized likelihood (RL) decoding based on sampling techniques can completely replace the compressed sensing (CS) process for sparse recovery. For a Gaussian signal model, we propose a novel iterative Markov chain Monte Carlo (MCMC) sampling-based RL decoding method tailored to the attributes of sparse recovery, termed MCMC-RLD-SR. The proposed iterative MCMC-RLD-SR algorithm incorporates two stages, i.e., rough estimation and fine estimation. The rough estimation is a process of figuring out support candidates for the sparse signal via the Metropolis-Hastings (MH) sampling method, which prevents a nonconvergence issue inherent in the CS problem when applying sampling. The fine estimation is a process of acquiring an estimate of the sparse signal through the Gibbs sampling method based on the support candidates from the rough estimation stage. We prove that the proposed algorithm converges by favor of the proposed iterative two-stage sampling structure, and analyze the signal recovery error by the proposed algorithm. Our analysis and simulation results show that the proposed MCMC-RLD-SR algorithm can effectively solve CS problems with much less computational complexity than conventional CS algorithms. Furthermore, even when the signal is not sparse, the proposed algorithm is shown to achieve a reliable signal recovery performance.
Keyword:
Decoding
Estimation
Iterative decoding
Computational complexity
5G mobile communication
Sparse matrices
Convergence
Compressed sensing
support estimation
sparse recovery
Markov chain Monte Carlo method
randomized likelihood decoding
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
暂无机构信息
引用论文
Component-Wise Markov Chain Monte Carlo: Uniform and Geometric Ergodicity under Mixing and Composition基于组件的马尔可夫链蒙特卡洛: 混合和组成下的均匀和几何均等性
STATISTICAL SCIENCE
IF3.4

