• Türkçe
    • English
  • English 
    • Türkçe
    • English
  • Login
View Item 
  •   Home
  • Avesis
  • Dokümanı Olmayanlar
  • Makale
  • View Item
  •   Home
  • Avesis
  • Dokümanı Olmayanlar
  • Makale
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

EM based Stochastic maximum likelihood approach for localization of near-field sources in 3-D

Author
Cirpan, HA
Paker, S
Kabaoglu, N
Metadata
Show full item record
Abstract
The goal of this paper is to estimate the locations of unknown sources in 3-D space from the data collected by a 2-D rectangular array. Various studies employing different estimation methods under near-field and far-field assumptions were presented in the past. In most of the previous studies, location estimations of sources at the same plane with the antenna array were carried out by using algorithms having constraints for various situations indeed. In this study, location estimations of sources that are placed at a different plane from the antenna array is given. In other words, locations of sources in 3-D space is estimated by using a 2-D rectangular array. Maximum likelihood (ML) method is chosen as the estimator since it has a better resolution performance than the conventional methods in the presence of less number and highly correlated source signal samples and low signal to noise ratio. Besides these superiorities, stability, asymptotic unbiasedness, asymptotic minimum variance properties as well as no restrictions on the antenna array are motivated the application of ML approach. Despite these advantages, ML estimator has computational complexity. However, this problem is tackled by the application of Expectation/Maximization (EM) iterative algorithm which converts the multidimensional search problem to one dimensional parallel search problems in order to prevent computational complexity. EM iterative algorithm is therefore adapted to the localization problem by the data (complete data) assumed to arrive to the sensors separately instead of observed data (incomplete data). Furthermore, performance of the proposed algorithm is tested by deriving Cramer-Rao bounds based on the concentrated likelihood approach. Finally, the applicability and effectiveness of the proposed algorithm is illustrated by some numerical simulations.
URI
http://hdl.handle.net/20.500.12627/120087
https://doi.org/10.1515/freq.2004.58.7-8.178
Collections
  • Makale [92796]

Creative Commons Lisansı

İstanbul Üniversitesi Akademik Arşiv Sistemi (ilgili içerikte aksi belirtilmediği sürece) Creative Commons Alıntı-GayriTicari-Türetilemez 4.0 Uluslararası Lisansı ile lisanslanmıştır.

DSpace software copyright © 2002-2016  DuraSpace
Contact Us | Send Feedback
Theme by 
Atmire NV
 

 


Hakkımızda
Açık Erişim PolitikasıVeri Giriş Rehberleriİletişim
sherpa/romeo
Dergi Adı/ISSN || Yayıncı

Exact phrase only All keywords Any

BaşlıkbaşlayaniçerenISSN

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsTypesThis CollectionBy Issue DateAuthorsTitlesSubjectsTypes

My Account

LoginRegister

Creative Commons Lisansı

İstanbul Üniversitesi Akademik Arşiv Sistemi (ilgili içerikte aksi belirtilmediği sürece) Creative Commons Alıntı-GayriTicari-Türetilemez 4.0 Uluslararası Lisansı ile lisanslanmıştır.

DSpace software copyright © 2002-2016  DuraSpace
Contact Us | Send Feedback
Theme by 
Atmire NV