# Location Optimization for Square Array Antennas Using Differential Evolution Algorithm

Authors: Erkan Afacan
Journal: International Journal of Antennas and Propagation
 (2016)

---

## Abstract

In recent works thinned arrays giving minimum peak sidelobe levels for planar square antenna arrays are obtained using Hadamard difference sets. In the current work thinned array configurations giving lower peak sidelobe levels than those given in the literature are obtained for square arrays of6
×
6, 8
×
8, 12
×
12, and 16
×
16 elements. Differential evolution algorithm is used in the determination of the antenna locations.


---

## Body

## 1. Introduction

Thinned antenna arrays offer advantages of cost, weight, and power consumption. If the array elements are located periodically then it is difficult to control sidelobe level (SLL) effectively. One way of overcoming this problem is to place array elements aperiodically. So, a planar antenna array can be placed on a two-dimensional grid with equal spacing. For thinning, some of the antenna elements from the array are removed or turned off, and the remaining active elements are fed with equal amplitude currents.Since the synthesis problem for planar thinned arrays is complex and cannot be solved analytically, several global optimization algorithms are proposed in the literature such as simulated annealing [1], ant colony optimization [2], invasive weed optimization [3], genetic algorithm [4–7], particle swarm optimization [8, 9], differential evolution [10], and teaching learning based optimization algorithm [11].In [1], simulated annealing is applied to thinning and weighting of planar arrays with element numbers as large as 64
×
64. Ant colony optimization is applied to a 20
×
10 elements’ planar array in [2], and the SLLs in ϕ
=
0
° and ϕ
=
9
0
° planes are sought to be minimized. Invasive weed optimization which is inspired from the phenomenon of colonization of invasive weeds in nature is applied to a 20
×
10 elements’ planar array in [3].In [4] a 20
×
10 elements’ planar antenna array is optimized by using genetic algorithm and a thinned array filled 54% with 108 elements is obtained. Since the problem geometry is symmetric optimization is realized for a 10
×
5 elements’ antenna array in fact. A multiple agent optimization technique based on genetic algorithm is presented in [5]. Authors have reduced the multiobjective problem into a classical single objective one, so it has been possible to specify multiple constraints within the method. The proposed method is applied to 12
×
12 and 20
×
10 elements’ planar arrays. In [6] the same problem given in [4] is studied with modified real genetic algorithm and a thinned array filled 50% with 100 elements is obtained. A genetic algorithm based on orthogonal design is utilized to optimize the peak sidelobe level (PSLL) of a 20
×
10 elements’ planar array in [7].In [8] binary and real particle swarm optimizations are used to synthesize a 20
×
10 elements’ planar array with two different cost functions. In [9] a feedback based binary particle swarm optimization is proposed. The algorithm is applied to 6
×
6, 12
×
12, and 24
×
24 elements’ square arrays. The cost function is taken as a linear combination of PSLL and thinning percentage.Differential evolution (DE) algorithm is a widely used algorithm in antenna array synthesis problems for linear [12–19], circular [20–22], planar [10, 23–25], and conformal arrays [26]. DE is also applied to Yagi-Uda antennas in [27, 28].In [12], DE algorithm is applied to the synthesis of low sidelobe linear antenna arrays. Authors have shown that DE converges faster than real-coded genetic algorithm. DE algorithm is applied to the synthesis of uniform amplitude, unequally spaced linear arrays in [13]. Position-only, phase-only, and position-phase syntheses are considered and it is observed that position-phase synthesis gives better results than two others. The effect of element spacing and element number on SLL is investigated in detail. In [14], DE algorithm is used for linear array pattern synthesis with prescribed nulls at the direction of interferences while SLLs are kept below desired levels. Only the array element excitation amplitudes are controlled. A pattern synthesis method based on DE is proposed for uniform amplitude thinned linear phased arrays in [15]. The locations and phase excitations of the thinned array elements are optimized. Reduction of grating lobes and minimization of SLLs are aimed at while keeping the main beam pointed to the desired direction. In [16], time modulation is used for the design of unequally spaced linear arrays. DE algorithm is adopted to optimize the positions and switch-on times of elements in the array, and SLLs and sideband levels are tried to be suppressed with beamwidth constraint. A dynamic DE algorithm with the best of random differential mutation is used in the synthesis of unequally spaced linear arrays in [17]. Position-only and position-phase syntheses are considered and lowest PSLLs are investigated. In [18], DE with strategy adaptation is applied to the sparse linear array synthesis. The goal of the optimization is taken as to suppress SLL by finding the optimum element positions and to set main lobe to a desired beamwidth. In [19], composite DE with eigenvector base crossover is applied to shaped beam pattern synthesis problem for linear arrays and for a conformal cylindrical array.In [20], a numerical approach based on DE algorithm is proposed for the pattern synthesis of concentric ring array antennas with the constrained first null beamwidth. It is shown that the method gives lower PSLLs with the optimization of ring spacing and element number in each ring. A modified form of DE called DE with global and local neighborhoods is used for designing a thinned concentric planar circular antenna array in [21]. Reducing SLL and increasing the number of switched-off elements are aimed at. It is shown that any desired SLL value can be obtained while maintaining the number of switched-off elements at a reasonable value. In [22], a synthesis method for shaping beam pattern of a concentric ring array antenna using DE and genetic algorithm is proposed. Authors have shown that both methods are capable of generating the desired shaped beams.In [10], a Boolean differential evolution algorithm based on Boolean algebra is proposed. The method has only one control parameter which is the crossover rate. Authors have applied the method to 6
×
6 and 10
×
10 elements’ square arrays, and they have sought the minimum PSLL without the constraint of thinning percentage. The method is also applied to a 20
×
10 elements’ planar array with a different cost function which is the sum of the maximum SLLs in ϕ
=
0
° and ϕ
=
9
0
° planes. In [23], DE algorithm and a binary-coded genetic algorithm are jointly applied to the minimization of the SLL in a 31
×
31 square planar array. It is shown that the SLL of the planar array can be decreased without a large change in directivity. An FFT-based synthesis method for generating dual radiation pattern from a rectangular planar array is presented in [24]. Array elements phases are modified while amplitudes are commonly shared. The FFT method is incorporated with self-adaptive DE algorithm. Different beam pairs having different PSLLs are investigated. The results obtained from self-adaptive DE, DE, and particle swarm optimization are compared with each other. In [25], fractal-based planar antenna array optimization using DE is considered. Sierpinski carpet fractal array concept is utilized and PSLL reduction and element number reduction by finding optimum element positions and amplitudes are aimed at.In [26], a synthesis method based on DE algorithm is presented for conformal antenna arrays in the presence of a platform. Element phases are determined by the scan angle and array geometry, and element amplitudes are optimized via DE so as to reduce SLLs to desired levels. In [27], DE is applied to the optimization of the geometric parameters of Yagi-Uda antennas. A hybrid DE algorithm is proposed which incorporates simplified quadratic interpolation in [28]. The method is applied to Yagi-Uda antennas and wideband patch antenna design.The modified teaching learning based optimization algorithm proposed in [11] is applied to 12
×
12 square array and 20
×
10 elements’ planar array.Difference sets [29–32] and hybrid methods [33–35] are also introduced for the optimization of planar arrays. In [32], the sidelobe control problem is directly tried to be solved by applying the properties of difference sets. In [29–31], Hadamard difference sets are used to obtain thinned arrays giving minimum SLLs for planar square antenna arrays.A hybrid approach which combines genetic algorithm and cyclic difference sets is proposed in [34]. Hadamard difference sets based method given in [29] is combined with a binary particle swarm optimization in [33]. The proposed hybrid approach is applied to 6
×
6, 12
×
12, and 24
×
24 square arrays. The authors have expressed the cost function as a weighted sum of the PSLL and thinning percentage. In [35], McFarland difference sets and a binary genetic algorithm are used for the synthesis of thinned rectangular arrays.In [36] thinned array configurations giving lower PSLLs than given in [29] were obtained for square arrays of 6
×
6 and 8
×
8 elements.In the current work thinned array configurations giving lower PSLLs than given in [29–31] are obtained for square arrays of 6
×
6, 8
×
8, 12
×
12, and 16
×
16 elements. For the given square arrays, under the constraints of given number of array elements, the optimum thinned array configurations are tried to be found. The obtained PSLLs are also found to be lower than given in [36] for square arrays of 6
×
6 and 8
×
8 elements. Differential evolution algorithm is used in the determination of the antenna locations.


## 2. The Geometry of the Problem

The planar antenna array under investigation is shown in Figure1. The array factor for this planar antenna array can be written as(1)
A
F
θ
,
ϕ
=
∑
n
=
1
N
α
n
e
j
2
π
x
n
sin
⁡
θ
cos
⁡
ϕ
e
j
2
π
y
n
sin
⁡
θ
sin
⁡
ϕ
.Here, α
n is the amplitude of the nth array element current and it takes the values of 1 or 0. A value of 1 for α
n means that the antenna element is turned on or active, and a value of 0 for α
n means that this antenna element is turned off or passive. N is the total number of antenna elements, and x
n and y
n denote the x and y coordinates of the nth element in wavelengths, respectively. The distance between grid points is assumed to be λ
/
2, where λ is the wavelength. The array factor given in (1) can be also expressed as a two-dimensional sum, but one- dimensional indexing is found to be more efficient from the programming point of view.Figure 1
Planar antenna array.The PSLL for the mentioned planar array can be written as(2)
P
SLL
=
max
θ
,
ϕ
∈
S
⁡
A
F
θ
,
ϕ
F
F
max
⁡
,where S is the sidelobe region and F
F
m
a
x is the peak of the main beam. To suppress the PSLL in all planes the cost function to be minimized may be chosen as(3)
f
=
P
SLL
.In this study, the minimization of the PSLLs is aimed at without any other constraint.


## 3. The Solution of the Problem with Differential Evolution Algorithm

In the solution of the problem, differential evolution algorithm is used. DE is a reliable and versatile, population based optimizer [37, 39, 40] and has been widely used in the solution of electromagnetic and antenna problems as mentioned above [10, 12–28, 38, 41, 42].Using a notation similar to that given in [39], the current population P
x consists of the acceptable vectors x
i
,
g:(4)
P
x
,
g
=
x
i
,
g
,
i
=
0
,
…
,
N
p
-
1
,
g
=
0
,
…
,
g
max
⁡
,
x
i
,
g
=
x
i
,
g
j
,
j
=
0
,
…
,
D
-
1
,where N
p is the number of the vectors in the population, D is the number of the parameters, i is the population index which runs from 0 to N
p
-
1,  g is the generation index running from 0 to g
m
a
x, and j is the parameter index which runs from 0 to D
-
1.After initialization, randomly chosen vectors are mutated and intermediate populationP
v
,
g is produced:(5)
P
v
,
g
=
v
i
,
g
,
i
=
0
,
…
,
N
p
-
1
,
g
=
0
,
…
,
g
max
⁡
,
v
i
,
g
=
v
i
,
g
j
,
j
=
0
,
…
,
D
-
1
, where v
i
,
g are mutant vectors. After the recombination of each vector in the current population with a mutant vector, a trial population P
u
,
g is obtained:(6)
P
u
,
g
=
u
i
,
g
,
i
=
0
,
…
,
N
p
-
1
,
g
=
0
,
…
,
g
max
⁡
,
u
i
,
g
=
u
i
,
g
j
,
j
=
0
,
…
,
D
-
1
.The population is randomly initialized at the beginning (i.e.,g
=
0). During or before the initialization upper and lower bounds can be specified for the parameters. The initialized population is mutated and recombined to produce the intermediate population. The mutation operator for DE is given as(7)
v
i
,
g
=
x
r
0
,
g
+
F
x
r
1
,
g
-
x
r
2
,
g
, where x
r
0
,
g, x
r
1
,
g, and x
r
2
,
g are three different and randomly chosen vectors and F is the scale factor.The crossover operation of DE can be shown as(8)
u
i
,
g
=
u
i
,
g
j
=
v
i
,
g
j
,
if
γ
≤
Cr
,
x
i
,
g
j
,
otherwise
, where C
r is the crossover probability (C
r
∈
[
0,1
]) and γ
∈
[
0,1
] is the outcome of a uniform random number generator. In DE each vector is crossed with a mutant vector.After crossover, the selection process is realized as follows:(9)
x
i
,
g
+
1
=
u
i
,
g
,
if
f
u
i
,
g
≤
f
x
i
,
g
,
x
i
,
g
,
otherwise
, where f is the cost function value.The control parameters for DE areN
p, F, and C
r. In [37], the following suggestion is given: N
p should be between 5
D and 10
D, and F
=
0.5 is a good choice for beginning, but if the population converges prematurely then F and/or N
p should be increased. C
r
=
0.9 or C
r
=
1.0 is advised as an initial choice. In [38], it is stated that a good initial choice is F
=
0.6. In the literature several values for these control parameters are used. After a moderate survey, Table 1 is obtained.Table 1
DE control parameters as used in the literature.
Reference
Np
F
Cr
[37]
[5
D, 10
D]
0.5
0.9 or 1.0
[12, 14, 16]
5
D
0.6
0.9
[15]
[4
D, 5
D
]
[0.5, 0.7]
[0.7, 0.9]
[17]
60
0.5
0.8
[18]
50
0.5
0.9
[19]
0.5
0.9
[20]
100
0.5
0.9
[22]
50
0.8
0.2
[23]
100
0.5
[24]
50
0.8
0.7
[25]
20
D
0.5
0.8
[27]
70
0.8
0.8
[28]
0.5
0.9
[38]
[3
D, 8
D]
[0.4, 1.0]
[0.3, 0.9]The cost function is chosen as given in (3) and the antenna configurations are searched which minimize the PSLLs.In the problem under consideration it is necessary to calculate sidelobe levels in 3 dimensions for0
≤
ϕ
<
36
0
° and 0
≤
θ
≤
9
0
°. This process brings a heavy computational burden. To speed up the calculations, the array factor is defined as a three-dimensional global variable and is calculated only once before the beginning of the iterations for generations and populations. So, a trade-off is maintained between memory and speed.


## 4. Numerical Results and Comparison with the Literature

At first, PSLLs are tried to be minimized for6
×
6 and 8
×
8 square arrays so as to be able to compare the results with [29, 30, 33, 36]. For the 6
×
6 square array the total number of active antenna elements is taken as N
=
15 and N
=
21. In a similar manner, for the 8
×
8 square array the total number of active antenna elements is taken as N
=
28 and N
=
36. The parameters of the differential evolution algorithm are taken as follows: scale factor F
=
0.6, crossover probability C
r
=
0.9, maximum number of generations g
m
a
x
=
200, and population size N
p
=
5
N. The selection of these parameter values is based on the literature [12, 14, 16] and on the experience of the author. After numerous experiments, the strategy “DE/rand/1/bin” has been found to be the most effective strategy. For each case at least 250 trials are run and the best result is chosen. The array configurations obtained at the end of the simulations are shown in Figures 2–5. PSLLs obtained in this work are compared with the values given in [29, 30, 33, 36] in Table 2. 6
×
6 planar antenna array is also investigated in [10] without the constraint of thinning percentage and a thinned array with 30 elements having a PSLL of -
16.64 dB is obtained. Since the element numbers used in this work and in [10] are different, it is not meaningful to compare the results.Table 2
Peak sidelobe levels for square arrays of6
×
6 and 8
×
8.
N (antenna number)
15
21
28
36
PSLL (dB) [29]
−10.18
−12.55
−12.46
−13.71
PSLL (dB) [30]
−12.59
−13.86
PSLL (dB) [33]
−13.06
PSLL (dB) [36]
−13.27
−16.11
−13.56
−15.76
PSLL (dB) [this work]
−14.40
−16.28
−17.64
−18.35Figure 2
Array configuration for 15 elements.Figure 3
Array configuration for 21 elements.Figure 4
Array configuration for 28 elements.Figure 5
Array configuration for 36 elements.Secondly, PSLLs are tried to be minimized for12
×
12 and 16
×
16 square arrays. The total number of active antenna elements is taken as N
=
66 and N
=
78 for the 12
×
12 square array and as N
=
120 and N
=
136 for the 16
×
16 square array. The parameters of the differential evolution algorithm are taken as given above. The array configurations obtained as a result of the simulations are shown in Figures 6–9. PSLLs are given in Table 3. In Table 3, the results given in [29, 31] are also presented for the purpose of comparison.Table 3
Peak sidelobe levels for square arrays of12
×
12 and 16
×
16.
N (antenna number)
66
78
120
136
PSLL (dB) [29]
−14.91
−15.47
−15.71
−15.17
PSLL (dB) [31]
−16.59
−16.60
PSLL (dB) [this work]
−19.49
−20.55
−20.08
−21.08Figure 6
Array configuration for 66 elements.Figure 7
Array configuration for 78 elements.Figure 8
Array configuration for 120 elements.Figure 9
Array configuration for 136 elements.In [5], for 12
×
12 planar array, a configuration is obtained consisting of 64 active elements with a PSLL of -
24.56 dB. Since in the mentioned work, weighting of the array element amplitudes is also allowed, it is not unexpected that the PSLL for 64 active elements is less than the PSLL for 66 active elements without amplitude weighting given in this work.From Tables2 and 3, it is seen that there is a significant decrease for PSLLs. Three- dimensional radiation pattern for the 136 elements’ antenna array configuration given in Figure 9 is shown in Figure 10.Figure 10
Three-dimensional radiation pattern for 136 elements’ antenna array given in Figure9.For further reduction of the sidelobe level, time modulation can be applied as a second step. For example, in [43] time modulation is applied to a 15-element antenna array and it is found that the peak sidelobe can be lowered to −16.00 dB.


## 5. Conclusion

In this work it is shown that it is possible to obtain planar square antenna array configurations having lower peak sidelobe levels than given in the literature by using differential evolution algorithm. The methods based on difference sets are rigorous but limited to certain geometries, whereas global optimization algorithms such as differential evolution can be applied for arbitrary array configurations.



---

*Source: 1956047-2016-05-10.xml*