Efficient Techniques for Impulsive Noise Cancellation in CGU/SD Systems

In this paper, we investigate the problem of impulsive noise cancellation in systems that use jointly overcomplete expansion representations, namely the cyclic geometrically uniform (CGU) frame and sigma-delta (SD) quantization. We first describe the existing analogy between the CGU frames and Reed–Solomn (RS) codes and how it can be exploited in order to reformulate the impulsive noise cancellation problem. As the impulsive noise does by nature represent a sparse signal, it fits the compressed sensing (CS) framework. This is why we investigate how to remodel our impulsive noise cancellation in a CGU-/SD-based system as a CS problem. Then, we study the use and limitations of some existing CS recovery techniques, namely Smoothed L0 (SL0), orthogonal matching pursuit (OMP), compressive sampling matching pursuit (CoSaMP), and Bayes-based approach (BBA). In order to overcome such limitations, we propose how to improve such techniques, and we show that their related improved versions, namely Improved SL0 (I-SL0), I-OMP and I-CoSaMP, and I-BBA efficiently, cancel the impulsive noise of CGU/SD systems and do lead to a quasi-optimal performance. Simulation results are given to support our claims.

[1]  Lutz Lampe,et al.  Bursty impulse noise detection by compressed sensing , 2011, 2011 IEEE International Symposium on Power Line Communications and Its Applications.

[2]  Brian M. Sadler,et al.  An overview of robust compressive sensing of sparse signals in impulsive noise , 2015, 2015 23rd European Signal Processing Conference (EUSIPCO).

[3]  I. Daubechies,et al.  Approximating a bandlimited function using very coarsely quantized data: A family of stable sigma-delta modulators of arbitrary order , 2003 .

[4]  Fatma Abdelkefi,et al.  A novel impulsive noise cancelation method using sigma-delta quantization of geometrically uniform finite frames , 2012, 2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA).

[5]  I. Daubechies.  Ten Lectures on Wavelets , 1992 .

[6]  Pierre Duhamel,et al.  Impulsive noise cancellation in multicarrier transmission , 2005, IEEE Transactions on Communications.

[7]  Tareq Y. Al-Naffouri,et al.  Impulse noise cancellation in OFDM: an application of compressed sensing , 2008, 2008 IEEE International Symposium on Information Theory.

[8]  Gabor C. Temes,et al.  Oversampling Delta Sigma Data Converters , 1991 .

[9]  Fatma Abdelkefi.  Performance of sigma-delta quantizations in finite frames , 2010, IEEE Trans. Inf. Theory.

[10]  Deanna Needell,et al.  CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, ArXiv.

[11]  Tareq Y. Al-Naffouri,et al.  Impulse Noise Estimation and Removal for OFDM Systems , 2014, IEEE Transactions on Communications.

[12]  David L. Donoho,et al.  De-noising by soft-thresholding , 1995, IEEE Trans. Inf. Theory.

[13]  Christian Jutten,et al.  Fast Sparse Representation based on Smoothed � , 2006 .

[14]  W. Marsden.  I and J , 2012 .

[15]  Bhaskar D. Rao,et al.  Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm , 1997, IEEE Trans. Signal Process..

[16]  Philip Schniter,et al.  Fast Bayesian Matching Pursuit: Model Uncertainty and Parameter Estimation for Sparse Linear Models , 2009 .

[17]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[18]  Monisha Ghosh,et al.  Analysis of the effect of impulse noise on multicarrier and single carrier QAM systems , 1996, IEEE Trans. Commun..

[19]  Wilhelm Burger,et al.  Digital Image Processing - An Algorithmic Introduction using Java , 2008, Texts in Computer Science.

[20]  Fatma Abdelkefi.  Information Theory CGU-frame-based representations and their connection with Reed - Solomon and DCT/DST coding schemes , 2009, Eur. Trans. Telecommun..

[21]  Tareq Y. Al-Naffouri,et al.  Sparse Reconstruction Using Distribution Agnostic Bayesian Matching Pursuit , 2013, IEEE Transactions on Signal Processing.

[22]  M. Rudelson,et al.  Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[23]  Jan Van der Spiegel,et al.  An Overview of Sigma-Delta Converters: How a 1-bit ADC achieves more than 16-bit resolution , 1996 .

[24]  M. Sánchez,et al.  Impulsive noise measurements and characterization in a UHF digital TV channel , 1999 .

[25]  J. Benedetto,et al.  Second-order Sigma–Delta (ΣΔ) quantization of finite frame expansions , 2006 .

[26]  Emmanuel J. Candès,et al.  Exact Matrix Completion via Convex Optimization , 2009, Found. Comput. Math..

[27]  H. V. Sorensen,et al.  An overview of sigma-delta converters , 1996, IEEE Signal Process. Mag..

[28]  Olivier Rioul,et al.  Real BCH codes as joint source channel codes for satellite images coding , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[29]  Yonina C. Eldar,et al.  Geometrically uniform frames , 2001, IEEE Trans. Inf. Theory.

[30]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[31]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..