基于无向邻接图的最小互补素阵列设计

Tianyao Long, Qiang Li, Lei Huang, Xinzhu Chen, Hanfei Zhou, Deyin Xia
{"title":"基于无向邻接图的最小互补素阵列设计","authors":"Tianyao Long, Qiang Li, Lei Huang, Xinzhu Chen, Hanfei Zhou, Deyin Xia","doi":"10.1109/ICICSP55539.2022.10050693","DOIUrl":null,"url":null,"abstract":"A coprime array (CA) consisting of two subarrays is of considerable interest in the low redundancy linear array design. As known, discontinuous sensors lead to blurred angle measurements in the difference co-array. This paper proposes an efficient aperture extension method and a matrix completability discriminator based on the undirected adjacency graph of the matrix. First, we construct a zero-filled Hankel matrix with single snapshot signals received from a non-uniform CA. Then, we take the low-rank feature as a heuristic and complete the zero-dilled Hankel matrix. At last, the subarrays of the CA are traversed to design the minimum complementable coprime array (MCCA) via the discriminator. By simulation, we verify that the difference co-array of the MCCA can be completed to the maximum virtual aperture of the CA and reduce the noise.","PeriodicalId":281095,"journal":{"name":"2022 5th International Conference on Information Communication and Signal Processing (ICICSP)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Minimum Complementable Coprime Array Design Based on Undirected Adjacency Graph\",\"authors\":\"Tianyao Long, Qiang Li, Lei Huang, Xinzhu Chen, Hanfei Zhou, Deyin Xia\",\"doi\":\"10.1109/ICICSP55539.2022.10050693\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A coprime array (CA) consisting of two subarrays is of considerable interest in the low redundancy linear array design. As known, discontinuous sensors lead to blurred angle measurements in the difference co-array. This paper proposes an efficient aperture extension method and a matrix completability discriminator based on the undirected adjacency graph of the matrix. First, we construct a zero-filled Hankel matrix with single snapshot signals received from a non-uniform CA. Then, we take the low-rank feature as a heuristic and complete the zero-dilled Hankel matrix. At last, the subarrays of the CA are traversed to design the minimum complementable coprime array (MCCA) via the discriminator. By simulation, we verify that the difference co-array of the MCCA can be completed to the maximum virtual aperture of the CA and reduce the noise.\",\"PeriodicalId\":281095,\"journal\":{\"name\":\"2022 5th International Conference on Information Communication and Signal Processing (ICICSP)\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 5th International Conference on Information Communication and Signal Processing (ICICSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICSP55539.2022.10050693\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 5th International Conference on Information Communication and Signal Processing (ICICSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICSP55539.2022.10050693","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在低冗余线性阵列设计中,由两个子阵列组成的协素数阵列(CA)具有重要的研究意义。众所周知,在差分共阵中,不连续传感器会导致角度测量模糊。提出了一种有效的孔径扩展方法和基于矩阵无向邻接图的矩阵可完成判别器。首先,利用从非均匀CA接收到的单个快照信号构造一个零填充的Hankel矩阵,然后以低秩特征为启发式,完成零钻的Hankel矩阵。最后,通过鉴别器遍历组合的子阵列,设计出最小互补素阵列(MCCA)。通过仿真,验证了差分共阵可以达到最大虚拟孔径,降低噪声。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Minimum Complementable Coprime Array Design Based on Undirected Adjacency Graph
A coprime array (CA) consisting of two subarrays is of considerable interest in the low redundancy linear array design. As known, discontinuous sensors lead to blurred angle measurements in the difference co-array. This paper proposes an efficient aperture extension method and a matrix completability discriminator based on the undirected adjacency graph of the matrix. First, we construct a zero-filled Hankel matrix with single snapshot signals received from a non-uniform CA. Then, we take the low-rank feature as a heuristic and complete the zero-dilled Hankel matrix. At last, the subarrays of the CA are traversed to design the minimum complementable coprime array (MCCA) via the discriminator. By simulation, we verify that the difference co-array of the MCCA can be completed to the maximum virtual aperture of the CA and reduce the noise.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信