一种改进的TLS_ESPRIT的算法  

A improved TLS_ESPRIT algorithm

作　　者：唐涛[1] 栾鹏程[1] 吴瑛[1] 

机构地区：[1]郑州信息工程大学信息工程学院,河南450002

出　　处：《微计算机信息》2006年第02X期208-210,共3页Control & Automation

基　　金：863资金支持;基金号:2003AA123340

摘　　要：本文简要的介绍了常规的TLS_ESPRIT算法,在此基础上通过对Φ矩阵的重构,提出了一种共轭ESPRIT(C_SPRIT)算法。与TLS_ESPRIT算法相比,此新算法能提供更高的DOA估计精度,且所需更少的阵元数。由于C_SPRIT算法和TLS_ESPRIT算法都利用了相同的几何阵型和相同的子阵列的处理思想,所以新算法的复杂度没有提高。新算法与TLS_ESPRIT算法主要的区别为:(1)当阵元数为M时,TLS_ESPRIT算法分解的两个子阵列的阵元数为M-1,而C_SPRIT算法分解的两个子阵列的阵元数可以达到M;(2)C_SPRIT算法利用了旋转矩阵的共轭矩阵Φ*,而TLS_ESPRIT算法只利用了矩阵Φ,因此我门称此改进的算法为C_SPRIT。通过计算机仿真,可以清楚的发现C_SPRIT算法能提供比TLS_ESPRIT更高的DOA测向精度。This article briefly introduces the traditional TLS_ESPRIT algorithm. By use of the re-formation for the matrix Ф, this aricle put forward a new conjugate ESPRIT（C_SPRIT） algorithm. The proposed algorithm can provide a more precise DOA estimation and need less array number. The complexity is the same array geometry and sub-array processing as TLS_ESPRIT does. The main differences between the proposed and ESPRIT algorithms are as follows： （1） the number of the overlapping array dements between two sub-arrays is equal to M in the proposed algorithm while the maximum number of overlapping dements in ESPRIT is M-1, where M denotes the total number of array dements, and （2） the proposed algorithm employs the conjugate of rotation matrix while TLS_ESPRIT uses for the second sub-array geometry. Through simulation results, we will show that our C_SPRIT can perform with a higher resolution than TLS ESPRIT algorithm .

关 键 词：阵列信号处理 旋转矩阵 低信嗓比 波达角估计 旋转子空间不变技术 

分 类 号：TP334[自动化与计算机技术—计算机系统结构]