Premium
Pattern Synthesis of Linear Arrays Using Fourier Coefficient Matching
Author(s) -
Imbriale W. A.,
Heller J. E.,
Mittra R.,
Cruz J. B.
Publication year - 1972
Publication title -
radio science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.371
H-Index - 84
eISSN - 1944-799X
pISSN - 0048-6604
DOI - 10.1029/rs007i007p00757
Subject(s) - fourier series , a priori and a posteriori , fourier transform , mathematics , algorithm , norm (philosophy) , matching (statistics) , mathematical analysis , computer science , mathematical optimization , statistics , philosophy , epistemology , political science , law
This paper presents a computer technique for synthesizing an array pattern for the practical problem in which only the magnitude of the far‐field pattern is specified. The general design problem is one in which both the currents and the spacings of the elements are allowed to be variables. The synthesis is based on a procedure which minimizes the norm of the difference between the Fourier coefficients of the desired and actual patterns. This criterion is very useful from practical design considerations since it allows one to determine a priori the highest order Fourier coefficient that can be approximated if the maximum array size is specified. Also, if no array size is specified, the procedure gives the array size necessary to obtain a given degree of approximation in the pattern.