基于DFT的OFDM信道估计算法改进方案研究  

The Schemes of Improving OFDM ChannelEstimation Algorithm Based on DFT

作　　者：梅飞虎[1] 刘金虎[1] 

机构地区：[1]兰州交通大学电信学院,甘肃兰州730070

出　　处：《信息通信》2011年第3期5-6,共2页Information & Communications

摘　　要：传统的DFT信道估计算法计算复杂度比MMSE算法低,性能比LS算法好,但是它只消除了信道冲击响应中循环前缀长度之外的噪声,而循环前缀长度以内的噪声并没有进行抑制,说明性能存在提高的空间。本文针对此问题,介绍了两种改进方案,并且分析了其可行性。The traditional DFT-based channel estimatior for OFDM systems has lower computational complexity than the MMSE algorithm,and better performance than the LS channel estimators.Howover,the traditional DFT-based channel estimator removes only the noise in the channel impulse response beyond the length of the cyclic prefix（CP）,while the noise within the length of CP is not suppressed,indicating that there is certain space to improve performance.In this paper,introduced two improved schemes to save the problem,and analyzed its feasibility.

关 键 词：正交频分复用 离散傅里叶变换 信道估计 阈值门限 自适应长度 

分 类 号：TN914[电子电信—通信与信息系统]