摘要
提出了一种基于快速傅里叶变换的边缘扩展信道插值算法(EFFT),该算法对正交频分复用(OFDM)符号有效频带边缘的两端频点作镜像线性扩展,使增加的导频信息能改善有效频带边缘附近的信道估计性能.仿真结果表明,在低阶调制且信噪比(SNR)较低时,EFFT插值算法的性能与维纳滤波信道估计算法相当,且较传统快速傅里叶变换(FFT)插值算法的均方误差(MSE)提升1dB左右.在实现复杂度方面,EFFT算法与FFT算法相当,与维纳滤波算法相比运算量明显降低.EFFT算法不需要对现有技术标准进行改动,也不会降低系统的传输效率.
An edged extend fast fourier transform （EFFT） channel interpolation algorithm is proposed. The presented EFFT algorithm can extend linear mirror pilots nearby the edge of the effective frequency band of each orthogonal frequency division multiplexing （OFDM） symbol and the performance of channel estimation is enhanced by the added mirror pilots. The simulation results show that the performance of the EFFT channel interpolation algorithm is similar to that of Wiener filter channel estimation algorithm under the condition of low signal noise ratio （SNR） and modulation mode, while there is about ldB improvement when compared to traditional FFT channel interpolation algorithm. The complexity of the EFFT channel interpolation is similar tothat of traditional FFT channel interpolation algorithm and there is a significant reduction of calculations when compared to Wiener filter channel estimation algorithm. Moreover, the EFFT channel interpolation is suitable for the existing standards and has no influence on the transmission efficiencies.
出处
《同济大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2010年第4期589-592,共4页
Journal of Tongji University:Natural Science
基金
德国罗德与施瓦茨公司资助项目
关键词
正交频分复用(OFDM)
信道插值
快速傅立叶变换
边缘扩展
orthogonal frequency division multiplexing （OFDM）
channel interpolation
fast Fourier transform
edged extension
