Proc. Asilomar Conf. on Signals, Systems and Computers, Nov. 6-9, 2011, Pacific Grove, CA USA.

Low Complexity EM-based Decoding for OFDM Systems with Impulsive Noise

Marcel Nassar and Brian L. Evans

Department of Electrical and Computer Engineering, Engineering Science Building, The University of Texas at Austin, Austin, TX 78712 USA
nassar.marcel@mail.utexas.edu - bevans@ece.utexas.edu

Paper Draft - Slides

Interference Modeling and Mitigation Toolbox

Interference Mitigation Research at UT Austin

Abstract

Modern OFDM systems such as cellular LTE and powerline communications experience additive impulsive noise emitted from their environment. OFDM modulation has been shown to provide resilience to impulsive noise due to its code diversity. However, typical OFDM receivers designed under the Gaussian noise assumption will lead to suboptimal performance due to the dependence in noise statistics across subcarriers resulting from the FFT operation. As a result, optimal detection of OFDM symbols becomes prohibitive due to its exponential complexity. We consider the design of a practical class of OFDM receivers that are constrained to perform independent detection on each subcarrier. In this paper, we propose an EM based low-complexity iterative decoding algorithm for OFDM systems in impulsive noise environments that preserves the independent decoding across subcarriers. Then we validate its performance under typical impulsive noise conditions based on noise traces collected from wireless and powerline platforms. Our proposed method achieves a gain between 2-7dB over the conventional OFDM receiver depending on the SNR range.


COPYRIGHT NOTICE: All the documents on this server have been submitted by their authors to scholarly journals or conferences as indicated, for the purpose of non-commercial dissemination of scientific work. The manuscripts are put on-line to facilitate this purpose. These manuscripts are copyrighted by the authors or the journals in which they were published. You may copy a manuscript for scholarly, non-commercial purposes, such as research or instruction, provided that you agree to respect these copyrights.


Last Updated 11/12/11.