基于混沌尋優(yōu)的DOA估計(jì)
Direction of Arrival Estimation Based on Chaotic Optimization Algorithm
-
摘要: 提出用混沌優(yōu)化的方法來實(shí)現(xiàn)陣列信號(hào)波達(dá)方向(DOA)的極大似然估計(jì)?；诨煦邕\(yùn)動(dòng)的遍歷性、內(nèi)在的隨機(jī)性、規(guī)律性等特點(diǎn)的混沌優(yōu)化算法是一種有效的全局優(yōu)化算法,其計(jì)算復(fù)雜度較低。仿真結(jié)果表明該文提出的方法在獲得與AP算法相當(dāng)測(cè)向精度和測(cè)向分辨率的情況下有更低的計(jì)算量;在相干信號(hào)的情況下,其性能比AP算法有較大的提高;同時(shí)其基于軌道搜索的結(jié)構(gòu)易于并行實(shí)現(xiàn),以進(jìn)一步滿足實(shí)時(shí)性的要求。Abstract: In this paper, a chaotic optimization method is presented for computing the Maximum Likelihood Estimation (MLE) of Direction of Arrivals (DOA) in sensor array processing. Based on the properties of ergodicity, stochastic property and regularity of chaos, the chaos optimization method can get global solution with low computational load. The simulation results show that this method is feasible and effective. Especially when the impinging signals are coherent, this method is much superior to AP.
-
Cadzow J A. A high resolution direction-of-arrival algorithm for narrow-band coherent and incoherent sources[J].IEEE Trans. on ASSP.1988, 36(7):965-[2]Ziskind I, Wax M. Maximum likelihood localization of multiple sources by alternating projection[J].IEEE Trans. on ASSP.1988,36(10):1553-[3]Li B, Jiang W. Optimizing complex functions by chaos search[J].Cybernetics and Systems.1998, 29(4):409-[4]郝柏林.從拋物線談起--混沌動(dòng)力學(xué)引論.上海:上?？萍冀逃霭嫔?1993:第1章.[5]Geisel T, Fairen V. Statistical properties of chaos in Chebyshev maps. Phys. Lett., 1984, 105A(6): 263 - 266.[6]Kohda T, Tsuneda A. Pseudonoise sequences by chaotic nonlinear maps and their correlation properties. IEICE Trans. Commun.1993, E76-B(8): 855 - 862.[7]Li B, Jiang W. A novel stochastic optimization algorithm[J].IEEE Trans. on Systems, Man, and Cybernetics-part B: Cybernetics.2000, 30(1):193- -
計(jì)量
- 文章訪問數(shù): 2335
- HTML全文瀏覽量: 122
- PDF下載量: 608
- 被引次數(shù): 0
下載:
