Research Article  Open Access
XinKuan Wang, GuiBao Wang, "A Hybrid Method Based on the Iterative Fourier Transform and the Differential Evolution for Pattern Synthesis of Sparse Linear Arrays", International Journal of Antennas and Propagation, vol. 2018, Article ID 6309192, 7 pages, 2018. https://doi.org/10.1155/2018/6309192
A Hybrid Method Based on the Iterative Fourier Transform and the Differential Evolution for Pattern Synthesis of Sparse Linear Arrays
Abstract
A hybrid method that combines the iterative Fourier transform (IFT) and the algorithm of differential evolution (DE) is proposed to address the synthesis of low sidelobe sparse linear array (SLA) including many elements. Firstly, a thinned linear array (TLA) with the lattices spaced at half wavelength is obtained by the IFT. Then, for the elements of the TLA whose left or right spacing are greater than half wavelength, their placements are selected as the candidates which will be further optimized by the DE, as long as the interelement spacing is not less than half wavelength. Consequently, the convergence pressure of DE is greatly alleviated for the reason that the selected elements only accounts for a small part of the total. Therefore, the SLA with improved sidelobe performance can be obtained at relative low hardware cost. Several numerical instances confirmed the effectiveness of the proposed method.
1. Introduction
In some antenna applications, we focus the antenna array with narrow beamwidth to increase the resolution while allow sacrificing some antenna gain, so a certain percentage of the elements can be removed from a periodic, fully populated array. This is commonly known as thinned array (TA). For the advantages in reducing weight, power, and cost, TA had been used in satellite communications, groundbased radars, radio astronomy, and so on [1]. Over the past few decades, a number of tools, such as the genetic algorithm (GA) [2–4], the ant colony optimization (ACO) [5], the particle swarm optimization (PSO) [6], the biogeographybased optimization (BBO) [7], IFT [8–10], and the almost difference set (ADS) based approach [11], had been employed for TA synthesizing. In particular, the IFT [9] and ADS [11] had been confirmed very effective for thinning large planar arrays.
Another kind of structure analogous to TA, which has the elements arbitrarily located within the antenna aperture and thereby provides more degree of freedom to achieve sidelobe suppression, is called sparse array (SA). Unfortunately, the synthesis for SA refers to a question of multiple constraints including the minimum element spacing, the antenna aperture, and the number of elements. Therefore, the use of stochastic optimization algorithms such as the simulated annealing [12], PSO [13], DE [14, 15], and GA [16] is not a computationally efficient way for the synthesis of the SA including many elements. During the past few years, the deterministic approaches, such as the IFT [8–10], the methodology by means of density taper [17], had been proposed. Most of this kind of methods require a priori estimate for the array performance as well as a predefined number of elements within a given aperture size; therefore, they cannot guarantee the array fitting desired power patterns with maximally reduced number of elements. Recently, a noniterative method for linear array based on the matrix pencil method (MPM) [18] is proposed and confirmed to be effective and computationally efficient in synthesizing the massively sparse arrays. More notably, the Bayesian compressive sensing (BCS) had been employed [19] to address the same issue. The reports in [19, 20] shown that the BCSbased approach allows the design of linear arrangement fitting desired power patterns with at least 35% elements reduced comparing to the regular array configuration. Furthermore, in order to synthesize the asymmetrical shaped beams, an advanced term of the BCS is applied in [21], which could deal with the SLA matching arbitrary reference patterns.
In this manuscript, the synthesis of uniformamplitude sparse linear array with many elements is considered. Naturally, the use of the stochastic method, typically as DE, always involves a large set of parameters and thereby requires high computational resources. To ease the impact, we propose a hybrid method that combines the IFT and DE (IFTDE) to address the issue. The method is based on DE with the individual parameters constituted by the element locations. Differently, unlike the conventional DE in which all the individual parameters are randomly initialized, for the assumption that the element spacing is not less than ( denotes the wavelength), most element locations of this method are predetermined by a uniform excited TLA with the lattices spaced at that obtained by the IFT, the first step of the IFTDE. Consequently, just a limited number of individual parameters that remain for DE are to be optimized. This will effectively narrow the solution space and thereby efficiently accelerate the convergence speed of DE.
The manuscript is mainly organized as follows. Section 2 describes the formulation of the proposed method. Section 3 provides a set of numerical examples to validate the effectiveness of the IFTDE. Finally, the conclusion of this work is summarized in Section 4.
2. Formulation of the Proposed Method
Consider a linear array with isotropic elements. The array factor can be expressed as follows [8]: where represents the th element excitation, and all the excitations are labeled as the collection . is the wavelength, and is the element spacing. , where denotes the angle measured from the broadside of the array.
The IFT in the proposed method is the same as that used in [10], which is a slight modification form to that presented in [8]. Therefore, the adaptively changed filling factor can be written as where refers to the step size when changes, is the iteration number with representing its maxima. When reaches its target value , can be written as
Accordingly, a single trial of the IFTDE can be divided into three steps, as are in turn described below.
Step 1. Perform the IFT to get a thinned linear array [8–10]. (1)Randomly initialize the element excitations over the lattices with probability of 0.9 equal to one and the rest equal to zero.(2)Compute the array factor from through points IFFT with .(3)Force the values in the sidelobe region of to match the predefined value that is obtained by trial and error.(4)Compute from through points FFT.(5)Truncate the samples of to samples that coincide with the total number of lattices.(6)For , set the samples which have higher amplitudes to be equal to 1, while others equal to 0.(7)Decrease with step size of so that in each iteration cycle, just one element is removed for asymmetrical array while in the opposite, two elements located in symmetrical positions are removed.(8)Repeat steps (2)–(7) until arrives at , then the iteration is terminated and a thinned array with filling factor of is obtained.
Step 2. Select the element locations that need to be optimized.
For the above thinned array, select the elements whose left or right spacing are greater than , and label their initial locations as the set , where refers to the maximum number. Figure 1 illustrates a thinned array including six elements with the lattices spaced at . The symbols of solid circle indicate the activated elements, while the symbols “×” describe the other way (Figure 1). It can be seen that the elements numbered in 3rd, 4th, 5th, and 6th, whose initial locations are in turn recorded by , , , and , are deemed to meet the aforementioned selection rule.
Step 3. The optimization for the selected element locations using DE. (1)Determine the lower and upper bounds for locations of the selected elements.Assume that a total of element locations need to be optimized with the initial value, and the lower and upper bounds for are, respectively, indicated by and . For the constraint that the minimum element spacing is not less than , the values of and are set to be determined as follows: It depicts that the maximum range of the adjacent elements moving in the opposite direction is set equal, and the minimum distance after the movement is . To illustrate the above restriction, still in Figure 1 as an example, the location ranges (described by the double arrows) for the elements numbered in 3rd, 4th, 5th, and 6th are given by the following set of inequalities (2)Perform DE.A conventional DE similar to that presented in [22] is used to find the SLA with minimum peak sidelobe level (PSLL), where the mutation strategy of DE/rand/1, as well as the operator of binomial crossover, is adopted. Once the overall steps are finished, the best fitness value so far is retained, and the method will proceed to the next trial until it reaches the maxima.
3. Numerical Examples
The proposed method is applied to the design cases similar to that taken from [3, 5, 8]. Therefore, the synthesis using the IFTDE refers to firstly obtaining a TLA with different filling factors based on a total of 200 or 100 lattices spaced at . In each numerical instance, the IFTDE is run for 100 independent trials. The sampling points of FFT are equal to 4096, and the initial parameters of DE, including the maxima of evolutionary generation, the population size, the scale factor, and the crossover probability, are equal to 20, 20, 0.7, and 0.9, respectively.
3.1. Comparing with the Reports Obtained by the IFT [8]
We consider synthesizing a symmetrical/asymmetrical SLA that is originally based on 200 lattices, symmetrical/asymmetrical TLA with different filling factors. The first case refers to synthesizing a symmetrical SLA through a symmetrical TLA with filling factor of 66%. The fitness convergence curve indicates that the optimal fitness value among 100 trials of IFTDE is obtained at trial number 94 (Figure 2(a). The farfield pattern, as is described in Figure 2(b), has the PSLL of −24.59 dB, about 1.73 dB sidelobe reduction compared with the report presented in [8], while the 3 dB beamwidth almost remained unchanged. To demonstrate the implementation process of the IFTDE, Figure 3 gives the element distribution of the thinned linear array originally obtained by the IFT, the first step of this method at the same trial. The plane structure, started from the first row to the tenth, and each row from the left to right, describes in turn the TLA’s element locations, where the “solid squares” indicate the activated elements whose locations need to be optimized. As we can see, there are a total of 38 elements whose locations remain to be optimized among 132 candidates, and these locations are confined in some lattices. Furthermore, when the method is thoroughly performed, the element distribution of the SLA can be described by the plane structure in Figure 4. We can see that the positions of the selected elements are no longer confined in the lattices but randomly located around them. However, the unselected elements are still located in their initial lattices.
(a)
(b)
Similarly, as far as a symmetrical TLA with a filling factor of 77% is originally concerned, the farfield pattern of the best symmetrical SLA among 100 trials of IFTDE shows 1 dB PSLL reduction compared with the report presented in [8], while the 3 dB beamwidth is almost unchanged. The third case considers an asymmetrical TLA with a filling factor equal to 39%. Figure 5(a) shows that the best sparse array is obtained at trial number 68 with the fitness value equal to −20.38 dB, about 3.0 dB lower than PSLL reported in [8]. However, the farfield pattern, as is depicted in Figure 5(b), only shows a beambroaden about 0.254 degrees. The element locations of this SLA are described in Figure 6. It indicates that a total of 33 elements had their locations being readjusted among the 78 activated elements.
(a)
(b)
The fourth example assumes an asymmetrical TLA that is 69.5% filled. The obtained SLA shows about 1.16 dB PSLL decrement with no sacrifice of beamwidth, as is compared to the value presented in [8].
3.2. Comparing with the Reports Obtained by GA and ACO [3, 5]
We first consider synthesizing a low sidelobe symmetrical SLA based on 100 lattices, symmetrical TLA with a filling factor of 80%. The PSLL of the sparse array obtained by IFTDE is equal to −20.52 dB, which is 1.7 dB lower than the reports using ACO [5]. More notably, when the filling factor decreased to 78% and 76%, the SLA obtained by the IFTDE, respectively, shows PSLL decrement about 2.4 dB and 3.0 dB, as is compared to the value given by GA [3]. Furthermore, for the purpose of comparison, all the above synthesis results using the IFTDE and that obtained by other tools are tabulated in Table 1. It indicates that through performing the proposed method, the SLA shows about 1~3 dB PSLL suppression without a notable tradeoff at the beamwidth. Therefore, the effectiveness of the IFTDE is confirmed.

All the aforementioned results are obtained by using a PC equipped with an 8 GB RAM as well as an Intel I76700 Processor that operates at 3.4 GHz, and the hardware cost is about an hour for each numerical instance.
4. Conclusion
The use of IFT could efficiently provide a thinned linear array with improved sidelobe performance. For the assumption that the element spacing is not less than half wavelength, most element locations of the thinned array are predetermined after performing the IFT. Therefore, the number of element locations needing to be optimized is largely reduced, which makes the solution space of DE greatly narrowed. Consequently, the low sidelobe SLA with many elements could be synthesized at relative low hardware cost. Some numerical results confirmed the effectiveness of the IFTDE in synthesizing large SLA at a faster convergence speed. Furthermore, by simple modification, the proposed method can also be extended to 2D arrays and thereby provides a candidate way for pattern synthesis of planar sparse arrays.
Data Availability
The data used to support the findings of this study are available from the corresponding author upon request.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
Acknowledgments
This work is supported in part by the National Natural Science Foundation of China under Grant nos. 61601272 and 61772398, in part by the Natural Science Foundation of Shaanxi Province under Grant no. 2016JM6068, in part by the scientific research plan of the Education Department of Shaanxi Province under Grant no. 15JK1147, and in part by the scientific research plan of Shaanxi University of Technology under Grant no. SLGQD1405.
References
 R. J. Mailloux, Phased Array Antenna Handbook, Artech House, Boston, Norwood, MA, 2nd edition, 2005.
 R. L. Haupt, “Thinned arrays using genetic algorithms,” IEEE Transactions on Antennas and Propagation, vol. 42, no. 7, pp. 993–999, 1994. View at: Publisher Site  Google Scholar
 G. K. Mahanti, N. Pathak, and P. K. Mahanti, “Synthesis of thinned linear antenna arrays with fixed sidelobe level using realcoded genetic algorithm,” Progress In Electromagnetics Research, vol. 75, pp. 319–328, 2007. View at: Publisher Site  Google Scholar
 L. Zhang, Y. C. Jiao, B. Chen, and H. Li, “Orthogonal genetic algorithm for planar thinned array designs,” International Journal of Antennas and Propagation, vol. 2012, Article ID 319037, 7 pages, 2012. View at: Publisher Site  Google Scholar
 O. QuevedoTeruel and E. RajoIglesias, “Ant colony optimization in thinned array synthesis with minimum sidelobe level,” IEEE Antennas and Wireless Propagation Letters, vol. 5, pp. 349–352, 2006. View at: Publisher Site  Google Scholar
 Q. Jiang, J. X. Chen, and D. Liu, “Binary inheritance learning particle swarm optimisation and its application in thinned antenna array synthesis with the minimum sidelobe level,” IET Microwaves, Antennas & Propagation, vol. 9, no. 13, pp. 1386–1391, 2015. View at: Publisher Site  Google Scholar
 S. K. Goudos and J. N. Sahalos, “Design of large thinned arrays using different biogeographybased optimization migration models,” International Journal of Antennas and Propagation, vol. 2016, Article ID 5359298, 11 pages, 2016. View at: Publisher Site  Google Scholar
 W. P. M. N. Keizer, “Linear array thinning using iterative FFT techniques,” IEEE Transactions on Antennas and Propagation, vol. 56, no. 8, pp. 2757–2760, 2008. View at: Publisher Site  Google Scholar
 W. Keizer, “Large planar array thinning using iterative FFT techniques,” IEEE Transactions on Antennas and Propagation, vol. 57, no. 10, pp. 3359–3362, 2009. View at: Publisher Site  Google Scholar
 X. K. Wang, Y. C. Jiao, and Y. Y. Tan, “Gradual thinning synthesis for linear array based on iterative Fourier techniques,” Progress In Electromagnetics Research, vol. 123, pp. 299–320, 2012. View at: Publisher Site  Google Scholar
 G. Oliveri, L. Manica, and A. Massa, “ADSbased guidelines for thinned planar arrays,” IEEE Transactions on Antennas and Propagation, vol. 58, no. 6, pp. 1935–1948, 2010. View at: Publisher Site  Google Scholar
 A. Trucco and V. Murino, “Stochastic optimization of linear sparse arrays,” IEEE Journal of Oceanic Engineering, vol. 24, no. 3, pp. 291–299, 1999. View at: Publisher Site  Google Scholar
 D. Liu, Q. Feng, W. B. Wang, and X. Yu, “Synthesis of unequally spaced antenna arrays by using inheritance learning particle swarm optimization,” Progress In Electromagnetics Research, vol. 118, pp. 205–221, 2011. View at: Publisher Site  Google Scholar
 D. G. Kurup, M. Himdi, and A. Rydberg, “Synthesis of uniform amplitude unequally spaced antenna arrays using the differential evolution algorithm,” IEEE Transactions on Antennas and Propagation, vol. 51, no. 9, pp. 2210–2217, 2003. View at: Publisher Site  Google Scholar
 S. K. Goudos, K. Siakavara, T. Samaras, E. E. Vafiadis, and J. N. Sahalos, “Sparse linear array synthesis with multiple constraints using differential evolution with strategy adaptation,” IEEE Antennas and Wireless Propagation Letters, vol. 10, pp. 670–673, 2011. View at: Publisher Site  Google Scholar
 K. Chen, H. Chen, L. Wang, and H. Wu, “Modified real GA for the synthesis of sparse planar circular arrays,” IEEE Antennas and Wireless Propagation Letters, vol. 15, pp. 274–277, 2016. View at: Publisher Site  Google Scholar
 O. M. Bucci and S. perna, “A deterministic two dimensional density taper approach for fast design of uniform amplitude pencil beams arrays,” IEEE Transactions on Antennas and Propagation, vol. 59, no. 8, pp. 2852–2861, 2011. View at: Publisher Site  Google Scholar
 Y. Liu, Z. Nie, and Q. H. Liu, “Reducing the number of elements in a linear antenna array by the matrix pencil method,” IEEE Transactions on Antennas and Propagation, vol. 56, no. 9, pp. 2955–2962, 2008. View at: Publisher Site  Google Scholar
 G. Oliveri and A. Massa, “Bayesian compressive sampling for pattern synthesis with maximally sparse nonuniform linear arrays,” IEEE Transactions on Antennas and Propagation, vol. 59, no. 2, pp. 467–481, 2011. View at: Publisher Site  Google Scholar
 P. Rocca, G. Oliveri, R. J. Mailloux, and A. Massa, “Unconventional phased array architectures and design methodologies—a review,” Proceedings of the IEEE, vol. 104, no. 3, pp. 544–560, 2016. View at: Publisher Site  Google Scholar
 G. Oliveri, M. Carlin, and A. Massa, “Complexweight sparse linear array synthesis by Bayesian compressive sampling,” IEEE Transactions on Antennas and Propagation, vol. 60, no. 5, pp. 2309–2326, 2012. View at: Publisher Site  Google Scholar
 P. Rocca, G. Oliveri, and A. Massa, “Differential evolution as applied to electromagnetics,” IEEE Antennas and Propagation Magazine, vol. 53, no. 1, pp. 38–49, 2011. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2018 XinKuan Wang and GuiBao Wang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.