摘要
求根MUSIC算法具有比基本MUSIC算法更好的性能。但其实现难度极大而基本MUSIC算法的计算量很大,时延较长。酉变换步进搜索求根MUSIC算法依据求根MUSIC算法的原理采用步进搜索的方法,将基本MUSIC算法的复对称矩阵分解转化为实对称矩阵分解,并将复数域的矩阵计算转化为复数域的只有乘法和加法的多项式运算,从而大大降低算法的计算量和实现难度。在matlab上的仿真也表明:酉变换步进搜索求根MUSIC算法是一种实现容易,计算量较小,效果较好的一种DOA估计方法。
The ROOT - MUSIC algorithm has better performance than the basic MUSIC. But its realization is very difficult in reality. The basic MUSIC algorithm has a great deal of calculations and its time delay is also much. Based on the principle of the ROOT - MUSIC algorithm, the unitary transformation ROOT - MUSIC algorithm of searching step by step adopts the way of searching step by step in the region , and the symmetric complex - valued matrix in basic music algorithm is converted into decomposition of the real symmetric matrix in the unitary transformation ROOT - MUSIC algorithm searching step by step operations and complex - valued matrix operation is converted into real -valued polynomial operation including multiplication and addition, thus it reduces the calculation burden and the implementation difficulty. The simulation on matlab indicates： the unitary transformation ROOT - MUSIC algorithm of searching step by step is a DOA way which is easier to be realized, the calculating amount of which is relatively small, and its result is good.
出处
《计算机仿真》
CSCD
北大核心
2009年第1期327-330,共4页
Computer Simulation
