Optimal Non-Parametric Window-Based Linear-Phase Weighting in Uniform Linear Array Beamforming

This paper formulates beamforming synthesis as a multi-objective, multi-variable optimization problem to minimize the number of array elements while meeting constraints on half-power beamwidth, sidelobe level, and radiation attenuation in undesired directions. The problem is cast into a weighted single-objective formulation by unifying normalized beamwidth and sidelobe metrics. Twelve non-parametric window functions—parameterized solely by array length—are investigated. To identify the optimal window and minimum array size, two optimization algorithms are developed. While both guarantee the identical global optimum, the second algorithm significantly lowers computational complexity through progressive search-space pruning. A rigorous complexity analysis formalizes these efficiency gains. Simulations across five distinct constraint scenarios demonstrate that the framework reliably identifies the optimal window function and the minimum feasible element count while satisfying all radiation requirements.

Authors

Institutions

Publication Details

Journal
Computation
Published
2026-10-06
DOI
https://doi.org/10.3390/computation14100237
Primary Topic
Antenna Design and Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimal Non-Parametric Window-Based Linear-Phase Weighting in Uniform Linear Array Beamforming

Shahriar Shirvani Moghaddam
Computation
Antenna Design and Optimization
article

Optimal Non-Parametric Window-Based Linear-Phase Weighting in Uniform Linear Array Beamforming

Shahriar Shirvani Moghaddam
article en

Abstract

This paper formulates beamforming synthesis as a multi-objective, multi-variable optimization problem to minimize the number of array elements while meeting constraints on half-power beamwidth, sidelobe level, and radiation attenuation in undesired directions. The problem is cast into a weighted single-objective formulation by unifying normalized beamwidth and sidelobe metrics. Twelve non-parametric window functions—parameterized solely by array length—are investigated. To identify the optimal window and minimum array size, two optimization algorithms are developed. While both guarantee the identical global optimum, the second algorithm significantly lowers computational complexity through progressive search-space pruning. A rigorous complexity analysis formalizes these efficiency gains. Simulations across five distinct constraint scenarios demonstrate that the framework reliably identifies the optimal window function and the minimum feasible element count while satisfying all radiation requirements.

ComputationVol. 14(10)
Shahid Rajaee Teacher Training University (IR)
Openalex Percentile: Top 16%
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.