SLL Minimization for Linear Uniformly Excited Sparse Arrays Using Gradient Descent

In this paper, we apply a gradient descent-based method to the synthesis of uniformly excited sparse phased arrays. The effectiveness of gradient-based optimization in this domain is highly dependent on the precision of the Peak Sidelobe Level (PSLL) estimation. Conventional grid-based calculation methods fail to provide the necessary accuracy, introducing numerical noise that prevents efficient convergence. To address this, we implement a grid-less framework for radiation pattern analysis. This approach achieves near-machine precision and enhances computational performance compared to traditional discrete grid search. Based on this continuous evaluation, we develop a modified gradient descent strategy capable of synthesizing large-scale arrays. The proposed method manages high-dimensional search spaces and outperforms heuristic algorithms in terms of both convergence speed and the level of sidelobe suppression.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-05-17
DOI
https://doi.org/10.5281/zenodo.20260672
Primary Topic
Antenna Design and Optimization
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

SLL Minimization for Linear Uniformly Excited Sparse Arrays Using Gradient Descent

Artem Orekhov
Zenodo (CERN European Organization for Nuclear Research)
Antenna Design and Optimization
preprint

SLL Minimization for Linear Uniformly Excited Sparse Arrays Using Gradient Descent

Artem Orekhov
preprint en

Abstract

In this paper, we apply a gradient descent-based method to the synthesis of uniformly excited sparse phased arrays. The effectiveness of gradient-based optimization in this domain is highly dependent on the precision of the Peak Sidelobe Level (PSLL) estimation. Conventional grid-based calculation methods fail to provide the necessary accuracy, introducing numerical noise that prevents efficient convergence. To address this, we implement a grid-less framework for radiation pattern analysis. This approach achieves near-machine precision and enhances computational performance compared to traditional discrete grid search. Based on this continuous evaluation, we develop a modified gradient descent strategy capable of synthesizing large-scale arrays. The proposed method manages high-dimensional search spaces and outperforms heuristic algorithms in terms of both convergence speed and the level of sidelobe suppression.

Zenodo (CERN European Organization for Nuclear Research)
Antenna Design and Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.