.png){kind=icon}
.png){kind=icon}
Return
Optimization of Antenna Array Configurations Using Deep Learning
.png){kind=icon}
OA
AI
DOI：10.1109/OJAP.2025.3578887.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We introduce a deep learning-based optimization method that enhances the design of sparse phased array by reducing grating lobes. Our approach begins with a generation of sparse antenna array configurations, efficiently addressing the non-convex challenges and high degrees of freedom in array design. We then employ neural networks, trained on 70,000 and tested on 30,000 configurations, to approximate a non-convex cost function that measures the ratio between the energy of the main lobe and the side lobe level. The approximation is differentiable and allows for the minimization of the cost function by gradient descent with respect to the antenna’s elements coordinates, yielding a new optimized configuration. A custom penalty mechanism is also implemented, integrating various physical and design constraints into our optimization method. The effectiveness of our method is tested on the ten configurations with the lowest initial cost values, showing a further reduction in cost by 699% to 816%, with an average of 740%. The code for the method is available at <uri xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">https://github.com/david5010/Optimization-of-Antenna-Arrays</uri>.
Keywords:
Antenna arrays
machine learning
deep learning
gradient descent
optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
3.6
Papers:
803
Citations:
1.6K