Sparse Array Mutual Coupling Reduction
This paper provides a concise overview of recent developments in sparse antenna arrays, with a specific focus on techniques for reducing mutual coupling. It explores the concept and definitions of sparse arrays in different applications, highlighting their historical significance in antenna theory....
Gespeichert in:
Veröffentlicht in: | IEEE Open Journal of Antennas and Propagation 2024-02, Vol.5 (1), p.201-216 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | This paper provides a concise overview of recent developments in sparse antenna arrays, with a specific focus on techniques for reducing mutual coupling. It explores the concept and definitions of sparse arrays in different applications, highlighting their historical significance in antenna theory. The paper addresses the mutual coupling problem and presents reduced coupling geometrical configurations through illustrative examples. Various mutual coupling compensation techniques are discussed. The paper conducts a comprehensive comparison of multiple array design optimisation techniques, including genetic algorithm, covariance matrix adaptation evolution strategy, particle swarm optimisation, trust-region framework, Nelder-Mead simplex algorithm, interpolated Quasi-Newton, and classic Powell. The comparison emphasizes achieving desired radiation performance and evaluates the mutual coupling coefficient using 4\times 4 planar arrays and 16\times 1 linear arrays with typical patch antennas in the mmWave bands. Notably, the paper considers optimised non-uniform antenna element positioning within the arrays, which has shown promising results in reducing mutual coupling. The study also introduces the application of beam steering to these optimised non-uniform arrays, demonstrating resilience to beam steering degradation and potential performance improvements. The findings indicate that particle swarm optimisation generally provides the most consistent performance across the discussed optimisation problems. |
---|---|
ISSN: | 2637-6431 2637-6431 |
DOI: | 10.1109/OJAP.2023.3339368 |