Loading [MathJax]/jax/output/HTML-CSS/autoload/mtable.js
Impulse noise cancellation in OFDM: an application of compressed sensing | IEEE Conference Publication | IEEE Xplore

Impulse noise cancellation in OFDM: an application of compressed sensing


Abstract:

We use recently developed convex programming techniques to reconstruct arbitrary sparse signals observed through projections onto a small-dimensional space in background ...Show More

Abstract:

We use recently developed convex programming techniques to reconstruct arbitrary sparse signals observed through projections onto a small-dimensional space in background noise in order to estimate and remove impulsive noise in an OFDM system. We develop deterministic construction of projection matrices that provably guarantee reconstruction with high probability. Finally, we compare the achievable rate using our novel method with some simple capacity lower and upper bounds and with the recently obtained capacity of the Gaussian erasure channel. For practical impulse probability the proposed scheme appears to be competitive. This scheme may find some application in DSL and powerline communications, where transmission is typically affected by intersymbol interference, Gaussian noise and impulsive noise.
Date of Conference: 06-11 July 2008
Date Added to IEEE Xplore: 08 August 2008
ISBN Information:

ISSN Information:

Conference Location: Toronto, ON, Canada
References is not available for this document.

I. Introduction and problem definition

Systems such as power line communications [2] and DSL must cope with linear distortion (ISI), additive white Gaussian noise (AWGN) and impulse noise. For example, ADSL/VDSL over short distances operates at extremely high SNR with very high spectral efficiencies (QAM constellations of up to 215 points can be used) and their main limiting factor is impulse noise and cross-talk, rather than AWGN. In this work we focus on a scheme for impulse noise estimation and cancellation at the receiver. The relevant time-domain complex baseband equivalent channel is given by y_{k}=\sum_{\ell=0}^{L}h_{\ell}x_{k-\ell}+z_{k}+e_{k} \eqno{\hbox{(1)}}

and denote the channel input and output, is the impulse response of the channel, is AWGN and is an impulsive noise process. Dealing with the Gaussian-linear part of the channel is a very well-known problem. Channel capacity (in nat/channel use) is given by C_{0}=\int_{-1/2}^{1/2}\log \bigg(1+{1\over N_{0}}\vert H(f)\vert ^{2}S_{x}(f) \bigg)df\eqno{\hbox{(2)}}
where is the discrete-time Fourier transform of and is the waterfilling power spectral density [1], with the normalization . OFDM yields a well-known and widely adopted practical solution directly inspired by (2).

Select All
1.
T.M. Cover and J.A. Thomas, Elements of Information Theory, Wiley, New York, 1991.
2.
HomePlug Powerline Alliance: Specifications. http://www.homeplug.com/
3.
J. Rinne and A. Hazmi, "Impulse Burst Position Detection and Channel Estimation Schemes for OFDM Systems," IEEE Trans. on Consumer Electronics, Vol. 49, No. 3, 2003.
4.
H. Matsuo, D. Umehara, M. Kawai and Y. Morihim, "An iterative detection scheme for OFDM over impulsive noise channels," Int. Symp. on Powerline Communications, ISPLC 2002, Athens, March 2002.
5.
M. Gosh, "Analysis of the effect of impulsive noise on multicarrier and single carrier QAM systems," IEEE Trans. Comm., Vol. 44, Feb. 1996.
6.
A. Tulino. S. Verdu, G. Caire and S. Shamai, "The Gaussian Erasure Channel," to appear on IEEE Trans. on Inform. Theory, 2008.
7.
A. Tulino. S. Verdu, G. Caire and S. Shamai, "The Gaussian Erasure Channel," IEEE Int. Symp. on Inform. Theory, ISIT 2007 Nice, France, June 24-29, 2007.
8.
A. Lapidoth, "Nearest Neighbor Decoding for Additive Non-Gaussian Channels," IEEE Trans. Inform. Theory, Vol. 42, No. 5, pp. 1520-1529, Sept. 1996.
9.
G. Caire and T. Al Naffouri, "A compressed sensing approach to decoding in impulsive noise," in preparation.
10.
F. Abdelkefi, P. Duhamel, and F. Alberge. "Impulsive Noise Cancellation in Multicarrier Transmission," IEEE Trans. on Comm. vol. 53, no. 1, Jan. 2005.
11.
F. Abdelkefi, P. Duhamel, and F. Alberge, "A Necessary Condition on the Location of Pilot Tones for Maximizing the Correction Capacity in OFDM Systems," IEEE Trans. on Comm. vol. 55, no. 2, Feb. 2007.
12.
E. Candes and M. Wakin, "An introduction to compressive sampling," IEEE Sig. Proc. Mag., vol. 25, no. 2. March 2008.
13.
M. Sousa Lobo. L. Vandenberghe S. Boyd and H. Lebret, "Applications of Second Order Cone Programming," unpublished http://www.stanford.edu/ boyd/papers/socp.html
14.
E. Candes, J. Romberg and T. Tao. "Stable signal recoverly from incomplete and inaccurate measurements," Comm. Pure Appl. Math, vol. 59, no. 8, pp. 1207-1223, Aug. 2006.
15.
E. Candes and T. Tao, "The Dantzig selector: statistical estimation when p is much larger than n," submitted for publication.
16.
J. Tropp, "Just relax: Convex programming methods for identifying sparse signals in noise," IEEE Trans. on Inform. Theory, vol. 52, no. 3, p. 1030-1051, 2006.
17.
E. J. Candes and P. Randall. Highly robust error correction by convex programming. Submitted for publication.
18.
E. J. Candes and T. Tao. "Near-optimal signal recovery from random projections: universal encoding strategies?" IEEE Trans. Inform. Theory, vol. 52, pp. 5406-5425, Dec. 2006.
19.
P. Xia, S. Zhou, and G. B. Giannakis, "Achieving the Welch Bound with Difference Sets," IEEE Trans. on Inform. Theory, vol. 51, no. 5, +. 1900-1907, May 2005.

Contact IEEE to Subscribe

References

References is not available for this document.