Capability of Array Processing Algorithms to Estimate Source Bearings
暂无分享,去创建一个
The Capabilities of classical, minimum energy, and linear predictive array processing algorithms to estimate the bearings of two equal-energy sources is examined. Signal coherence is shown to affect adversely the resolution and detection capabilities, as well as the bias characteristics, of all three algorithms. For linear arrays of equally spaced sensors, the superior resolution capability of the linear predic- tive algorithm is demonstrated. The value of utilizing prediction ele- ments in the center of the array to resolve very closely spaced source bearings is demonstrated. However, the linear predictive algorithm is least capable of detecting highly coherent sources. A tradeoff is estab- lished between resolving capability and sensitivity to finite averaging. Conditions are established which indicate which algorithm is best suited to anticipated levels of signal coherence and averaging. The estimates of source bearing produced by each algorithm are shown to be asymp- totically biased. The bias produced by the classical beamformer is most severe, while the minimum energy beamformer produces the least bias.
[1] C. Seligson. Comments on "High-resolution frequency-wavenumber spectrum analysis" , 1970 .
[2] D.H. Johnson,et al. The application of spectral estimation methods to bearing estimation problems , 1982, Proceedings of the IEEE.