pith. sign in

arxiv: 1408.3904 · v2 · pith:4SS5VP6Enew · submitted 2014-08-18 · 💻 cs.IT · math.IT

Turbo Compressed Sensing with Partial DFT Sensing Matrix

classification 💻 cs.IT math.IT
keywords sensingalgorithmpartialcompressedmatrixproposedturboapproximate
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.