Synthesis of Sparse Large Arrays via Sequential Convex Optimizations - Archive ouverte HAL
Communication Dans Un Congrès Année : 2022

Synthesis of Sparse Large Arrays via Sequential Convex Optimizations

Résumé

In this work a synthesis technique for designing sparse phased arrays of large size is presented. The procedure is based on an iterative convex optimization algorithm, also known as compressive sensing, which is straightforward to implement and efficient in terms of computational cost. It is capable of producing a layout with a significant reduction of active elements for predefined performance. Due to its effectiveness, it can also be employed for the optimization of large arrays. The capabilities and versatility of the algorithm are illustrated by different case studies. In particular, the possibility to reduce by 45% the number of elements in a large array is shown in details.
Fichier non déposé

Dates et versions

hal-03771402 , version 1 (07-09-2022)

Identifiants

Citer

Christos Monochristou, Shang Xiang, Mark Holm, Ronan Sauleau, Mauro Ettorre. Synthesis of Sparse Large Arrays via Sequential Convex Optimizations. 16th European Conference on Antennas and Propagation (EuCAP), Mar 2022, Madrid, Spain. ⟨10.23919/EuCAP53622.2022.9769607⟩. ⟨hal-03771402⟩
22 Consultations
0 Téléchargements

Altmetric

Partager

More