基于Hankel矩阵分解的互素阵列高分辨目标定向  

High Resolution Target Direction Finding Based on Hankel Matrix Decomposition for Coprime Arrays

作　　者：谭伟杰[1] 冯西安[1] 张杨梅[1] 

机构地区：[1]西北工业大学航海学院,西安710072

出　　处：《西南大学学报（自然科学版）》2016年第7期191-198,共8页Journal of Southwest University(Natural Science Edition)

基　　金：国家自然科学基金资助项目(61271414)

摘　　要：互素阵列能有效扩展阵列虚拟孔径,但预处理后的阵列模型为一确定噪声下的单快拍相干源目标方位估计问题.针对该问题,提出了一种基于Hankel矩阵分解的方法,采用多项式求根的方法来进行高分辨定向.首先将阵列采样协方差数据进行Khatri-Rao(KR)积预处理,进行相关数学变换后,用去冗余后的数据构建Hankel矩阵,然后采用奇异值分解,转换为多项式求根,最后找出感兴趣的目标位置,并通过最小二乘法来求解出目标幅度.仿真结果表明了该方法的有效性和优越性.Co-prime array has large virtual array aperture by Khatri-Rao product processing,but the array model after processing is equivalent to coherent sources estimation under determined noise on a single snapshot.In this paper,a high resolution direction finding method based on decomposition of Hankel matrices and polynomial rooting is proposed.First,the covariance of the array data is preprocessed by KR product,and repeated rows are removed through mathematical transformation.The obtained data is used to build a Hankel matrix.Then,the problem is transformed into the determination of polynomial roots to find the interested target location through singular value decomposition on the Hankel matrix.Finally,the amplitude of the target echo is solved by using the least squares method.To some extent,the proposed method can overcome grid mismatch,which is a problem in the traditional MUSIC method.Compared with the smoothing technology,this method reduces the computational complexity and has good resolution even for a closely spaced target.Computer simulations verify the effectiveness and superiority of the new algorithm.

关 键 词：Hankel矩阵分解 互素阵列 网格失配 高分辨目标定向 近空间目标 

分 类 号：TN911.7[电子电信—通信与信息系统]