首页 | 本学科首页   官方微博 | 高级检索  
     

OFDM系统中基于PM的时延估计算法
引用本文:巴 斌,郑娜娥,胡捍英,任修坤.OFDM系统中基于PM的时延估计算法[J].太赫兹科学与电子信息学报,2016,14(3):355-360.
作者姓名:巴 斌  郑娜娥  胡捍英  任修坤
作者单位:Institute of Navigation and Aerospace Engineering,Information Engineering University,Zhengzhou Henan 450001,China,Institute of Navigation and Aerospace Engineering,Information Engineering University,Zhengzhou Henan 450001,China,Institute of Navigation and Aerospace Engineering,Information Engineering University,Zhengzhou Henan 450001,China and Institute of Navigation and Aerospace Engineering,Information Engineering University,Zhengzhou Henan 450001,China
基金项目:国家高技术研究发展计划基金资助项目(2012AA01A502);国家高技术研究发展计划基金资助项目(2012AA01A505)
摘    要:在正交频分复用(OFDM)系统的超分辨时延估计中,针对多重信号分类(MUSIC)算法的特征分解计算复杂度较高的问题,给出一种基于传播算子(PM)的时延估计算法。对OFDM系统进行信道估计,根据信道估计结果计算协方差矩阵,并利用协方差矩阵计算PM,然后根据PM构造出噪声子空间并将其标准正交化,最后利用伪谱函数进行时延估计。仿真结果和复杂度分析表明,在复杂度大幅度下降的条件下,所提算法与MUSIC性能相当,且逼近克拉美罗界。

关 键 词:正交频分复用  传播算子  多重信号分类  时延估计
收稿时间:2014/12/13 0:00:00
修稿时间:2/9/2015 12:00:00 AM

Time delay estimation based on PM in OFDM system
Abstract:In Orthogonal Frequency Division Multiplexing(OFDM) system, super resolution time delay estimation shows important application value. The Multiple Signal Classification(MUSIC) algorithm requires eigenvalue decomposition whose computational complexity is very high. A new time delay estimation based on Propagator Method(PM) is proposed for solving the problem. Firstly, the proposed algorithm performs the channel frequency response estimation in OFDM system. Moreover, the channel frequency response estimation can be used for estimating the covariance matrix which can calculate the propagator. The propagator can be used to construct the noise subspace without eigenvalue decomposition, then the noise subspace is orthonormalized for improving the performance. Finally, the pseudo spectral function is constructed for estimating the time delay. Simulation results and the analysis of computational complexity show that the proposed algorithm has the similar performance as the MUSIC algorithm and approaches the Cramer-Rao Bound(CRB) under the condition of the significant decline of the computational complexity.
Keywords:
点击此处可从《太赫兹科学与电子信息学报》浏览原始摘要信息
点击此处可从《太赫兹科学与电子信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号