Radiation Pattern Nulling in Phased Array Antennas Using Superior Discrete Fourier Transform and Dolph‐Tschebyscheff Based Synthesis Techniques

This study proposes an improved method for sector nulling in the radiation pattern of rectangular phased array antennas using two different synthesis techniques; an orthogonal Discrete Fourier transform and a quasi‐orthogonal Dolph‐Tschebyscheff based technique. In traditional synthesis techniques,...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Radio science 2022-04, Vol.57 (4), p.n/a
Hauptverfasser: Panigrahi, Siddhartha, Chou, Hsi‐Tseng, Chang, Chen‐Yi
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This study proposes an improved method for sector nulling in the radiation pattern of rectangular phased array antennas using two different synthesis techniques; an orthogonal Discrete Fourier transform and a quasi‐orthogonal Dolph‐Tschebyscheff based technique. In traditional synthesis techniques, broad elemental beams serve as local field basis functions (FBFs) in an array. Instead, the proposed methods produce low sidelobe narrow beams as FBFs. A set of these FBFs can effectively constitute the array's radiation pattern in a confined angular region. By properly weighting these FBFs, sector pattern nulls in a designated angular range are synthesized without severely distorting the patterns outside this area. The FBFs' optimal weights can be efficiently calculated using a nonlinear minimum least squares error technique, which is later transformed into the array's elemental excitation coefficients. Along with faster convergence, this technique allows control over peak sidelobe level, null depth, and width, making it suitable for GPS anti‐jamming, 5G communications, and other applications requiring interference suppression. Key Points Two localized beam cancellation methods for antenna pattern nulling are proposed The theoretical formulations of a Discrete Fourier Transform and a Dolph‐Tschebyscheff based algorithm are explained Numerical examples demonstrating the effectiveness of the algorithms are presented
ISSN:0048-6604
1944-799X
DOI:10.1029/2021RS007342