Phase-Aware Code-Aided EM Algorithm for Blind Channel Estimation in PSK-Modulated OFDM
Chin-Hung Chen, Ivana Nikoloska, Wim van Houtum, Yan Wu, Alex Alvarado
TL;DR
This work tackles the challenge of fully blind phase ambiguity in EM-based channel estimation for PSK-modulated OFDM. It introduces a phase-aware, code-aided EM that leverages decoder extrinsic information and PSK symmetry to generate and select among $C$ phase candidates via model evidence, resolving phase ambiguity during initialization. The OFDM structure allows per-subcarrier EM updates, yielding low computational complexity and negligible extra cost in turbo iterations, while a phase-detection step robustly reduces convergence to suboptimal maxima. Simulation with $M=256$, $N=10$, and a rate-$1/2$ convolutional code demonstrates a dramatic reduction in failure rate from roughly $80\%$ to nearly $0\%$ for $\text{SNR} \ge 6$ dB, validating the approach for frequency-selective channels and turbo equalization.
Abstract
This paper presents a fully blind phase-aware expectation-maximization (EM) algorithm for OFDM systems with the phase-shift keying (PSK) modulation. We address the well-known local maximum problem of the EM algorithm for blind channel estimation. This is primarily caused by the unknown phase ambiguity in the channel estimates, which conventional blind EM estimators cannot resolve. To overcome this limitation, we propose to exploit the extrinsic information from the decoder as model evidence metrics. A finite set of candidate models is generated based on the inherent symmetries of PSK modulation, and the decoder selects the most likely candidate model. Simulation results demonstrate that, when combined with a simple convolutional code, the phase-aware EM algorithm reliably resolves phase ambiguity during the initialization stage and reduces the local convergence rate from 80% to nearly 0% in frequency-selective channels with a constant phase ambiguity. The algorithm is invoked only once after the EM initialization stage, resulting in negligible additional complexity during subsequent turbo iterations.
