| Item type |
学術雑誌論文 / Journal Article(1) |
| 公開日 |
2019-10-28 |
| タイトル |
|
|
タイトル |
A Low-Complexity GA-WSF Algorithm for Narrow-Band DOA Estimation |
|
言語 |
en |
| 言語 |
|
|
言語 |
eng |
| 資源タイプ |
|
|
資源 |
http://purl.org/coar/resource_type/c_6501 |
|
タイプ |
journal article |
| アクセス権 |
|
|
アクセス権 |
open access |
|
アクセス権URI |
http://purl.org/coar/access_right/c_abf2 |
| 著者 |
Chen, Haihua
Hu, Jialiang
Tian, Hui
Li, Shibao
Liu, Jianhang
SUZUKI, Masakiyo
|
| 著者別名 |
|
|
|
識別子Scheme |
WEKO |
|
|
識別子 |
89671 |
|
|
識別子Scheme |
KAKEN - 研究者検索 |
|
|
識別子URI |
https://nrid.nii.ac.jp/ja/nrid/1000060192621 |
|
|
識別子 |
60192621 |
|
|
姓名 |
鈴木, 正清 |
|
|
言語 |
ja |
|
|
姓 |
鈴木 |
|
|
言語 |
ja |
|
|
名 |
正清 |
|
|
言語 |
ja |
|
|
|
識別子Scheme |
ISNI |
|
|
|
識別子URI |
https://www.isni.org/isni/ |
| 抄録 |
|
|
内容記述タイプ |
Abstract |
|
内容記述 |
This paper proposes a low-complexity estimation algorithm for weighted subspace fitting (WSF) based on the Genetic Algorithm (GA) in the problem of narrow-band direction-of-arrival (DOA) finding. Among various solving techniques for DOA, WSF is one of the highest estimation accuracy algorithms. However, its criteria is a multimodal nonlinear multivariate optimization problem. As a result, the computational complexity of WSF is very high, which prevents its application to real systems. The Genetic Algorithm (GA) is considered as an effective algorithm for finding the global solution of WSF. However, conventional GA usually needs a big population size to cover the whole searching space and a large number of generations for convergence, which means that the computational complexity is still high. To reduce the computational complexity of WSF, this paper proposes an improved Genetic algorithm. Firstly a hypothesis technique is used for a rough DOA estimation for WSF. Then, a dynamic initialization space is formed around this value with an empirical function. Within this space, a smaller population size and smaller amount of generations are required. Consequently, the computational complexity is reduced. Simulation results show the efficiency of the proposed algorithm in comparison to many existing algorithms. |
|
言語 |
en |
| 書誌情報 |
en : International Journal of Antennas and Propagation
号 2018,
p. 1-6,
発行日 2018
|
| ISSN |
|
|
収録物識別子タイプ |
PISSN |
|
収録物識別子 |
1687-5869 |
| DOI |
|
|
|
識別子タイプ |
DOI |
|
|
関連識別子 |
https://doi.org/10.1155/2018/7175653 |
| 権利 |
|
|
権利情報 |
c 2018 Haihua Chen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. |
| 出版者 |
|
|
出版者 |
Hindawi |
| 著者版フラグ |
|
|
言語 |
en |
|
値 |
publisher |
| 出版タイプ |
|
|
出版タイプ |
VoR |
|
出版タイプResource |
http://purl.org/coar/version/c_970fb48d4fbd8a85 |
Int. J of Antennas and Propagation_2018_7175653 (1.5 MB)
.png)
