Sparse Symmetric Linear Arrays with Low Redundancy and a Contiguous Sum Co-Array
Robin Rajam\"aki, Visa Koivunen

TL;DR
This paper introduces a symmetric array design for active and passive sensing that achieves low redundancy and contiguous co-arrays, enabling the resolution of more scatterers than sensors, with explicit sensor position formulas.
Contribution
It proposes a general symmetric array configuration with necessary and sufficient conditions for contiguous sum and difference co-arrays, linking to existing low-redundancy arrays like CNA and KA.
Findings
Achieves low redundancy with contiguous co-arrays
Provides closed-form sensor position formulas
Enables resolving more scatterers than sensors
Abstract
Sparse arrays can resolve significantly more scatterers or sources than sensor by utilizing the co-array - a virtual array structure consisting of pairwise differences or sums of sensor positions. Although several sparse array configurations have been developed for passive sensing applications, far fewer active array designs exist. In active sensing, the sum co-array is typically more relevant than the difference co-array, especially when the scatterers are fully coherent. This paper proposes a general symmetric array configuration suitable for both active and passive sensing. We first derive necessary and sufficient conditions for the sum and difference co-array of this array to be contiguous. We then study two specific instances based on the Nested array and the Kl{\o}ve-Mossige basis, respectively. In particular, we establish the relationship between the minimum-redundancy solutions…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
