Abstract

Sparse sensor arrays can match the performance of fully populated arrays in many tasks, such as direction-of-arrival estimation, using substantially fewer elements. However, finding the sparse array configuration that uses the smallest number of elements is generally a hard problem. Consequently, several closed-form, but sub-optimal solutions have been developed in the past. These designs are typically specified for a given number of elements, although when the area occupied by the array is the main limitation, it is more convenient to compare arrays of similar aperture instead. This paper outlines procedures for synthesizing three sparse linear array geometries for a specified aperture, namely the Wichmann, Nested and Super nested array. These configurations are compared to the optimal Minimum-redundancy array and their deviation from optimality is quantified in the limit of large apertures.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.