Nested Optimization for the Synthesis of Asymmetric Shaped Beam Patterns in Subarrayed Linear Antenna Arrays

In this article, a novel clustering method for synthesizing asymmetric shaped beam patterns in subarrayed linear antenna arrays is presented. The definition of the elements aggregations along with the corresponding weighting coefficients is accomplished through two nested iterative loops. An externa...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on antennas and propagation Vol. 70; no. 5; pp. 3385 - 3397
Main Authors: Rocca, Paolo, Poli, Lorenzo, Anselmi, Nicola, Massa, Andrea
Format: Journal Article
Language:English
Published: New York IEEE 01.05.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">k -means algorithm
Algorithms
Antenna arrays
Antennas
Array synthesis
asymmetric shaped beam pattern synthesis
Asymmetry
clustered arrays
Clustering
Indexes
Iterative methods
Layout
Linear antenna arrays
linear arrays
Linear programming
Optimization
Optimized production technology
Pattern matching
Phased arrays
subarrayed arrays
Synthesis
ISSN:0018-926X, 1558-2221
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this article, a novel clustering method for synthesizing asymmetric shaped beam patterns in subarrayed linear antenna arrays is presented. The definition of the elements aggregations along with the corresponding weighting coefficients is accomplished through two nested iterative loops. An external loop is aimed at determining the optimal excitations of a reference fully populated array that fits user-defined pattern masks, while the internal one is devoted to the synthesis of the best subarrayed layout affording the closest pattern to the reference one by means of a <inline-formula> <tex-math notation="LaTeX">{k} </tex-math></inline-formula>-means-based algorithm that minimizes the total intracluster variations. Representative numerical results are presented and compared with competitive state-of-the-art solutions to assess the effectiveness of the proposed synthesis method.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-926X
1558-2221
DOI:10.1109/TAP.2021.3137176