Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Highly Robust Sparse Fractal Array

Published 1 Dec 2022 in eess.SP | (2212.00341v1)

Abstract: 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.