Turbo Compressed Sensing with Partial DFT Sensing Matrix
Preprint
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.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Achievable Rates of MIMO Systems With Linear Precoding and Iterative LMMSE DetectionIEEE Transactions on Information Theory, 2014
- Support Recovery With Sparsely Sampled Free Random MatricesIEEE Transactions on Information Theory, 2013
- Generalized approximate message passing for estimation with random linear mixing2011
- A Concise Representation for the Soft-in Soft-out LMMSE DetectorIEEE Communications Letters, 2011
- The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed SensingIEEE Transactions on Information Theory, 2011
- Message-passing algorithms for compressed sensingProceedings of the National Academy of Sciences, 2009
- The Factor Graph Approach to Model-Based Signal ProcessingProceedings of the IEEE, 2007
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency informationIEEE Transactions on Information Theory, 2006
- Near optimum error correcting coding and decoding: turbo-codesIEEE Transactions on Communications, 1996
- Fundamentals of Statistical Signal Processing: Estimation TheoryTechnometrics, 1995