Low Complexity Finite-Alphabet based Blind Channel Estimation in OFDM Receivers

Authors: T. Petermann, S. Vogeler, K.-D. Kammeyer
Abstract: In this paper, we present two novel blind channel estimation algorithms for OFDM systems based upon the knowledge that the modulated and transmitted data are confined to a finite alphabet set. The Minimum Impulse Length (MIL) method exploits the correlations between adjacent subcarrier coefficients caused by time limited impulse responses and shows a very good estimation performance. Unfortunately, MIL and most other Finite-Alphabet based blind channel estimation approaches are known to be extremely complex due to an exhaustive search to be performed over a tremendous number of channel coefficient combinations. Our Clustered SubCarriers (CSC) method, however, dramatically reduces this number of coefficient combinations to be checked without a significant deterioration in estimation quality. Using bit error rates (BERs), both algorithm are tested with simulations and compared to other blind and nonblind channel estimators.
Document type: Conference Paper
Publication: Hamburg, Germany, 18. - 19. September 2001
Conference: 6th International OFDM-Workshop (InOWo 01)
Index: 187
InOWo_2001_petermann.pdf389 KBInOWo_2001_petermann.ps.gz207 KB
Last change on 29.04.2008 by P. Kemkes
AIT ieee GOC tzi ith Fachbereich 1
© Department of Communications Engineering - University of BremenImprint / Contact