Abstract：Weighted Subspace Fitting (WSF) algorithm is a well-known excellent algorithm for DOA estimation with low SNR and few snapshots. However, this algorithm is totally impractical for its prohibitive computational burden incurred by multi-dimensional nonlinear search. In order to solve this problem, Ant Colony Optimization (ACO) is introduced to combine with the WSF algorithm and a new algorithm with lower computational burden called ACO-WSF is proposed. The proposed algorithm exploits Gaussian kernel probability density function in the sampling process. The global maximum of WSF spatial spectrum function can be reached after reasonable iterations. Simulation results illustrate that the proposed algorithm not only provides similar performance as WSF algorithm and better performance than MUSIC algorithm in the situation of low SNR and few snapshots, but also reduces computational complexity significantly.
焦亚萌, 黄建国, 韩晶. 基于连续蚁群优化算法的小快拍加权子空间拟合快速算法[J]. 电子与信息学报, 2011, 33(4): 972-976.
Jiao Ya-Meng, Huang Jian-Guo, Han Jing. Continuous Ant Colony Optimization Based Weighted Subspace Fitting Fast Algorithm for DOA Estimation with Few Snapshots. , 2011, 33(4): 972-976.
2011, Vol. 33 
