New normalized constant modulus algorithms with relaxation

Published versio

Low Complexity Blind Equalization for OFDM Systems with General Constellations

This paper proposes a low-complexity algorithm for blind equalization of data in OFDM-based wireless systems with general constellations. The proposed algorithm is able to recover data even when the channel changes on a symbol-by-symbol basis, making it suitable for fast fading channels. The proposed algorithm does not require any statistical information of the channel and thus does not suffer from latency normally associated with blind methods. We also demonstrate how to reduce the complexity of the algorithm, which becomes especially low at high SNR. Specifically, we show that in the high SNR regime, the number of operations is of the order O(LN), where L is the cyclic prefix length and N is the total number of subcarriers. Simulation results confirm the favorable performance of our algorithm

Blind joint maximum likelihood channel estimation and data detection for single-input multiple-output systems

A blind adaptive scheme is proposed for joint maximum likelihood (ML) channel estimation and data detection of single-input multiple-output (SIMO) systems. The joint ML optimization of the channel and data estimation is decomposed into an iterative optimization loop. An efficient global optimization algorithm termed as the repeated weighted boosting aided search is employed first to identify the unknown SIMO channel model, and then the Viterbi algorithm is used for the maximum likelihood sequence estimation of the unknown data sequence. A simulation example is used for demonstrating the efficiency of this joint ML optimization scheme designed for blind adaptive SIMO systems