摘要
针对二维波达方向估计时MUSIC谱的快速计算问题,研究了均匀圆阵变换到虚拟线阵的MUSIC算法(UCA-ULA-MUSIC)、流形分离MUSIC算法(MS-MUSIC)、傅立叶域线性求根MUSIC算法(FD-Line-Search-MUSIC)、基于FFT的2n元均匀圆阵MUSIC算法(2n-UCA-FFT-MUSIC)与基于FFT的任意圆阵MUSIC算法(ACAFFT-MUSIC)。对各种算法快速计算二维MUSIC谱的实现步骤进行了总结。在此基础上,给出了各算法计算二维MUSIC谱的计算复杂度表达式,并以传统方法为参考,对比了各种快速算法相对于传统方法的计算复杂度比值;同时,针对不同的阵列形式,对适用的快速算法的测向性能进行了仿真对比。根据分析和对比的结果,指出MSMUSIC算法与ACA-FFT-MUSIC算法具有更高的工程应用价值,由具体的情况单独或分频段联合使用MS-MUSIC算法与ACA-FFT-MUSIC算法,可以使测向系统较好的兼顾测向性能与时效性。
According to the fast computation problem of MUSIC spectrum in two dimensional direction of arrival estimation, the fast algorithms by manifold transformation or spectrum function transformation are studied. The implementation steps of computation method for two dimensional MUSIC spectrum by these algorithms are summarized. Furthermore, expressions for computational complexity of discussed algorithms in computing two dimensional MUSIC spectrum are presented. With refer- ence to the conventional method, the ratio of computational complexity of discussed algorithms is compared. Meanwhile, for different circular arrays, the direction finding performance of applicable algorithms is compared by simulation. It is proved that the MUSIC algorithm based on Manifold Separation （MS-MUSIC） and Fast Fourier Transformation （FFT） which suits to arbitrary circular array （ACA-FFT-MUSIC） have higher engineering value according to the results of analysis and com- parison. The performance and timeliness of direction finding system can be ensured by individual use of each method in whole frequency or combined use of the two in different frequency band based on different conditions.
出处
《信号处理》
CSCD
北大核心
2015年第7期849-859,共11页
Journal of Signal Processing
关键词
波达方向估计
二维MUSIC谱
圆阵
计算量
direction of arrival estimation
two dimensional MUSIC spectrum
circular array
computational complexity
