Research Article  Open Access
D. Mandal, A. Chatterjee, A. K. Bhattacharjee, "Design of Fully Digital Controlled Shaped Beam Synthesis Using Differential Evolution Algorithm", International Journal of Antennas and Propagation, vol. 2013, Article ID 713680, 9 pages, 2013. https://doi.org/10.1155/2013/713680
Design of Fully Digital Controlled Shaped Beam Synthesis Using Differential Evolution Algorithm
Abstract
A shaped beam synthesis from a concentric ring array has been presented. Two different cases are considered. In the first case, a flattop beam pattern and, in the second case, a cosec^{2} beam pattern have been generated. In both the cases, it has been ensured that the obtained beam patterns are not restricted in any single predefined cut of the patterns; rather, their characteristics are retaining within a range of predefined planes with some minor variations. The desired beam pattern under each of the individual case is obtained by finding optimum discrete excitations of the array elements. The optimum 4bit amplitudes generated by fourbit digital attenuators and 5bit phases generated by 5bit digital phase shifters are computed using Differential Evolution (DE) Algorithm. To illustrate the effectiveness of DE, the two beam patterns with specified characteristics are computed from the same array using Particle Swarm Optimization (PSO) algorithm and Genetic algorithm (GA) by finding out optimum discrete excitations among the elements. Results clearly show the superiority of DE over PSO and GA to handle the presented problem.
1. Introduction
In mobile, satellite, and radar communication the important parameters are signal quality, system coverage, spectral efficiency, and so forth. To achieve these, efficient antenna design is the primary requirement. Antenna array synthesis is required to find radiation patterns from different array geometry and make these obtain patterns closer to their desired patterns either by varying its elements amplitude and phase or by reconfiguration of the array geometry. In various applications shaped beams are often required but major problems faced by shaped beams are high side lobe level and ripple. To minimize high sidelobe and ripple, an efficient evolutionary optimization algorithm has been chosen which is able to find out 4bit optimum discrete elements amplitude and 5bit optimum discrete phases of the array elements to achieve the desired shaped beam. Several approaches reported in the literature for generating shaped beams [1–6] are as follows.
Azevedo proposed a technique based on FFT to generate shaped beams of cosec and flattop pattern from a linear array antenna through the control of nonuniformly samples of the array factor, both in amplitude and phase [3]. Lei et al. generate low sidelobe cosecant squareshaped beam from linear antenna array by finding optimum amplitudes and phases of the array elements using the modified least square method [4]. Chatterjee et al. [5] proposed a technique based on finding optimum phases of the array elements modifying which over existing “zero” phases generates two different patterns. The search has been carried out using Gravitational Search Algorithm (GSA) [5]. In [6], a new technique has been proposed by Chatterjee et al. for obtaining dual beam pair where the states (“on/off”) of the array elements are modified using Firefly Algorithm (FA) for generating two different beam pairs. The method greatly simplified the design of the feed network [6].
The paper presents shaped beam synthesis of two ring concentric array of isotropic elements. Two different cases have been considered. In the first case a flattop beam is generated from the presented array by finding optimum 4bit amplitudes and 5bit phases, and in the second case a cosec^{2} pattern is generated from the same array by finding out another optimum 4bit amplitudes and 5bit phases of the elements. In both the cases the optimum discrete excitations are computed in such a manner that the obtained patterns are retaining their desired characteristics within a range of predefined planes with some minor variations. The optimum discrete amplitudes and phases for the two different cases are computed using Differential Evolution (DE) algorithm [7–11]. To illustrate the effectiveness of DE, the shaped beams under two different cases are computed separately following the above procedure from the same array configuration using Particle Swarm Optimization (PSO) [6, 9, 12] algorithm and Genetic Algorithm (GA) [12–16]. Results clearly show the effectiveness of DE over PSO and GA for both the design cases presented in this problem.
2. Problem Formulation
A concentric ring array of isotropic elements is considered. The far field pattern of the array shown in Figure 1 can be written as [6] where is the number of concentric rings; is the number of isotropic elements in th ring; is the excitation amplitude of th element; is the radius of the th ring; is the inter element arc spacing of th circle; , represents wave number; is the wave length; , is the polar and azimuth angle; is the angular location of the th element with ; and is the phase excitation of th element.
The fitness function for the shaped beam pattern is defined as follows: where is defined as In (2) and (3), plane.
In (2), is the unknown parameter set responsible for the desired beam pattern for the two different cases. is defined as follows: is the desired value of peak SLL for the two different cases. is the sidelobe region for the shaped beams of flattop and cosec^{2} patterns. in (2) represents the range of all “”, for the ripple parameter. The range of for the flattop beam is defined as −15° to +15°, and, for the cosec^{2} beam, the range of is defined as 0° to 30°. represent desired patterns under two different design cases for plane, shown in Figure 2. and are the weighting factors to give relative importance in each term of (2). The values of and are chosen as “one.” For synthesis of shaped beam pattern under two different design cases, the fitness function has to be minimized separately under each of the cases by computing optimum set of discrete 4bit and optimum set of discrete 5bit among the array elements.
The first part of (2) is proposed to reduce the peak SLL of the optimized beam pattern and second part is proposed to obtain the desired shape of the beam pattern while minimizing the value of .
In (2), represents the obtained maximum sidelobe level of the beam pattern within the prespecified range of plane for the unknown parameter set , which has to be determined. The term represents the deviation between the desired and obtained values of the peak SLL for the parameter set . The second part of (2), which is responsible for obtaining the desired shape of the beam pattern, is defined in (3). In (3), represents computed values of ripple parameter under different predefined cut of the beam pattern for the parameter set , and are the desired patterns shown in Figure 2. The term in (3) represent the deviations between these two parameters and finally their summation is computed to determine the total error in ripple under all predefined cuts within the entire range of for the parameter set . The minimization of minimizes the two different terms associated with (2), and hence the obtained beampattern approaches towards its desired one for the computed parameter set . In this manner, the fitness function of (2) serves the purpose of generating desired shaped beams while minimizing it individually under each of the design cases using DE, PSO, and GA.
3. Algorithm Overviews and Parametric Setup
3.1. Overview of Differential Evolution Algorithm
Differential Evolution (DE) algorithm was introduced by Storn and Price. Similar to GA [12–16], DE is also based on population. It is a stochastic optimization method used to minimize an objective function. It has an advantage to find out true global minima and fast convergence using a few control parameters [7–11]. DE algorithm generates a population of in dimensional search space called individuals. The individual of population in generation can be written as , . The initial population covered the entire search space. At a generation the initial value of the th parameter defined as follows: , where , . is uniformly distributed random variable within the range (0, 1); and are lower and upper bounds of th parameter. Three steps mutation, crossover and selection can be described as follows.
Mutation Operation. DE performs mutation operation to generate a mutant vector for each target vector . In this work, the DE strategy used is “DE/best/1/bin” which is defined as follows [7–10]: and . is a real and constant factor, satisfying and is the vector which has best fitness at th generation.
Crossover Operation. In this operation trial vector is generated from the target vector and mutant vector . The crossover strategy is defined follows:
Crossover factor CR is const in the range of (1, 0). The value of CR is taken as 0.2.
Selection. The operation performs comparison between the objective function values at each trial vector and target vector . The vector which has smaller fitness function value remains in the next generation. Selection operation can be expressed as
These three steps are repeated generation by generation until it reaches to its termination condition. Return the best vector in the current population as the solution of the optimization problem. The flow chart of Differential Evolution is given in Figure 3.
3.2. Details of Parametric Setup
The individuals of the population for DE, PSO, and GA are considered as The limits of the variables are defined as follows:
The value of in this problem becomes 30 and the search space dimension becomes 60.
Based on the guideline provided in [7–11], the population size, scale factor (), and crossover rate (CR) of DE are chosen as 50, 0.8, and 0.2. The DE scheme used is: “DE/best/1/bin” and the maximum iteration number is chosen as 3000.
Swarm size in PSO is taken as 50 and the initial population is chosen randomly. The values of and are chosen as 2 [6, 9]. Timevarying inertia weight () is considered as decreasing linearly from 0.9 to 0.4.
The maximum allowable velocity for each of the particle on th dimension is considered as [6, 9], where is the difference between the maximum and minimum possible values of decision variables on th dimension. The termination condition is chosen as a maximum iteration of 3000.
Population size in GA is taken as 50 and twopoint crossover is chosen. Crossover probability and mutation probability are taken as 0.08 and 0.01, “Roulette Wheel” Selection is considered for the proposed problem, and the termination condition is chosen as a maximum iteration of 3000. Other parametric setups of GA are taken from guidelines given in [12–16].
4. Simulation Results
A two ring concentric array of total 30 isotropic elements has been considered. The number of elements in each ring of the array is taken , where is the ring number.
The interelement spacing is considered as ; that is, , and the ring radii are computed as and . The presented results in this section are the best set of results obtained from 20 different runs of each of the algorithm for each individual case.
The design specifications of flattop beam patterns computed separately using DE, PSO, and GA and their corresponding obtained results in different planes are shown in Table 1. From Table 1, it can be seen that the obtained values of the design parameters using DE are better than PSO and GA for the flattop beam pattern.

Three different cuts of the obtained flattop beams, computed individually using DE, PSO, and GA are shown in Figure 4. In Figure 4, the presented cuts are 0 degree, 5 degrees, and 10 degrees. It can be ensured from Figure 4 that the obtained flattop beams are not restricted in any single plane within the prespecified range of . To observe the flattop beam patterns from a different plane which is outside its prespecified range (), a 15degree cut of the optimized beam patterns is presented in Figure 5. From Figure 5, it can be seen that the patterns are deviated from its desired flattop pattern of Figure 3, because they are not optimized for degree plane. The optimum 4bit amplitudes and 5bit phases of the array elements for the flattop beams computed individually using DE, PSO, and GA are shown in Table 2.

(a)
(b)
(c)
The design specification for cosec^{2} beam patterns (Case II) and their corresponding obtained results in three different planes are shown in Table 3. From Table 3, it can be observed that the performance of DE, in terms of computing the design parameters for cosec^{2} beam pattern, is better than PSO and GA.

Figure 6 shows three different cuts of the obtained cosec^{2} beam patterns, computed individually using DE, PSO, and GA. In Figure 6, the presented cuts of the optimized cosec^{2} beam patterns are 0 degree, 5 degrees, and 10 degrees.
(a)
(b)
(c)
Figure 7 shows a 15degree cut of the optimized cosec^{2} beam patterns which clearly shows deviation from its desired cosec^{2} pattern of Figure 3, because they are not optimized for degree plane. The optimum 4bit amplitudes and 5bit phases of the array elements for the cosec^{2} beams computed individually using DE, PSO, and GA are shown in Table 4.

The comparative performance of DE, PSO, and GA for the two different cases of design problem is shown in Table 5. Lowest mean fitness value of DE over PSO and GA proves itself best performing algorithm over PSO and GA.

The convergence characteristics of the three algorithms for the two different cases of the presented problem are shown in Figure 8. From Figure 8(a), it can be noticed that the convergence of DE is better than PSO and GA in terms of minimizing the fitness function of (2) for the flattop beam pattern. Similarly, Figure 8(b) clearly shows better convergence of DE over PSO and GA in terms of minimizing the fitness function of (2) for the cosec^{2} beam pattern.
(a)
(b)
Table 6 shows the values obtained through Wilcoxon’s rank sum test [12, 17] between DE, PSO, and GA for two different cases of design considerations. All the values are less than 0.05 (5% significant level) which is a strong proof against null hypothesis indicating that better final fitness value obtained by the best algorithm is statistically significant and has not occurred by chance.

5. Conclusions
Synthesis of shaped beam patterns from a concentric ring array antenna using Differential Evolution algorithm has been presented. For synthesis of shaped beam patterns, constrained side lobe and ripple are contemporarily taken into account by minimizing properly formulated fitness function using Evolutionary Algorithm based procedure. Presented method is capable of producing beam patterns, which retains their desired characteristics within a range of predefined planes with some minor variations. Results clearly indicate a good agreement between the obtained and desired one.
The presented method incorporates 4bit amplitudes of the array elements, which ensure that the dynamic range ratio (DRR) remains within the limit of 16 which is helpful for reliable design of the feed network. Discrete excitations also reduced the number of attenuators and the phase shifters and hence are capable of reducing the cost and complexity of the system.
The comparative performance of DE, PSO, and GA clearly shows the superiority of DE over PSO and GA in terms of finding optimum solutions for the presented problem. The quality of the solutions produced individually using DE, PSO, and GA for the two different cases of design considerations is analysed statistically and the superiority of DE is proven over PSO and GA for the proposed problem.
References
 C. A. Balanis, Antenna Theory, Analysis and Design, John Willy & Sons, New York, NY, USA, 2nd edition, 1997.
 R. S. Elliott, Antenna Theory and Design, John Wiley & Sons, New York, NY, USA, Revised edition, 2003.
 J. A. R. Azevedo, “Shaped beam pattern synthesis with nonuniform sample phases,” Progress in Electromagnetics Research B, vol. 5, pp. 77–90, 2008. View at: Google Scholar
 J. Lei, G. Fu, L. Yang, and D.M. Fu, “Wide band linear printed antenna array with low sidelobe cosecant squareshaped beam pattern,” Progress in Electromagnetics Research C, vol. 15, pp. 233–241, 2010. View at: Publisher Site  Google Scholar
 A. Chatterjee, G. K. Mahanti, and P. R. S. Mahapatra, “Design of fully digital controlled reconfigurable dualbeam concentric ring array antenna using gravitational search algorithm,” Progress in Electromagnetics Research C, vol. 18, pp. 59–72, 2011. View at: Google Scholar
 A. Chatterjee, G. K. Mahanti, and A. Chatterjee, “Design of a fully digital controlled reconfigurable switched beam concentric ring array antenna using firefly and particle swarm optimization algorithm,” Progress in Electromagnetics Research B, vol. 36, pp. 113–131, 2012. View at: Publisher Site  Google Scholar
 R. Storn and K. Price, “Differential evolution: a simple and efficient heuristic for global optimization over continuous spaces,” Journal of Global Optimization, vol. 11, no. 4, pp. 341–359, 1997. View at: Google Scholar
 K. V. Price, R. M. Storn, and J. A. Lampinen, Differential Evolution—A Practical Approach to Global Optimization. Natural Computing, Springer, New York, NY, USA, 2005.
 M. A. Panduro, C. A. Brizuela, L. I. Balderas, and D. A. Acosta, “A comparison of genetic algorithms, particle swarm optimization and the differential evolution method for the design of scannable circular antenna arrays,” Progress in Electromagnetics Research B, vol. 13, pp. 171–186, 2009. View at: Google Scholar
 S. Das, A. Abraham, U. K. Chakraborty, and A. Konar, “Differential evolution using a neighborhoodbased mutation operator,” IEEE Transactions on Evolutionary Computation, vol. 13, no. 3, pp. 526–553, 2009. View at: Publisher Site  Google Scholar
 J. Guo and J. Li, “Pattern synthesis of conformal array antenna in the presence of platform using differential evolution algorithm,” IEEE Transactions on Antennas and Propagation, vol. 57, no. 9, pp. 2615–2621, 2009. View at: Publisher Site  Google Scholar
 R. L. Haupt, “Introduction to genetic algorithms for electromagnetics,” IEEE Antennas and Propagation Magazine, vol. 37, no. 2, pp. 7–15, 1995. View at: Publisher Site  Google Scholar
 K. F. Man, K. S. Tang, and S. Kwong, “Genetic algorithms: concepts and applications,” IEEE Transactions on Industrial Electronics, vol. 43, no. 5, pp. 519–534, 1996. View at: Publisher Site  Google Scholar
 J. M. Johnson and Y. RahmatSamii, “Genetic algorithms in engineering electromagnetics,” IEEE Antennas and Propagation Magazine, vol. 39, no. 4, pp. 7–21, 1997. View at: Publisher Site  Google Scholar
 D. Marcano and F. Durán, “Synthesis of antenna arrays using genetic algorithms,” IEEE Antennas and Propagation Magazine, vol. 42, no. 3, pp. 12–20, 2000. View at: Publisher Site  Google Scholar
 M. A. Panduro, A. L. Mendez, R. Dominguez, and G. Romero, “Design of nonuniform circular antenna arrays for side lobe reduction using the method of genetic algorithms,” International Journal of Electronics and Communications, vol. 60, no. 10, pp. 713–717, 2006. View at: Publisher Site  Google Scholar
 M. Hollander and D. A. Wolfe, Nonparametric Statistical Methods, John Wiley & Sons, New York, NY, USA, 2nd edition, 1999.
Copyright
Copyright © 2013 D. Mandal et al. 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.