Please use this identifier to cite or link to this item: https://dspace.iiti.ac.in/handle/123456789/5918
Title: Sparse Channel Estimation for Interference Limited OFDM Systems and Its Convergence Analysis
Authors: Bishnu, Abhijeet
Bhatia, Vimal
Keywords: Frequency estimation;Gaussian distribution;Gaussian noise (electronic);Geometry;Iterative methods;Maximum likelihood;Maximum likelihood estimation;Mean square error;Measurements;Orthogonal frequency division multiplexing;Stochastic systems;Wave interference;White noise;Wireless telecommunication systems;Algorithm design and analysis;Convergence;Convergence analysis;Gaussian mixture noise;IEEE 802.22;Matching pursuit algorithms;Natural gradient;Non-parametric;Riemannian geometry;Sparse channel estimations;Channel estimation
Issue Date: 2017
Publisher: Institute of Electrical and Electronics Engineers Inc.
Citation: Bishnu, A., & Bhatia, V. (2017). Sparse channel estimation for interference limited OFDM systems and its convergence analysis. IEEE Access, 5, 17781-17794. doi:10.1109/ACCESS.2017.2748144
Abstract: Wireless communication channels are highly prone to interference in addition to the presence of additive white Gaussian noise (AWGN). Stochastic gradient (SG)-based non-parametric maximum likelihood (NPML) estimator, gives better channel estimates in the presence of Gaussian mixture (AWGN plus interference) noise processes, for subsequent use by the channel equalizer. However, for sparse channels, the SG-NPML-based channel estimator requires large iterations to converge. In this paper, we propose a natural gradient (NG)-based channel estimator for sparse channel estimation in the presence of high interference. We propose a generalized p th order warping transformation on channel coefficients space and then calculate the Riemannian metric tensor, thereby resulting in faster convergence in interference limited channels. The proposed algorithm is applied for IEEE 802.22 (based on orthogonal frequency division multiplexing) channel estimation in the presence of interference. Extensive simulations and experimental results show that the proposed NG-based algorithm converges faster than SG-NPML for the same mean squared error (MSE) floor with similar computational complexity per iteration as an SG-NPML algorithm. We also present convergence analysis of proposed NG-NPML algorithm in the presence of Gaussian mixture noise and derive an analytical expression for the steady-state MSE. © 2013 IEEE.
URI: https://doi.org/10.1109/ACCESS.2017.2748144
https://dspace.iiti.ac.in/handle/123456789/5918
ISSN: 2169-3536
Type of Material: Journal Article
Appears in Collections:Department of Electrical Engineering

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Altmetric Badge: