Paper Info
Title
Blind Polynomial Channel Estimation for OFDM Systems
Abstract
Orthogonal frequency division multiplexing (OFDM) modulation is widely used in communication systems to meet the demand for ever increasing data rates. Characteristics of the transmitted signal can be employed for blind channel identification. In this paper, we propose a blind polynomial channel estimation algorithm using noncircular second-order statistics of the received OFDM signal. A set of polynomial equations are then formulated based on the correlation of the received signal. The solution of these equations provides an estimate of the channel coefficients. Results are presented which show that the proposed algorithm provides performance comparable to the least minimum mean square error (LMMSE) solution with low computational complexity. The performance is near-optimal for large OFDM systems.
Year
DOI
Venue
2008
10.1109/VETECF.2008.154
Calgary, BC
Keywords
Field
DocType
OFDM modulation,channel estimation,computational complexity,least mean squares methods,OFDM modulation,OFDM systems,blind polynomial channel estimation,computational complexity,least minimum mean square error solution,noncircular second-order statistics,orthogonal frequency division multiplexing modulation,polynomial equations
Polynomial,Computer science,Communication channel,Minimum mean square error,Communications system,Electronic engineering,Modulation,Blind equalization,Orthogonal frequency-division multiplexing,Computational complexity theory
Conference
ISSN
ISBN
Citations 
1090-3038 E-ISBN : 978-1-4244-1722-3
978-1-4244-1722-3
0
PageRank 
References 
Authors
0.34
6
3
Name
Order
Citations
PageRank
Zhang, Y.H.100.34
Wu-Sheng Lu229624.90
T. Aaron Gulliver339650.70