{"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}
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.