Antenna Array Pattern Synthesis Using an Iterative Method

In this article, we investigate a novel iterative antenna array synthesis method. The method is based on the iterative addition of antenna array elements. After defining the synthesis algorithm, we prove that the discrepancy between the goal and the synthesized pattern converges to the theoretical l...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on magnetics 2020-02, Vol.56 (2), p.1-4
Main Authors: Marak, Karoly, Kracek, Jan, Bilicz, Sandor
Format: Article
Language:English
Subjects:
Algorithms
Antenna array
Antenna arrays
Antenna radiation patterns
Antenna theory
Antennas
Broadband antennas
Circular polarization
Convergence
iterative method
Iterative methods
Lower bounds
Magnetism
optimization
radiation pattern
Synthesis
Wireless communication
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this article, we investigate a novel iterative antenna array synthesis method. The method is based on the iterative addition of antenna array elements. After defining the synthesis algorithm, we prove that the discrepancy between the goal and the synthesized pattern converges to the theoretical lower bound in the sense of a certain norm. The algorithm is also extended to iteratively replace already placed elements and for the synthesis of multiple goal patterns with the same array geometry but with different excitations. Some numerical examples are shown to illustrate the convergence properties of the proposed method. Possible applications include circularly polarized patterns, since the algorithm can handle the rotation as well as translation of the antenna elements.
ISSN:0018-9464
1941-0069
DOI:10.1109/TMAG.2019.2952809