SMLR-Type Blind Deconvolution of Sparse Pulse Sequences Under a Minimum Temporal Distance Constraint

• Published in: IEEE transactions on signal processing 2015-09, Vol.63 (18), p.4838-4853
• Main Authors: Kail, Georg, Hlawatsch, Franz, Novak, Clemens
• Format: Article
• Language: English
• Subjects: Bayes methods; Bayesian blind deconvolution; Bernoulli-Gaussian prior; Complexity theory; Deconvolution; Estimation; iterated window maximization (IWM) algorithm; Shape; Signal processing algorithms; single most likely replacement (SMLR) algorithm; sparse deconvolution; Time-frequency analysis
• ISSN: 1053-587X; 1941-0476
• DOI: 10.1109/TSP.2015.2442951

We consider Bayesian blind deconvolution (BD) of an unknown sparse sequence convolved with an unknown pulse. Our goal is to detect the positions where the sparse input sequence is nonzero and to estimate the corresponding amplitudes as well as the pulse shape. For this task, we propose a novel evolution of the single most likely replacement (SMLR) algorithm. Our method uses a modified Bernoulli-Gaussian prior that incorporates a minimum temporal distance constraint. This prior simultaneously induces sparsity and enforces a prescribed minimum distance between the pulse centers. The minimum distance constraint provides an effective way to avoid overfitting (i.e., spurious detected pulses) and improve resolution. The proposed BD method overcomes certain weaknesses of the traditional SMLR-based BD method, which is verified experimentally to result in improved detection/estimation performance and reduced computational complexity. Our simulation results also demonstrate performance and complexity advantages relative to the iterated window maximization (IWM) algorithm and a recently proposed partially collapsed Gibbs sampler method.