太赫兹科学与电子信息学报2016，Vol.14Issue(4)：630-635,6.DOI:10.11805/TKYDA201604.0630
基于逼近噪声子空间的求根时延估计算法
Rooting time delay estimation based on noise subspace approximation
摘要
Abstract
The Multiple Signal Classification(MUSIC) algorithm requires multipath number estimation. The eigenvalue decomposition and spectral peak searching feature high computational complexity. To address the issues, a new root time delay estimation based on noise subspace approximation is proposed. The proposed algorithm uses the high power inverse matrix to approach the product of both noise subspace and its conjugate transpose. The polynomial is constructed for estimating time delay. The polynomial rooting avoids the spectral peak searching and reduces the computational complexity. Simulation results show that the proposed algorithm has the similar performance as the MUSIC algorithm and approaches the Cramer-Rao Bound(CRB) without multipath number estimation; and the computational complexity of the proposed algorithm is lower than that of the MUSIC algorithm.关键词
多重信号分类/时延估计/多项式求根/克拉美罗界Key words
Multiple Signal Classification/time delay estimation/polynomial rooting/Cramer-Rao Bound分类
信息技术与安全科学引用本文复制引用
巴斌,胡捍英,郑娜娥,任修坤..基于逼近噪声子空间的求根时延估计算法[J].太赫兹科学与电子信息学报,2016,14(4):630-635,6.基金项目
国家高技术研究发展计划资助项目(2012AA01A502；2012AA01A505) （2012AA01A502；2012AA01A505）
