Abstract
Compressed Sensing (CS) has developed rapidly as an innovation in signal processing domain. Considering the situation that there are multiple sparse signals with redundancy, the correlation between them need to be properly utilized for further compression. To this end, a CS scheme based on Belief Propagation (BP) algorithm is proposed to compress correlated sparse (compressible) signals in this paper. The BP algorithm is a kind of solution of Bayesian CS by considering CS problem as an analogy of channel coding. Inspired by this, we modify the original BP algorithm by the side information available only at the decoder to obtain better recovery performance with the same sensing rate. The simulation results show that the proposed scheme is superior to the separate BP scheme and the joint L1 scheme for the correlated sparse signals.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
