Synthesis of Modular Contiguously Clustered Linear Arrays Through a Sparseness-Regularized Solver

Abstract : An innovative methodology for the design of modular and contiguously-clustered linear arrays is proposed. The approach formulates the subarraying problem as a pattern matching one in which elementary modules taken from a user-defined dictionary are combined to synthesize the final antenna layout. By recasting such a synthesis problem within the compressive sensing framework, an efficient solver is used to determine the array architecture starting from the a priori specification of the features (e.g., the length) of the admissible subarrays. A set of representative numerical experiments is discussed to assess the advantages and drawbacks of the proposed algorithm also in comparison with some state-of-the-art methods.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01570316
Contributor : Andrea Massa <>
Submitted on : Friday, July 28, 2017 - 9:55:00 PM
Last modification on : Monday, November 5, 2018 - 11:49:56 AM

Identifiers

Citation

Giacomo Oliveri, Marco Salucci, Andrea Massa. Synthesis of Modular Contiguously Clustered Linear Arrays Through a Sparseness-Regularized Solver. IEEE Transactions on Antennas and Propagation, Institute of Electrical and Electronics Engineers, 2016, 64 (10), pp.4277 - 4287. ⟨10.1109/TAP.2016.2595623⟩. ⟨hal-01570316⟩

Share

Metrics

Record views

130