Comparison of superresolution algorithms with different array geometries for radio direction finding
Approved for public release, distribution is unlimited === The objective of this thesis is to investigate and evaluate the effectiveness of modern estimation methods with different array geometries as they apply to the problem of bearing estimation. The algorithms were selected from those that apply...
Main Author: | |
---|---|
Other Authors: | |
Language: | en_US |
Published: |
Monterey, California. Naval Postgraduate School
2012
|
Online Access: | http://hdl.handle.net/10945/8125 |
id |
ndltd-nps.edu-oai-calhoun.nps.edu-10945-8125 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-nps.edu-oai-calhoun.nps.edu-10945-81252015-06-23T15:59:24Z Comparison of superresolution algorithms with different array geometries for radio direction finding Lin, Ku-Ting Jenn, David C. Pace, Phillip E. Naval Postgraduate School Department of Electrical and Computer Engineering Approved for public release, distribution is unlimited The objective of this thesis is to investigate and evaluate the effectiveness of modern estimation methods with different array geometries as they apply to the problem of bearing estimation. The algorithms were selected from those that apply to multidimensional direction finding, and include MUSIC, PHD, minimum norm, and Capon's beam-former. These four techniques based on their high resolution capability, and their ability to deal with three-dimensional non-uniform arrays and to estimate both azimuth and elevation angle of arrival (AQA). Computer simulations were run linear arrays, circular array, and combinations of the two. The test conditions included: (1) two closely spaced emitters, and (2) various levels of additive white Gaussian noise. 2012-08-09T19:18:55Z 2012-08-09T19:18:55Z 1998-09 Thesis http://hdl.handle.net/10945/8125 en_US Copyright is reserved by the copyright owner Monterey, California. Naval Postgraduate School |
collection |
NDLTD |
language |
en_US |
sources |
NDLTD |
description |
Approved for public release, distribution is unlimited === The objective of this thesis is to investigate and evaluate the effectiveness of modern estimation methods with different array geometries as they apply to the problem of bearing estimation. The algorithms were selected from those that apply to multidimensional direction finding, and include MUSIC, PHD, minimum norm, and Capon's beam-former. These four techniques based on their high resolution capability, and their ability to deal with three-dimensional non-uniform arrays and to estimate both azimuth and elevation angle of arrival (AQA). Computer simulations were run linear arrays, circular array, and combinations of the two. The test conditions included: (1) two closely spaced emitters, and (2) various levels of additive white Gaussian noise. |
author2 |
Jenn, David C. |
author_facet |
Jenn, David C. Lin, Ku-Ting |
author |
Lin, Ku-Ting |
spellingShingle |
Lin, Ku-Ting Comparison of superresolution algorithms with different array geometries for radio direction finding |
author_sort |
Lin, Ku-Ting |
title |
Comparison of superresolution algorithms with different array geometries for radio direction finding |
title_short |
Comparison of superresolution algorithms with different array geometries for radio direction finding |
title_full |
Comparison of superresolution algorithms with different array geometries for radio direction finding |
title_fullStr |
Comparison of superresolution algorithms with different array geometries for radio direction finding |
title_full_unstemmed |
Comparison of superresolution algorithms with different array geometries for radio direction finding |
title_sort |
comparison of superresolution algorithms with different array geometries for radio direction finding |
publisher |
Monterey, California. Naval Postgraduate School |
publishDate |
2012 |
url |
http://hdl.handle.net/10945/8125 |
work_keys_str_mv |
AT linkuting comparisonofsuperresolutionalgorithmswithdifferentarraygeometriesforradiodirectionfinding |
_version_ |
1716806463335170048 |