收稿日期: 2014-03-28
修回日期: 2014-05-13
网络出版日期: 2014-08-01
基金资助
国家自然科学基金资助项目(61271299);高等学校学科创新引智计划项目(B08038)
A Low Computational Complexity Channel Estimation Algorithm for Time- Variant Channels
Received date: 2014-03-28
Revised date: 2014-05-13
Online published: 2014-08-01
Supported by
国家自然科学基金资助项目(61271299);高等学校学科创新引智计划项目(B08038)
关键词: 正交频分复用; 时变信道; 估计; 基扩展模型; 双对角线性最小均方误差
黄敏 李兵兵 孙茹钦 . 在时变信道下一种低计算复杂度的信道估计算法[J]. 华南理工大学学报(自然科学版), 2014 , 42(9) : 76 -81 . DOI: 10.3969/j.issn.1000-565X.2014.09.014
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.
/
| 〈 |
|
〉 |