Journal of South China University of Technology (Natural Science Edition) ›› 2014, Vol. 42 ›› Issue (9): 76-81.doi: 10.3969/j.issn.1000-565X.2014.09.014

• Electronics, Communication & Automation Technology • Previous Articles     Next Articles

A Low Computational Complexity Channel Estimation Algorithm for Time- Variant Channels

Huang Min Li Bing- bing Sun Ru- qin   

  1. School of Telecommunications Engineering,Xidian University,Xi'an 710071,Shaanxi,China
  • Received:2014-03-28 Revised:2014-05-13 Online:2014-09-25 Published:2014-08-01
  • Contact: 黄敏(1985-),男,博士生,主要从事无线通信、信道估计及信号检测研究. E-mail:mhuang@mail.xidian.edu.cn
  • About author:黄敏(1985-),男,博士生,主要从事无线通信、信道估计及信号检测研究.
  • Supported by:

    国家自然科学基金资助项目(61271299);高等学校学科创新引智计划项目(B08038)

Abstract:

For the orthogonal frequency- division multiplexing (OFDM) systems in time- variant channels,traditionalestimation methods are of poor estimation performance and high computational complexity.In order to solve theseproblems,we propose a channel estimation method named as DD- LMMSE (Dual- Diagonal Linear Minimum MeanSquare Error).In this method,a system model is constructed on the basis of expansion model (BEM) and the esti-mated coefficients of BEM are obtained by performing the diagonal LMMSE twice,and thus achieving the channelimpulse response (CIR) in time domain.Simulation results show that,whether in slowly time- variant or rapidlytime- variant channels,the proposed method has better performance and lower computational complexity.

Key words: orthogonal frequency- division multiplexing, time- variant channels, estimation, basis expansion model, dual- diagonal LMMSE