Recovering a Clipped Signal in Sparseland

In many data acquisition systems it is common to observe signals whose amplitudes have been clipped. We present two new algorithms for recovering a clipped signal by leveraging the model assumption that the underlying signal is sparse in the frequency domain. Both algorithms employ ideas commonly used in the field of Compressive Sensing; the first is a modified version of Reweighted $\ell_1$ minimization, and the second is a modification of a simple greedy algorithm known as Trivial Pursuit. An empirical investigation shows that both approaches can recover signals with significant levels of clipping

[1]  Richard G. Baraniuk,et al.  Distributed Compressive Sensing , 2009, ArXiv.

[2]  Vishal M. Patel Sparse and Redundant Representations for Inverse Problems and Recognition , 2010 .

[3]  Tomas Olofsson,et al.  Deconvolution and model-based restoration of clipped ultrasonic signals , 2005, IEEE Transactions on Instrumentation and Measurement.

[4]  Hugo Van hamme,et al.  Compressive Sensing for Missing Data Imputation in Noise Robust Speech Recognition , 2010, IEEE Journal of Selected Topics in Signal Processing.

[5]  Simon J. Godsill,et al.  Statistical Model-Based Approaches to Audio Restoration and Analysis , 2001 .

[6]  Michael Elad,et al.  A constrained matching pursuit approach to audio declipping , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[7]  Stephen P. Boyd,et al.  Enhancing Sparsity by Reweighted ℓ1 Minimization , 2007, 0711.1612.

[8]  Julius O. Smith,et al.  Restoring a clipped signal , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.

[9]  E.J. Candes Compressive Sampling , 2022 .