In this paper a method for a fast synthesis of planar, maximally thinned and steerable arrays is proposed and tested on several benchmarks available in literature. The method optimizes simultaneously the weight coefficients and sensor positions of a planar array without using global optimization schemes, properly exploiting convex optimization based algorithms. The resulting arrays are able to radiate a steerable beam pattern, satisfying a prescribed power mask and avoid to constraint the fitting of any a priori assigned reference field pattern. Although such method takes into account the general case of sparse arrays this letter it is focused on the case of thinned arrays as a special case of sparse ones, since the initial grid to thin on has half-wavelength distances only. Such feature allows a faster synthesis than in the general case of sparse arrays.
Fast synthesis of planar, maximally thinned arrays / Tumolo, R. M.; D'Urso, Michele; Prisco, Giancarlo; Buonanno, Aniello. - In: PIERS ONLINE. - ISSN 1931-7360. - ELETTRONICO. - 2017, Vol. 68, 47-52:68(2017), pp. 47-52.
Fast synthesis of planar, maximally thinned arrays
R. M. Tumolo;
2017-01-01
Abstract
In this paper a method for a fast synthesis of planar, maximally thinned and steerable arrays is proposed and tested on several benchmarks available in literature. The method optimizes simultaneously the weight coefficients and sensor positions of a planar array without using global optimization schemes, properly exploiting convex optimization based algorithms. The resulting arrays are able to radiate a steerable beam pattern, satisfying a prescribed power mask and avoid to constraint the fitting of any a priori assigned reference field pattern. Although such method takes into account the general case of sparse arrays this letter it is focused on the case of thinned arrays as a special case of sparse ones, since the initial grid to thin on has half-wavelength distances only. Such feature allows a faster synthesis than in the general case of sparse arrays.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione