THE ROOT-MUSIC ALGORITHM FOR DIRECTION FINDING WITH INTERPOLATED ARRAYS
THE ROOT-MUSIC ALGORITHM FOR DIRECTION FINDING WITH INTERPOLATED ARRAYS
复制标题
DOI：
10.1016/0165-1684(93)90048-f
复制
发表时间：
1993-01-01
影响因子：
4.4
通讯作者：
FRIEDLANDER, B
中科院分区：
文献类型：
--
作者：
FRIEDLANDER, B
本文提出了一种测向技术，该技术使用虚拟阵列的输出，该虚拟阵列的输出是使用给定扇区上的线性插值过程从真实阵列计算出来的。虚拟阵列的几何形状由设计者控制。通过使用线性虚拟阵列，即使真实阵列可能具有任意几何形状，也可以应用root-MUSIC算法。与 MUSIC 算法相比，root-MUSIC 算法具有多种优势，包括显着降低计算要求。讨论了与插值阵列设计相关的各种问题。该算法的性能通过大量模拟进行了测试，结果发现其性能与应用于真实阵列的 MUSIC 算法的性能相同。因此，插值过程不会导致任何性能下降。
This paper presents a direction finding technique which uses the outputs of a virtual array, computed from the real array using a linear interpolation procedure over a given sector. The geometry of the virtual array is under the control of the designer. By using a linear virtual array, the root-MUSIC algorithm can be applied, even though the real array may have an arbitrary geometry. The root-MUSIC algorithm offers several advantages over the MUSIC algorithm, including significantly reduced computational requirements. Various issues related to the design of the interpolated array are discussed. The performance of the algorithm was tested by extensive simulations and was found to equal the performance of the MUSIC algorithm applied to the real array. Thus, the interpolation procedure does not introduce any performance degradation.