Answers are grounded in this paper and cite their sources.
Compressive sensing (CS) is a novel paradigm for acquiring signals, based on the idea that one can efficiently capture all the information of sparse domain by sampling only a part of signal through sub-Nyquist signal acquisition. As Bayesian inference is substituting conventional CS methods, the work employ Bayesian inference which depict CS matrix by a factor graph to accelerate both encoding and belief propagation (BP) decoding. Two state mixture Gaussian model is used to model prior for sparse signal. To decode a length-N signal having K large coefficients, our BCS-BP decoding algorithm uses O (K log (N)) and O (N log2 (N)) computation. BCS-BP algorithm is easily versatile to various signal models.
No takes yet. Share an insight, caveat, or question.
Paliwal et al. (2019) studied this question.
Synapse has enriched 4 related papers. Consider them for comparative context: