DocumentCode
2808817
Title
A simple algorithm to achieve equiripple patterns for arbitrary arrays
Author
Tseng, C.-Y. ; Griffiths, L.J.
Author_Institution
Dept. of EE-Syst., Univ. of Southern California, Los Angeles, CA, USA
fYear
1991
fDate
24-28 June 1991
Firstpage
392
Abstract
The authors consider the problem of designing equiripple patterns (uniform sidelobes) for antenna arrays with arbitrary geometry. A simple algorithm is derived which starts with an initial pattern and iteratively aligns the sidelobe peaks to some prespecified level. The initial pattern is selected as having a peak of unity gain at the look direction while simultaneously possessing minimum power in other directions where the sidelobes are of concern. Such a pattern can be obtained straightforwardly by solving a linearly constrained minimization problem with unity gain and zero first derivative constraints. The remaining task is to update the array weights from one iteration to the next until an equiripple pattern is reached. The algorithm has been applied to achieve equiripple patterns for a variety of arrays.<>
Keywords
antenna arrays; antenna radiation patterns; antenna theory; iterative methods; algorithm; antenna arrays; arbitrary arrays; equiripple patterns; iterative procedure; linearly constrained minimization problem; uniform sidelobes; unity gain; zero first derivative constraints; Antenna arrays; Azimuth; Convergence; Geometry; Linear systems; Power generation; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Antennas and Propagation Society International Symposium, 1991. AP-S. Digest
Conference_Location
London, Ontario, Canada
Print_ISBN
0-7803-0144-7
Type
conf
DOI
10.1109/APS.1991.174858
Filename
174858
Link To Document