Efficient computational algorithms of maximum likelihood estimator for localizing multiple radiating sources다수의 방사성 신호원의 위치 추정을 위한 MaximumLikelihood 추정기의 효율적인 계산 알고리듬

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 448
  • Download : 0
The main objective of this dissertation work is to reduce the computational complexity of the AP algorithm which is an effective algorithm for the maximum likelihood localization of radiating sources by a passive array of sensors. Since the AP algorithm is iterative in nature, there ar two ways for achieving this purpose. One is to reduce the number of iterations to convergence. The other is to reduce the computational complexity per iteration for the main iteration process and the computational complexity per stop for the initialization procedures. First, we investigate an improved initialization procedure that reduces the number of iterations to convergence and also guarantees a global convergence. For this purpose, we first develop the sequential estimation approach that lowers the detection threshold of the MUSIC algorithm noticeably through the effective removal of spatial interferences among sources. Computer simulation is done to demonstrate the detection and estimation performance of the proposed MUSIC algorithm, and also to compare the results with those of the conventional algorithm. By modifying the algorithm slightly, we also derive the improved initialization procedure that reduces the number of iterations to convergence and can also guarantees a global convergence. Computer simulation results are included to compare the AP algorithm using the improved initialization procedure with the original AP algorithm in the estimation performance and in the convergence behavior. Further, we develop a recursive computational procedure (RCP) for the sequential MUSIC algorithm and for improved initialization. The procedure reduces significantly the computational complexity per step of the proposed algorithm and the proposed initialization procedure, by transforming the computation of Hermitian forms into that of inner products of vectors only. Second, we study three different algorithms that can reduce significantly the computational complexity per iteration of...
Advisors
Un, Chong-Kwanresearcher은종관researcher
Description
한국과학기술원 : 전기 및 전자공학과,
Publisher
한국과학기술원
Issue Date
1990
Identifier
61537/325007 / 000835234
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전기 및 전자공학과, 1990.8, [ x, 176 p. ]

URI
http://hdl.handle.net/10203/36130
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=61537&flag=dissertation
Appears in Collection
EE-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0