Antenna Selection for Array Synthesis Problems - Université de Rennes Access content directly
Journal Articles IEEE Antennas and Wireless Propagation Letters Year : 2017

Antenna Selection for Array Synthesis Problems


The problem of choosing a set of N antennas from M possible radiators to optimize the performances of antenna arrays is addressed. Solving this combinatorial problem by evaluating all possible choices is untractable unless both N and M are small. Convex relaxations are proposed to solve approximately this antenna selection problem and quickly get bounds on the performance that can be achieved over all possible antenna combinations. Two approaches are also presented to rapidly construct, from these approximated results, good suboptimal solutions, i.e., good antenna selections. For (N, K)= (30, 10), i.e., 10(30) possible antenna arrays, the methods can be carried out in a few seconds on a laptop. The proposed approaches are applied to solve various representative numerical instances, and they provide quickly valuable information for antenna array designers.
Fichier principal
Vignette du fichier
hal-01534211.pdf (262.88 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01534211 , version 1 (21-01-2021)



Benjamin Fuchs. Antenna Selection for Array Synthesis Problems. IEEE Antennas and Wireless Propagation Letters, 2017, 16, pp.868--871. ⟨10.1109/LAWP.2016.2612762⟩. ⟨hal-01534211⟩
85 View
81 Download



Gmail Facebook X LinkedIn More