DOA Estimation of Far-Field Sources by Exploiting Second Order Statistics of Bi-level Nested Arrays Using Biological Flower Pollination Algorithm

IF 1.9 4区 计算机科学 Q3 TELECOMMUNICATIONS
Khurram Hameed, Nauman Ahmed, Wasim Khan, Muneeb Ahmed, Salma Zainab Farooq, Muhammad Rashid Ramzan, Muhammad Ramzan
{"title":"DOA Estimation of Far-Field Sources by Exploiting Second Order Statistics of Bi-level Nested Arrays Using Biological Flower Pollination Algorithm","authors":"Khurram Hameed, Nauman Ahmed, Wasim Khan, Muneeb Ahmed, Salma Zainab Farooq, Muhammad Rashid Ramzan, Muhammad Ramzan","doi":"10.1007/s11277-024-11512-6","DOIUrl":null,"url":null,"abstract":"<p>The immense degree of freedom (DOF), high array aperture, non-uniform linear arrays, and reduced mutual coupling have developed interest in the estimations of the direction of arrival (DOA). Due to complex previous structures, this paper investigates the bi-level sparse linear nested array (SNA) concepts to discuss element spacing and different ranges on uniform DOF. Then features of flower pollination algorithm is applied to the proposed two-level SNA to generalize and enhance the proposed structure further. In order to boost DOF, it is also investigated local and global minima of highly non-linear functions. The proposed technique for quantifying the DOA is reviewed analytically using evaluation parameters like cumulative distributive function, accuracy, root mean square error, and robustness against noise and snapshots. The simulation findings prove its validation with the analytical model and target the accuracy with fewer separations and the minimum number of physical sensors in relation to particle swarm optimization. Moreover, the strength of the proposed study further validated by comparing with Cramer Rao Bound for minimum variance which shows that the FPA outperforms.</p>","PeriodicalId":23827,"journal":{"name":"Wireless Personal Communications","volume":"13 1","pages":""},"PeriodicalIF":1.9000,"publicationDate":"2024-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Wireless Personal Communications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s11277-024-11512-6","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

The immense degree of freedom (DOF), high array aperture, non-uniform linear arrays, and reduced mutual coupling have developed interest in the estimations of the direction of arrival (DOA). Due to complex previous structures, this paper investigates the bi-level sparse linear nested array (SNA) concepts to discuss element spacing and different ranges on uniform DOF. Then features of flower pollination algorithm is applied to the proposed two-level SNA to generalize and enhance the proposed structure further. In order to boost DOF, it is also investigated local and global minima of highly non-linear functions. The proposed technique for quantifying the DOA is reviewed analytically using evaluation parameters like cumulative distributive function, accuracy, root mean square error, and robustness against noise and snapshots. The simulation findings prove its validation with the analytical model and target the accuracy with fewer separations and the minimum number of physical sensors in relation to particle swarm optimization. Moreover, the strength of the proposed study further validated by comparing with Cramer Rao Bound for minimum variance which shows that the FPA outperforms.

Abstract Image

使用生物授粉算法利用双层嵌套阵列的二阶统计进行远场源 DOA 估算
巨大的自由度 (DOF)、高阵列孔径、非均匀线性阵列以及相互耦合的减少,使人们对到达方向 (DOA) 的估计产生了浓厚的兴趣。由于以前的结构复杂,本文研究了双层稀疏线性嵌套阵列(SNA)的概念,讨论了均匀 DOF 上的元素间距和不同范围。然后,将花粉授粉算法的特征应用于所提出的双层 SNA,以进一步概括和增强所提出的结构。为了提高 DOF,还研究了高度非线性函数的局部和全局最小值。利用累积分配函数、精确度、均方根误差以及抗噪声和快照的鲁棒性等评估参数,对所提出的 DOA 量化技术进行了分析评测。仿真结果证明了该技术与分析模型的有效性,并以更少的分离度和最少的物理传感器数量达到与粒子群优化相关的精度目标。此外,通过与 Cramer Rao Bound 的最小方差比较,进一步验证了所提研究的优势,这表明 FPA 的性能优于 Cramer Rao Bound。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Wireless Personal Communications
Wireless Personal Communications 工程技术-电信学
CiteScore
5.80
自引率
9.10%
发文量
663
审稿时长
6.8 months
期刊介绍: The Journal on Mobile Communication and Computing ... Publishes tutorial, survey, and original research papers addressing mobile communications and computing; Investigates theoretical, engineering, and experimental aspects of radio communications, voice, data, images, and multimedia; Explores propagation, system models, speech and image coding, multiple access techniques, protocols, performance evaluation, radio local area networks, and networking and architectures, etc.; 98% of authors who answered a survey reported that they would definitely publish or probably publish in the journal again. Wireless Personal Communications is an archival, peer reviewed, scientific and technical journal addressing mobile communications and computing. It investigates theoretical, engineering, and experimental aspects of radio communications, voice, data, images, and multimedia. A partial list of topics included in the journal is: propagation, system models, speech and image coding, multiple access techniques, protocols performance evaluation, radio local area networks, and networking and architectures. In addition to the above mentioned areas, the journal also accepts papers that deal with interdisciplinary aspects of wireless communications along with: big data and analytics, business and economy, society, and the environment. The journal features five principal types of papers: full technical papers, short papers, technical aspects of policy and standardization, letters offering new research thoughts and experimental ideas, and invited papers on important and emerging topics authored by renowned experts.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信