摘要
To remove the scalar ambiguity in conventional blind channel estimation algorithms, totally blind channel estimation （TBCE） is proposed by using multiple constellations. To estimate the unknown scalar, its phase is decomposed into a fractional phase and an integer phase. However, the maximum-likelihood （ML） algorithm for the fractional phase does not have closed-form solutions and suffers from high computational complexity. By ex- ploring the structures of widely used constellations, this paper proposes a low-complexity fractional phase estimation algorithm which requires no exhaustive search. Analytical expressions of the asymptotic mean squared error （MSE） are also derived. The theo- retical analysis and simulation results indicate that the proposed fractional phase estimation algorithm exhibits almost the same performance as the ML algorithm but with significantly reduced computational burden.
To remove the scalar ambiguity in conventional blind channel estimation algorithms, totally blind channel estimation （TBCE） is proposed by using multiple constellations. To estimate the unknown scalar, its phase is decomposed into a fractional phase and an integer phase. However, the maximum-likelihood （ML） algorithm for the fractional phase does not have closed-form solutions and suffers from high computational complexity. By ex- ploring the structures of widely used constellations, this paper proposes a low-complexity fractional phase estimation algorithm which requires no exhaustive search. Analytical expressions of the asymptotic mean squared error （MSE） are also derived. The theo- retical analysis and simulation results indicate that the proposed fractional phase estimation algorithm exhibits almost the same performance as the ML algorithm but with significantly reduced computational burden.
基金
supported by the National Science and Technology Major Project of China(2013ZX03003006-003)
