TY - GEN
T1 - Bayesian DOA estimator based on modified ant colony optimization
AU - Mao, Linlin
AU - Zhang, Qunfei
AU - Huang, Jianguo
AU - Zhai, Yiqun
PY - 2013
Y1 - 2013
N2 - Bayesian maximum a posterior probability density DOA estimator (BM DOA estimator) is known to be the best estimator in DOA estimation for narrow band sources. However, the exponentially increasing computation burden of the BM estimator, due to multidimensional grid search and integrates, makes it very difficult to use the BM estimator in real-time systems. In this paper, a computation feasible ant colony optimization method (ACO) is applied to lighten the computation burden. In addition, in order to overcome the drawbacks of ACO, such as low convergence speed and being easily trapped in local optimum, chaos initialization and local search are integrated into the classic ACO method, to form a novel method named MACO. Based on MACO, a novel BM DOA estimator named BM-MACO with even lower computational complexity is proposed. It is shown via simulations that both methods could keep the good performance of the original BM DOA estimator and reduce the computation evidently. Due to the initialization via chaotic sequences and local search in the optimization procedure, BM-MACO method reduces the sensitivity of parameters, and thus outperforms the BM ACO for its higher precision and less computation.
AB - Bayesian maximum a posterior probability density DOA estimator (BM DOA estimator) is known to be the best estimator in DOA estimation for narrow band sources. However, the exponentially increasing computation burden of the BM estimator, due to multidimensional grid search and integrates, makes it very difficult to use the BM estimator in real-time systems. In this paper, a computation feasible ant colony optimization method (ACO) is applied to lighten the computation burden. In addition, in order to overcome the drawbacks of ACO, such as low convergence speed and being easily trapped in local optimum, chaos initialization and local search are integrated into the classic ACO method, to form a novel method named MACO. Based on MACO, a novel BM DOA estimator named BM-MACO with even lower computational complexity is proposed. It is shown via simulations that both methods could keep the good performance of the original BM DOA estimator and reduce the computation evidently. Due to the initialization via chaotic sequences and local search in the optimization procedure, BM-MACO method reduces the sensitivity of parameters, and thus outperforms the BM ACO for its higher precision and less computation.
KW - Ant colony optimization (ACO)
KW - BM estimator
KW - Computational complexity
UR - http://www.scopus.com/inward/record.url?scp=84892553766&partnerID=8YFLogxK
U2 - 10.1109/ICSPCC.2013.6664144
DO - 10.1109/ICSPCC.2013.6664144
M3 - 会议稿件
AN - SCOPUS:84892553766
SN - 9781479910274
T3 - 2013 IEEE International Conference on Signal Processing, Communications and Computing, ICSPCC 2013
BT - 2013 IEEE International Conference on Signal Processing, Communications and Computing, ICSPCC 2013
T2 - 2013 IEEE International Conference on Signal Processing, Communications and Computing, ICSPCC 2013
Y2 - 5 August 2013 through 8 August 2013
ER -