GRADUAL THINNING SYNTHESIS FOR LINEAR ARRAY BASED ON ITERATIVE FOURIER TECHNIQUES

Abstract

In this paper, a modifled iterative fourier technique (MIFT) for thinning uniformly spaced linear arrays featuring a minimum sidelobe level as well as narrow beam is presented. Since IFT is a thinning procedure which has to be performed many trial times with difierent initial element distributions to get the optimum solution, it is, to some extent, time consuming. Moreover, in each trial of IFT, the number of iterations is usually low, which makes the method tend to be trapped in local solution even with a large number of trials. Therefore, the similar procedures for both MIFT and IFT are to derive the element excitations from the prescribed array factor using successive forward and backward Fourier transforms, and array thinning is accomplished by setting the amplitudes of a predetermined number of the largest element excitations to unity while the others to zero during each iteration cycle. Furthermore, in MIFT, based on the idea of gradual thinning which is inspired by perturbation theory, an adaptively changed flll factor is proposed to modify IFT with the purpose of accelerating computational speed and facilitating convergence. The immediate result caused by this modifled flll factor can be embodied in two points. One point is that unlike the random number of iterations contained in difierent trials of IFT, the number of iterations in all trials of MIFT is a flxed value and only predetermined by the array inherent features (symmetrical or asymmetrical) and flll factor. Therefore, su-cient iterations are ensured in each trial to efiectively help the algorithm avoid trapping. The other point is that when MIFT is performed, the array elements are gradually truncated, which maintains the most useful element excitations while maximally excludes the bad excitations, so that the optimum solution