A Low Complexity Blind Data Detector for OFDM Systems

A low-complexity blind data detector is proposed in this paper for orthogonal frequency division multiplexing (OFDM) systems, where the generalized likelihood ratio test (GLRT) approach is adopted. Traditional GLRT data detector (GDD) can be viewed as a combinatorial optimization problem, which suffers from prohibitively high computational complexity. The proposed scheme reduces the search space by exploiting the phase ambiguity. In addition, the computational complexity is further reduced by properly decoupling the GDD into several sub-group GDDs (SGDD). Mathematical analysis is adopted to evaluate the complexity of the proposed scheme. Simulation experiments are conducted to verify the system performance.