.png){kind=icon}
Return
Antenna Selection for Array Synthesis Problems
.png){kind=icon}
OA
AI
DOI：10.1109/LAWP.2016.2612762.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Antenna selection
array antennas
semidefinite programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.8
Papers:
1.0W
Citations:
2.8W
Organization
Cited Papers
ShareSaveShareSaveThe Quality of Reporting Methods and Results in Network Meta-Analyses: An Overview of Reviews and Suggestions for Improvement.png)
PLoS ONEOAAI
PLoS ONEIF0
OAAIShareSaveShareSaveShareSaveShareSaveFunctional promoter and polyadenylation site mapping of the human serotonin (5-HT) transporter gene
PREAI
ShareSave no more
no more