arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2212.00341eess.SP
收藏

一种高鲁棒性的稀疏分形阵列

A Highly Robust Sparse Fractal Array

Kretika Goel, Monika Aggarwal, Subrat Kar

摘要:

术语分形指的是具有递归性质并表现出更好的阵列因子属性的分数维。在这篇文章中,我们提出了一类新的稀疏阵列,分形的递归性质可以用于设计一个天线阵列称为稀疏分形阵列相结合的各种稀疏阵列的稀疏性和分形阵列的递归性质。该阵列最重要的特性是无孔差分协阵,这使得它成为DOA估计的一个很好的选择,因为各种算法如协阵MUSIC等都需要无孔差分协阵。但是,任何阵列的性能取决于它的存在的必要和非必要的传感器,这决定了差异协阵是否会受到影响时,传感器故障或没有。因此,本文对稀疏分形阵列的各种组合进行了严格的分析,以测试它们在存在故障传感器环境的情况下的鲁棒性。

英文摘要:

The term fractal refers to the fractional dimensions that have recursive nature and exhibit better array factor properties. In this article, we present a new class of sparse array where the recursive nature of a fractal can be used in designing an antenna array called a sparse fractal array by combining sparsity properties of the various sparse array and the recursive nature of fractal array. The most important property of the proposed array is the hole-free difference coarray which makes it a good choice for DOA estimation as various algorithms like coarray MUSIC etc demand hole-free difference coarray. But the performance of any array depends on the presence of essential and nonessential sensors in it which governs whether the difference coarray will get affected upon sensor failure or not. Hence, in this paper, a rigorous analysis is done for various combinations of sparse fractal arrays to test their robustness in presence of a faulty sensor environment.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑