Sparse Binary Matrices of LDPC Codes for Compressed Sensing

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.