Turbo Compressed Sensing with Partial DFT Sensing Matrix
arXiv:1408.3904 · doi:10.1109/LSP.2014.2351822
Abstract
In this letter, we propose a turbo compressed sensing algorithm with partial discrete Fourier transform (DFT) sensing matrices. Interestingly, the state evolution of the proposed algorithm is shown to be consistent with that derived using the replica method. Numerical results demonstrate that the proposed algorithm outperforms the well-known approximate message passing (AMP) algorithm when a partial DFT sensing matrix is involved.
IEEE Signal Processing Letters, (Volume:22, Issue: 2), Feb. 2015
Cited by in corpus (7)
- Algorithms for the Iterative Estimation of Discrete-Valued Sparse Vectors
- On Sparse Vector Recovery Performance in Structurally Orthogonal Matrices via LASSO
- Low-Complexity Iterative Algorithms for (Discrete) Compressed Sensing
- D-OAMP: A Denoising-based Signal Recovery Algorithm for Compressed Sensing
- Unveiling Bias Compensation in Turbo-Based Algorithms for (Discrete) Compressed Sensing
- Sparse Vector Recovery: Bernoulli-Gaussian Message Passing
- Denoising-based Turbo Compressed Sensing