Premium
Synthesis of hexagonal and square arrays using discrete convolution
Author(s) -
Shelton J. P.,
Laxpati S. R.
Publication year - 1984
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/rs019i005p01229
Subject(s) - convolution (computer science) , square (algebra) , chebyshev polynomials , hexagonal crystal system , mathematics , simple (philosophy) , polynomial , convolution theorem , chebyshev filter , circular convolution , mathematical analysis , geometry , computer science , fourier transform , fourier analysis , philosophy , epistemology , crystallography , chemistry , machine learning , artificial neural network , fractional fourier transform
A discrete convolution procedure is applied to the synthesis of radiation patterns with prescribed sidelobe levels. This procedure begins with a target polynomial, such as Chebyshev or Taylor, and determines the array element amplitudes by a simple, closed‐form, noniterative computational method. Symmetrical hexagonal arrays of 3 n 2 + 3 n + 1 elements, where n is the number of rings in the array, and symmetrical square arrys of (2 m + 1) 2 elements are analyzed. Examples are presented, and this procedure is compared with other synthesis methods.