Low complexity and high accurate estimation scheme for doubly selective fading channels with square root Kalman filtering

摘要

In this paper, with the square root Kalman filter (SR-KF), a low complexity estimation algorithm for doubly selective fading channels is proposed. Based on the complex exponential basis expansion models (CE-BEMs), the proposed scheme can achieve nearly the same mean-square error of estimated channel and bit error rate (BER) performance as traditional recursive least square (RLS) scheme regardless of the autoregressive process order of the variation of channel coefficients. Furthermore, complexity analysis is presented and it illustrates that the calculation complexity is significantly reduced. Finally, the validity of the proposed SR-KF scheme is verified by simulation results.