Skip to Main content Skip to Navigation
New interface
Journal articles

Antenna Selection for Array Synthesis Problems

Abstract : 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.
Complete list of metadata
Contributor : Laurent Jonchère Connect in order to contact the contributor
Submitted on : Thursday, January 21, 2021 - 3:17:12 PM
Last modification on : Wednesday, April 27, 2022 - 4:15:42 AM
Long-term archiving on: : Thursday, April 22, 2021 - 7:26:18 PM


Files produced by the author(s)



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⟩



Record views


Files downloads