@inproceedings{ author = {T. Petermann and S. Vogeler and K.-D. Kammeyer}, year = {2001}, month = {Sep}, title = {Low Complexity Finite-Alphabet based Blind Channel Estimation in OFDM Receivers}, URL = {http://ofdm.tu-harburg.de/}, address={Hamburg, Germany}, 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.}, booktitle={6th International OFDM-Workshop (InOWo 01)} }