Synthesis of Modular Contiguously Clustered Linear Arrays Through a Sparseness-Regularized Solver - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Antennas and Propagation Année : 2016

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

Résumé

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.
Fichier non déposé

Dates et versions

hal-01570316 , version 1 (28-07-2017)

Identifiants

Citer

Giacomo Oliveri, Marco Salucci, Andrea Massa. Synthesis of Modular Contiguously Clustered Linear Arrays Through a Sparseness-Regularized Solver. IEEE Transactions on Antennas and Propagation, 2016, 64 (10), pp.4277 - 4287. ⟨10.1109/TAP.2016.2595623⟩. ⟨hal-01570316⟩
51 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More