Loading [a11y]/accessibility-menu.js
Deterministic Construction of Compressed Sensing Matrices from Protograph LDPC Codes | IEEE Journals & Magazine | IEEE Xplore

Deterministic Construction of Compressed Sensing Matrices from Protograph LDPC Codes


Abstract:

This letter considers the design of measurement matrices with low complexity, easy hardware implementation and good sensing performance for practical compressed sensing a...Show More

Abstract:

This letter considers the design of measurement matrices with low complexity, easy hardware implementation and good sensing performance for practical compressed sensing applications. We construct a class of sparse binary measurement matrices from protograph Low-density parity-check (LDPC) codes, which can satisfy these features simultaneously. The optimal performance of proposed matrices is analyzed from the mutual coherence aspect. Moreover, we obtain a sufficient condition for optimal construction of the matrices using proposed algorithm. Simulation experiments also demonstrate that orthogonal matching pursuit (OMP) algorithm performs better using the constructed matrices as compared with several state-of-the-art measurement matrices, such as random Gaussian matrices.
Published in: IEEE Signal Processing Letters ( Volume: 22, Issue: 11, November 2015)
Page(s): 1960 - 1964
Date of Publication: 19 June 2015

ISSN Information:


Contact IEEE to Subscribe

References

References is not available for this document.