Direct Position Determination using Distributed Unfold Coprime Arrays with Unknown Mutual Coupling: based on Reduced-Dimension Search

Baobao Li, Xiaofei Zhang, Jianfeng Li, Jinke Cao
{"title":"Direct Position Determination using Distributed Unfold Coprime Arrays with Unknown Mutual Coupling: based on Reduced-Dimension Search","authors":"Baobao Li, Xiaofei Zhang, Jianfeng Li, Jinke Cao","doi":"10.1145/3573428.3573706","DOIUrl":null,"url":null,"abstract":"The direct position determination (DPD) approach has higher localization accuracy and better robustness than the classical two-step approach when localizing multiple sources with distributed antenna arrays. This paper focuses on the DPD algorithm using multiple Unfolded Coprime Arrays (UCAs) with unknown mutual coupling. To reduce the adverse effects of the mutual coupling, we first expand the unfolded coprime arrays into the DPD scenario. Subsequently, we introduce the HD-DPD-Capon algorithm, which fuses all inverse covariance matrices of distributed arrays, simultaneously searching for multiple unknown mutual coupling coefficients and source positions. Finally, in advance of the reduced-dimension search, we propose the RMCD-ICF algorithm, which only needs to search the two-dimension position, to reduce the high computational complexity of the HD-DPD-Capon algorithm caused by the high-dimensional search. Simulation results verify the superiority of the proposed algorithm on computation complexity and localization accuracy.","PeriodicalId":314698,"journal":{"name":"Proceedings of the 2022 6th International Conference on Electronic Information Technology and Computer Engineering","volume":"152 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2022 6th International Conference on Electronic Information Technology and Computer Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3573428.3573706","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The direct position determination (DPD) approach has higher localization accuracy and better robustness than the classical two-step approach when localizing multiple sources with distributed antenna arrays. This paper focuses on the DPD algorithm using multiple Unfolded Coprime Arrays (UCAs) with unknown mutual coupling. To reduce the adverse effects of the mutual coupling, we first expand the unfolded coprime arrays into the DPD scenario. Subsequently, we introduce the HD-DPD-Capon algorithm, which fuses all inverse covariance matrices of distributed arrays, simultaneously searching for multiple unknown mutual coupling coefficients and source positions. Finally, in advance of the reduced-dimension search, we propose the RMCD-ICF algorithm, which only needs to search the two-dimension position, to reduce the high computational complexity of the HD-DPD-Capon algorithm caused by the high-dimensional search. Simulation results verify the superiority of the proposed algorithm on computation complexity and localization accuracy.
基于降维搜索的未知互耦合分布展开互素阵列直接定位
采用分布式天线阵列进行多源定位时,直接定位方法比传统的两步法具有更高的定位精度和更好的鲁棒性。本文研究了一种基于未知互耦的多重未折叠互素阵列(UCAs)的DPD算法。为了减少相互耦合的不利影响,我们首先将未展开的互素数阵列扩展到DPD场景。随后,我们引入了HD-DPD-Capon算法,该算法融合了分布式阵列的所有逆协方差矩阵,同时搜索多个未知互耦系数和源位置。最后,在进行降维搜索之前,我们提出了仅需搜索二维位置的RMCD-ICF算法,以降低HD-DPD-Capon算法因高维搜索而导致的高计算复杂度。仿真结果验证了该算法在计算复杂度和定位精度上的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信