Sparse Binary Matrices of LDPC Codes for Compressed Sensing

@article{Lu2012SparseBM,
  title={Sparse Binary Matrices of LDPC Codes for Compressed Sensing},
  author={Weizhi Lu and Kidiyo Kpalma and Joseph Ronsin},
  journal={2012 Data Compression Conference},
  year={2012},
  pages={405-405}
}
We present the sparse binary matrix defined by low-density parity-check (LDPC) codes as measurement matrix in compressed sensing. This kind of matrix owns much stronger orthogonality than current other main measurement matrices. In practice, for a matrix given size, the optimal column degree for high orthogonality can also be determined by progressive edge-growth (PEG) algorithm. 
Highly Cited
This paper has 32 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 21 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Open question: deterministic uup matrices

  • T. Tao
  • Weblog at:
  • 2007
1 Excerpt

Stable Signal Recovery from Incomplete and Inaccurate Measurements

  • E. Candes, J. Romberg, T. Tao
  • Communications on Pure and Applied Mathematics,
  • 2006
3 Excerpts

Similar Papers

Loading similar papers…