# Backtracking Search Optimization Algorithm for Synthesis of Concentric Circular Antenna Arrays

Authors: K. Guney; A. Durmus; S. Basbug
Journal: International Journal of Antennas and Propagation
 (2014)

---

## Abstract

A backtracking search optimization algorithm (BSA) is proposed for the synthesis of concentric circular antenna arrays (CCAAs) with the low sidelobe levels at a fixed beamwidth. Several numerical examples of CCAA patterns with the single, multiple, and broad nulls imposed at the directions of interference are also given to illustrate the performance and flexibility of the proposed algorithm. BSA is a relatively new population based evolutionary optimization algorithm. The numerical results show that the design of CCAA using BSA provides good sidelobe levels with a fixed beamwidth. The nulling patterns obtained by BSA are also very good. The quality of results obtained by the BSA is checked by comparing with that of several metaheuristic algorithms in the literature. BSA is also compared with differential search (DS) and bacterial foraging algorithms (BFA) in terms of iterative performances.


---

## Body

## 1. Introduction

It is well-known that the planar arrays have better control over the radiation pattern than the linear arrays. Besides other planar arrays such as circular and rectangular arrays, concentric circular antenna array (CCAA) has also become favourable in the radar and wireless communication systems. CCAA is capable of scanning electronically its main beam in the plane of the array without significant degradation of the array pattern. CCAA also has a good flexibility in terms of array pattern synthesis both in narrowband and in broadband applications [1–18].For the antenna array synthesis problems, traditional optimization techniques involve particular disadvantages, owing to the nonlinearity. Starting points of optimization process become important to obtain good solutions if the dimension of the solution space is increased. They have also tendency to convergence to local optimum solutions. Additionally, gradient search methods also need continuous and differentiable cost functions [1]. For this reason, in recent years, the metaheuristic techniques [1–3, 19–34] based on the genetic algorithm, ant colony optimization, particle swarm optimization (PSO), differential evolution, tabu search, clonal selection, bees algorithm, harmony search, plant growth simulation, seeker optimization, evolutionary programming (EP), and bacteria foraging optimization (BFO) have become more popular, and they have been used in solving antenna array pattern synthesis problems. In this paper, an alternative metaheuristic technique based on a backtracking search optimization algorithm (BSA) [35] is employed for the synthesis of CCAA with the low sidelobe levels at a fixed beamwidth. Furthermore, several numerical examples of CCAA patterns with the single, multiple, and broad nulls imposed at the directions of interference are also presented. Additionally, in order to examine the computational performance of BSA, the convergence curve of BSA is compared with those of differential search (DS) [36] and bacterial foraging algorithm (BFA) [37].The main motivation for the development of BSA is to achieve a simpler and more effective search algorithm [35]. Unlike many optimization algorithms, BSA has a single control parameter. Moreover, the problem solving performance of BSA is not oversensitive to the initial value of this parameter. BSA has a simple structure that is effective, fast, and capable of solving multimodal problems and that enables it to easily adapt to different numerical optimization problems. In [35], BSA was statistically compared with PSO, artificial bee colony algorithm (ABC), covariance matrix adaptation evolution strategy (CMAES), adaptive differential evolution algorithm (JDE), comprehensive learning particle swarm optimizer (CLPSO), and self-adaptive differential evolution algorithm (SADE). 75 boundary-constrained and three real-world benchmark problems were employed for the comparisons. In general, the simulations and comparisons in [35] showed that BSA can solve the benchmark problems more successfully than the compared algorithms. BSA was also used in [38] for circular antenna array design.The rest of the paper is organized as follows. In Section2, the general problem formulations for the synthesis of CCAA are given. A detailed explanation for the BSA is presented in Section 3. Numerical results are given in Section 4. Finally the conclusion of the paper is presented in Section 5.


## 2. Problem Formulation

Let us assume that a number of isotropic elements are placed in multiple concentric circular rings which differ in radius as illustrated in Figure1. There are M concentric circular rings in x-y plane and the mth ring has a radius r
m and the number of elements is N
m, where m
=
1,2
,
…
,
M. If the array elements are equally spaced within the ring, the azimuth angle from the x-axis for m
nth element is given by
(1)
ϕ
m
n
=
2
π
n
N
m
,
n
=
1,2
,
3
,
…
,
N
m
.
Thus, the array factor of the concentric circular antenna array can be formulated as follows:
(2)
AF
(
ϕ
)
=
I
c
+
∑
m
=
1
M
∑
n
=
1
N
I
m
n
e
j
(
k
r
m
[
cos
⁡
(
ϕ
-
ϕ
m
n
)
-
cos
⁡
(
ϕ
0
-
ϕ
m
n
)
]
)
,
where I
m
n is the excitation amplitude of the nth element in the mth ring and I
c is the excitation amplitude of the central element placed at the origin. In this paper, ϕ
0 is fixed to 0 for all optimization examples in order to direct the peak of the main beam to the x direction.Figure 1
Geometry of a concentric circular array.In this paper, we consider designing antenna arrays with the low maximum sidelobe level (MSL) at a fixed first null beamwidth (FNBW). Dynamic range ratio (DRR) is also considered in this paper since it is important for some practical considerations. Additionally, null steering on the sidelobe region is also studied in this paper. Thus, the following cost function is used:(3)
C
=
w
MSL
·
f
MSL
+
w
FNBW
·
f
FNBW
W
+
w
DRR
·
f
DRR
+
w
NULL
·
f
NULL
,
where w
MSL, w
FNBW, w
DRR, and w
NULL are the weight factors. f
MSL, f
FNBW, f
DRR, and f
NULL are the functions used for suppressing MSL, fixing FNBW, decreasing DRR, and locating nulls, respectively. The f
MSL function can be given as follows:
(4)
f
MSL
=
∫
-
π
ϕ
null
1
σ
MSL
(
ϕ
)
d
ϕ
+
∫
ϕ
null
2
π
σ
MSL
(
ϕ
)
d
ϕ
,
where ϕ
null
1 and ϕ
null
2 are the two angles at the first nulls on each side of the main beam. σ
MSL
(
ϕ
) can be formulated as follows:
(5)
σ
MSL
(
ϕ
)
=
{
ψ
o
(
ϕ
)
-
MSL
d
,
ψ
o
(
ϕ
)
>
MSL
d
0
,
elsewhere,
where ψ
o
(
ϕ
) is the array factor in dB and MSL
d is the desired MSL value. The function f
FNBW in (3) can be given by
(6)
f
FNBW
=
{
FNBW
o
-
f
fnbwmax
,
FNBW
o
>
f
fnbwmax
0
,
elsewhere
,
where FNBW
o and f
fnbwmax are the FNBW value obtained by BSA and the desired maximum FNBW, respectively. The function f
DRR can be given by
(7)
f
DRR
=
{
|
I
max
⁡
I
min
⁡
|
-
f
drrmax
,
|
I
max
⁡
I
min
⁡
|
>
f
drrmax
0
,
elsewhere,
where I
max
⁡ and I
min
⁡ are the maximum and minimum amplitude values of the antenna array elements obtained by the BSA, respectively. f
drrmax is the desired maximum DRR value. In a similar manner, f
NULL is given as follows:
(8)
f
NULL
=
{
(
NDL
o
-
NDL
d
)
2
,
if NDL
o
>
NDL
d
0
,
elsewhere.
NDL
o and NDL
d are the obtained and desired maximum null depth level (NDL) values, respectively. In this way, the cost function can manage the MSL, FNBW, DRR, and NDL values.


## 3. Backtracking Search Optimization Algorithm (BSA)

BSA [35] is one of the new population based evolutionary algorithms. It is based on an iterative process which tries to minimize the objective function. BSA consists of five evolutionary mechanisms: initialization, selection-I, mutation, crossover, and selection-II. The general flowchart of BSA is illustrated in Figure 2.Figure 2
General flowchart of BSA.


### 3.1. Initialization

BSA initially scatters the population members in the solution space by using a uniform random distribution function:(9)
P
i
,
j
~
U
(
low
j
,
up
j
)
,
i
=
1
,
2
,
3
,
…
,
N
,
j
=
1
,
2
,
3
,
…
,
D
,
where N and D are the population size and the problem dimension, respectively. U is the uniform distribution function and P
i is the position of the ith population member in the solution space. low
j and up
j in (9) are lower and upper bounds of solution space, respectively.


### 3.2. Selection-I

In the Selection-I stage, BSA generates the historical population utilized to determine the search direction. The following equation is used to initialize the historical population:(10)
o
l
d
P
i
,
j
~
U
(
low
j
,
up
j
)
.
The following equation gives a chance to BSA to redesign o
l
d
P at the beginning of each iteration:
(11)
if
a
<
b
then
o
l
d
P
∶
=
P
∣
a
,
b
~
U
(
0,1
)
,
where a and b are the uniform real numbers in the range of [
0,1
] in order to decide if the o
l
d
P is selected from previous generation. The following equation is used for shuffling the order of the population members:
(12)
o
l
d
P
∶
=
permuting
(
o
l
d
P
)
,
where the permuting
(
) function is a random shuffling function.


### 3.3. Mutation

The mutant members of BSA are generated by using the following function:(13)
Mutant
=
P
+
F
·
(
o
l
d
P
-
P
)
,
where F is a real number to control the step size amplification of the search direction. BSA employed historical data to determine the search direction of the population members by taking into account o
l
d
P values.


### 3.4. Crossover

The final form of the trial-populationT is generated by the crossover process of the BSA. The crossover process of the BSA is given in a pseudocode form in Algorithm 1. The crossover step includes two steps. The first strategy usesmixrate (Algorithm 1, lines 2–4). The second strategy allows only one randomly chosen individual to mutate in each trial (Algorithm 1, line 6). After the crossover process, the individuals may exceed the search space boundaries. In order to restrict the movement area of the individuals, the procedure given in Algorithm 2 is activated when needed. The restriction process provides a random regeneration in the valid search space for the individuals which exceed the boundaries.Algorithm 1:Crossover strategy of BSA.
Input: Mutant, mixrate, N and D.
Output:
T: Trial-Population.
(0)map
(
1
:
N
,
1
:
D
)
=
1
(1)if
a
<
b
∣
a
,
b
~
U
(
0,1
)   then
(2)for  i from 1 to N  do
(3)
map
i
,
u
(
1
:
⌈
mixrate
·
rnd
·
D
⌉
)
=
0
∣
u
=
permuting
(
(
1
,
2
,
3
,
…
,
D
)
)
(4)end
(5)else
(6)for
i from 1 to N
do, map
i
,
rand
i
(
D
)
=
0,  end
(7)end
(8)T
∶
=
Mutant
(9)for  i from 1 to N  do
(10)
for  j  from 1 to D  do
(11)if  map
i
,
j
=
1  then  T
i
,
j
∶
=
P
i
,
j
(12)
end
(13)endAlgorithm 2:Boundary control mechanism of BSA.
Input: T, Search sapce limits
Output:
T
for  i from 1 to N  do
for  j from 1 to D  do
if  (
T
i
,
j
<
low
j
) or  (T
i
,
j
>
up
j)  then
T
i
,
j
=
rnd
·
(
up
j
-
low
j
)
+
low
j
end
end
end


### 3.5. Selection-II

In selection-II process of BSA,P
i
s values are updated by a greedy selection strategy that uses T
i
s which have better fitness than the corresponding P
i
s values. Global minimum value is replaced by the best individual of P  (
P
best
) when P
best value is better than global minimum value. The detailed descriptions of BSA can be found in [35].


## 3.1. Initialization

BSA initially scatters the population members in the solution space by using a uniform random distribution function:(9)
P
i
,
j
~
U
(
low
j
,
up
j
)
,
i
=
1
,
2
,
3
,
…
,
N
,
j
=
1
,
2
,
3
,
…
,
D
,
where N and D are the population size and the problem dimension, respectively. U is the uniform distribution function and P
i is the position of the ith population member in the solution space. low
j and up
j in (9) are lower and upper bounds of solution space, respectively.


## 3.2. Selection-I

In the Selection-I stage, BSA generates the historical population utilized to determine the search direction. The following equation is used to initialize the historical population:(10)
o
l
d
P
i
,
j
~
U
(
low
j
,
up
j
)
.
The following equation gives a chance to BSA to redesign o
l
d
P at the beginning of each iteration:
(11)
if
a
<
b
then
o
l
d
P
∶
=
P
∣
a
,
b
~
U
(
0,1
)
,
where a and b are the uniform real numbers in the range of [
0,1
] in order to decide if the o
l
d
P is selected from previous generation. The following equation is used for shuffling the order of the population members:
(12)
o
l
d
P
∶
=
permuting
(
o
l
d
P
)
,
where the permuting
(
) function is a random shuffling function.


## 3.3. Mutation

The mutant members of BSA are generated by using the following function:(13)
Mutant
=
P
+
F
·
(
o
l
d
P
-
P
)
,
where F is a real number to control the step size amplification of the search direction. BSA employed historical data to determine the search direction of the population members by taking into account o
l
d
P values.


## 3.4. Crossover

The final form of the trial-populationT is generated by the crossover process of the BSA. The crossover process of the BSA is given in a pseudocode form in Algorithm 1. The crossover step includes two steps. The first strategy usesmixrate (Algorithm 1, lines 2–4). The second strategy allows only one randomly chosen individual to mutate in each trial (Algorithm 1, line 6). After the crossover process, the individuals may exceed the search space boundaries. In order to restrict the movement area of the individuals, the procedure given in Algorithm 2 is activated when needed. The restriction process provides a random regeneration in the valid search space for the individuals which exceed the boundaries.Algorithm 1:Crossover strategy of BSA.
Input: Mutant, mixrate, N and D.
Output:
T: Trial-Population.
(0)map
(
1
:
N
,
1
:
D
)
=
1
(1)if
a
<
b
∣
a
,
b
~
U
(
0,1
)   then
(2)for  i from 1 to N  do
(3)
map
i
,
u
(
1
:
⌈
mixrate
·
rnd
·
D
⌉
)
=
0
∣
u
=
permuting
(
(
1
,
2
,
3
,
…
,
D
)
)
(4)end
(5)else
(6)for
i from 1 to N
do, map
i
,
rand
i
(
D
)
=
0,  end
(7)end
(8)T
∶
=
Mutant
(9)for  i from 1 to N  do
(10)
for  j  from 1 to D  do
(11)if  map
i
,
j
=
1  then  T
i
,
j
∶
=
P
i
,
j
(12)
end
(13)endAlgorithm 2:Boundary control mechanism of BSA.
Input: T, Search sapce limits
Output:
T
for  i from 1 to N  do
for  j from 1 to D  do
if  (
T
i
,
j
<
low
j
) or  (T
i
,
j
>
up
j)  then
T
i
,
j
=
rnd
·
(
up
j
-
low
j
)
+
low
j
end
end
end


## 3.5. Selection-II

In selection-II process of BSA,P
i
s values are updated by a greedy selection strategy that uses T
i
s which have better fitness than the corresponding P
i
s values. Global minimum value is replaced by the best individual of P  (
P
best
) when P
best value is better than global minimum value. The detailed descriptions of BSA can be found in [35].


## 4. Numerical Results

In this paper, a CCAA which has three rings is synthesized by using BSA for all examples. The number of innermost, middle, and outermost rings has 4, 6, and 8 array elements, respectively. Additionally, CCAA with a central element is also considered. The main goal is to obtain array patterns having low MSL and narrow FNBW values. DRR is also taken into account for the practical considerations. In order to test the flexibility of the algorithm, single, double, triple, and wide nulls on the sidelobe region of the pattern are also located by using BSA. The distances between two elements in the innermost, middle, and outermost rings are 0.55λ, 0.606λ, and 0.75λ, respectively. The population sizes of BSA for the all examples in this section are set to 30. The maximum iteration number is selected as 5000. The special parameter of BSA mixrate is fixed to 1. Step size amplification is determined as F
=
3
·
rndn, where rndn
~
N
(
0,1
). The optimization processes are carried on a computer which has 2.8 GHz i7 processor and 4 GB RAM. The software used for the optimization implementations of BSA is MATLAB.To show the performance and flexibility of the proposed BSA on the CCAA pattern synthesis, comprehensive comparisons have been made in this paper. In these comparisons, the results of BSA are compared with the results of nine different algorithms from the literature [1–3]. These algorithms are EP [1], PSO [1], PSO with constriction factor and inertia weight approach (PSOCFIWA) [1], canonical PSO (CPSO) [2], real coded genetic algorithm (RGA) [2], craziness based PSO (CRPSO) [2], hybrid evolutionary programming (HEP) [2], BFO [3], and binary coded genetic algorithm (BGA) [3]. In order to properly compare the results of BSA with the results of the other nine algorithms [1–3], the desired MSL, FNBW, and DRR values are chosen to be similar to those of nine algorithms presented in [1–3].The CCAA considered for the first group of examples does not have a central array element. BSA is employed to achieve a pattern which has low MSL and narrow FNBW values. The DRR values of the CCAAs are also considered in the cost function in the same optimization process. The array patterns obtained by BSA used in this paper are compared with the patterns of EP [1], PSO [1], PSOCFIWA [1], CPSO [2], RGA [2], CRPSO [2], HEP [2], BFO [3], and BGA [3] in Figures 3–11, respectively. The MSL, FNBW, and DRR values obtained by BSA and the other nine algorithms are given in Table 1. It is apparent from Figures 3–11 and Table 1 that MSL, FNBW, and DRR values of the patterns produced by using BSA are better than those of EP [1], PSO [1], PSOCFIWA [1], CPSO [2], RGA [2], CRPSO [2], HEP [2], BFO [3], and BGA [3]. The amplitude values calculated by BSA for the patterns presented in Figures 3–11 are given in Table 2.Table 1
MSL, FNBW, and DRR values obtained by BSA and other optimization techniques EP [1], PSO [1], PSOCFIWA [1], CPSO [2], RGA [2], CRPSO [2], HEP [2], BFO [3], and BGA [3] for CCAAs without central elements.
Figures
Algorithms
MSL (dB)
FNBW (degree)
DRR
Figure3
BSA
−33.74
76.36
10.2775
EP [1]
−31.90
78.50
18.8021
Figure4
BSA
−29.49
71.79
13.6986
PSO [1]
−27.18
72.24
Inf.
Figure5
BSA
−30.60
76.45
3.5063
PSOCFIWA [1]
−28.48
78.10
3.6062
Figure6
BSA
−31.65
74.56
4.6577
CPSO [2]
−28.96
76.30
4.8876
Figure7
BSA
−31.00
77.00
3.4374
RGA [2]
−28.06
77.10
3.4435
Figure8
BSA
−32.15
76.00
4.1999
CRPSO [2]
−29.88
76.40
4.4309
Figure9
BSA
−33.71
76.26
8.2850
HEP [2]
−32.86
77.00
11.6875
Figure10
BSA
−32.51
75.30
4.8008
BFO [3]
−29.96
75.80
4.8112
Figure11
BSA
−30.02
72.64
5.1706
BGA [3]
−26.14
73.60
5.3419Table 2
The amplitude values calculated by BSA for CCAAs without central element.
Figures
I
11
,
I
12
,
I
13
,
…
,
I
1
m
Figure3
0.1040
0.6725
0.0973
0.6684
0.4152
0.4148
0.9981
0.4169
0.4174
1.0000
0.4878
0.7053
0.4874
0.2360
0.4903
0.6984
0.4907
0.2361
Figure4
0.0781
0.4107
0.0730
0.4994
0.3233
0.3093
0.9764
0.3223
0.3400
1.0000
0.5015
0.6399
0.4534
0.1616
0.4278
0.6272
0.4793
0.1639
Figure5
0.2852
0.7856
0.2852
0.7476
0.4960
0.5103
1.0000
0.4939
0.5009
1.0000
0.5051
0.7743
0.4738
0.2852
0.5366
0.7876
0.4881
0.2852
Figure6
0.2147
0.6903
0.2147
0.7269
0.4364
0.4331
1.0000
0.4444
0.4373
1.0000
0.5113
0.7518
0.5219
0.2147
0.4923
0.7815
0.5063
0.2147
Figure7
0.2771
0.7591
0.2772
0.7643
0.4932
0.4922
0.9525
0.4923
0.4933
0.9525
0.4695
0.7605
0.4684
0.2771
0.4701
0.7618
0.4712
0.2771
Figure8
0.2381
0.7398
0.2381
0.7469
0.4688
0.4630
1.0000
0.4659
0.4716
1.0000
0.4978
0.7682
0.4979
0.2408
0.4988
0.7737
0.4987
0.2381
Figure9
0.1207
0.6684
0.1207
0.6819
0.4195
0.4125
1.0000
0.4126
0.4196
0.9985
0.4844
0.7186
0.4867
0.2371
0.4868
0.7177
0.4844
0.2328
Figure10
0.2083
0.7207
0.2083
0.7074
0.4338
0.4440
1.0000
0.4436
0.4333
1.0000
0.5027
0.7597
0.5001
0.2104
0.4996
0.7581
0.5022
0.2208
Figure11
0.1934
0.6853
0.1934
0.6859
0.4335
0.4330
1.0000
0.4321
0.4326
1.0000
0.4947
0.7988
0.4946
0.1934
0.4957
0.7976
0.4958
0.1934Figure 3
The radiation patterns obtained by BSA and EP [1] for CCAA without central element.Figure 4
The radiation patterns obtained by BSA and PSO [1] for CCAA without central element.Figure 5
The radiation patterns obtained by BSA and PSOCFIWA [1] for CCAA without central element.Figure 6
The radiation patterns obtained by BSA and CPSO [2] for CCAA without central element.Figure 7
The radiation patterns obtained by BSA and RGA [2] for CCAA without central element.Figure 8
The radiation patterns obtained by BSA and CRPSO [2] for CCAA without central element.Figure 9
The radiation patterns obtained by BSA and HEP [2] for CCAA without central element.Figure 10
The radiation patterns obtained by BSA and BFO [3] for CCAA without central element.Figure 11
The radiation patterns obtained by BSA and BGA [3] for CCAA without central element.Moreover, the convergence curve of BSA is compared with those of DS [36] and BFA [37] for the first example represented by Figure 3. The maximum iteration number and the population number for all three algorithms are 700 and 50, respectively. Whereas DS algorithm does not need any extra parameter definition, the algorithm parameters of BFA are set as follows: number of chemotactic steps is 175, length of swim is 4, number of reproduction steps is 4, number of elimination-dispersal events is 1, and length of run is 0.4. Figure 12 shows the convergence curves of BSA, DS, and BFA for the first example in the first group of examples. From Figure 12, it is clearly seen that BSA can converge the better cost function value at the end of the iteration than DS and BFA.Figure 12
The convergence curves of BSA, DS, and BFA.For the second group of examples, the CCAA with central array element is considered. Figures13–17 show the patterns obtained by BSA. For a comparison, the patterns achieved by EP [1], PSOCFIWA [1], PSO [1], BFO [3], and BGA [3] are also included in these figures. The MSL, FNBW, and DRR values obtained by BSA are compared with those of EP [1], PSOCFIWA [1], PSO [1], BFO [3], and BGA [3] in Table 3. As it can be seen from Figures 13–17 and Table 3, all MSL and FNBW values achieved by BSA are better than those of the compared algorithms in [1] and [3]. Additionally, the DRR values calculated by BSA are better than those of EP [1], PSOCFIWA [1], BFO [3], and BGA [3]. On the other hand, the DRR value obtained by BSA used in this paper is the same with that of PSO [1]. The amplitude values calculated by BSA for the patterns presented in Figures 13–17 are given in Table 4.Table 3
MSLL, FNBW, and DRR values obtained by BSA and other optimization techniques EP [1], PSOCFIWA [1], PSO [1], BFO [3], and BGA [3] for CCAAs with central element.
Figures
Algorithms
MSL (dB)
FNBW (degree)
DRR
Figure13
BSA
−43.61
91.20
9.1827
EP [1]
−39.66
97.70
14.6883
Figure14
BSA
−35.20
79.14
5.5928
PSOCFIWA [1]
−32.62
80.00
Inf.
Figure15
BSA
−35.08
79.01
4.8054
PSO [1]
−30.08
82.37
4.8054
Figure16
BSA
−35.89
79.89
4.5005
BFO [3]
−34.18
81.50
4.8869
Figure17
BSA
−31.86
75.45
6.9589
BGA [3]
−29.06
78.30
7.0569Table 4
The amplitude values calculated by BSA for the CCAAs with central element.
Figures
I
11
,
I
12
,
I
13
,
…
,
I
1
m
–
I
c
Figure13
0.9568
1.0000
0.9578
0.9943
0.7376
0.7409
0.3565
0.7384
0.7350
0.3638
0.3929
0.5322
0.3880
0.1089
0.3897
0.5327
0.3945
0.1116
0.6245
Figure14
0.4145
0.9105
0.4301
0.8732
0.5958
0.6003
1.0000
0.5968
0.5827
0.9920
0.5586
0.8135
0.5638
0.2334
0.5498
0.8208
0.5350
0.2224
0.1788
Figure15
0.4773
0.9295
0.4877
0.9271
0.6335
0.6372
1.0000
0.6261
0.6221
1.0000
0.5653
0.8490
0.5546
0.2081
0.5582
0.8393
0.5722
0.2238
0.2081
Figure16
0.4941
0.9592
0.4931
0.9520
0.6350
0.6339
1.0000
0.6481
0.6484
0.9967
0.5606
0.8306
0.5669
0.2380
0.5807
0.8557
0.5763
0.2298
0.2222
Figure17
0.4790
0.8495
0.5000
0.8854
0.6077
0.5984
0.9927
0.5936
0.6035
1.0000
0.5593
0.8764
0.5433
0.1437
0.5215
0.8736
0.5375
0.1445
0.1485Figure 13
The radiation patterns obtained by BSA and EP [1] for CCAA with central element.Figure 14
The radiation patterns obtained by BSA and PSOCFIWA [1] for CCAA with central element.Figure 15
The radiation patterns obtained by BSA and PSO [1] for CCAA with central element.Figure 16
The radiation patterns obtained by BSA and BFO [3] for CCAA with central element.Figure 17
The radiation patterns obtained by BSA and BGA [3] for CCAA with central element.In the last group of examples, four synthesis examples are studied in order to examine the capability of BSA for steering single, multiple, and wide nulls on the sidelobe region of CCAA pattern. The amplitude values of array elements are controlled by BSA. A CCAA pattern with a single null imposed at 70° is considered as the first pattern nulling example. Figure18 shows the radiation pattern obtained by BSA. From Figure 18, it can be seen that NDL value at 70° is 106.9 dB and MSL value is −33 dB. For the second and third pattern nulling examples, double (70° and 108°) and triple (53°, 70°, and 109°) nulls are placed by using BSA on the sidelobe region of the CCAA pattern. Figures 19 and 20 show the patterns having double and triple nulls, respectively. For both examples, all NDL values are deeper than −85 dB and all MSL values are less than −30 dB. In the last example, a CCAA pattern with wide null at 75° with Δ
θ
=
10
° is synthesized by using BSA. Figure 21 illustrates the pattern achieved by BSA. From Figure 21, it can be seen that NDL value is −62 dB and MSL value is −30.1 dB. The amplitude values calculated by BSA for the patterns presented in Figures 18–21 are given in Table 5.Table 5
The amplitude values calculated by BSA for pattern nulling synthesis examples.
Figures
I
11
,
I
12
,
I
13
,
…
,
I
1
m
Figure18
0.1871
0.7106
0.1567
0.6932
0.4379
0.4480
1.0000
0.4338
0.4231
1.0000
0.4892
0.7669
0.4860
0.2315
0.4899
0.7194
0.4938
0.2399
Figure19
0.1459
0.7218
0.1877
0.7146
0.4559
0.4731
1.0000
0.4711
0.4810
0.9929
0.5301
0.6492
0.5558
0.2240
0.5390
0.7055
0.5268
0.2150
Figure20
0.2448
0.7762
0.2366
0.7750
0.5061
0.5109
0.9978
0.5004
0.4976
1.0000
0.5393
0.7340
0.5418
0.2109
0.5443
0.7325
0.5426
0.2175
Figure21
0.9247
0.9169
0.9288
1.0000
0.6720
0.8673
0.4502
0.5717
0.8955
0.3602
0.3792
0.4759
0.4940
0.1510
0.5172
0.4845
0.5198
0.2038;I
c
=
0.6767Figure 18
Radiation pattern obtained by amplitude-only control with one imposed null at 70°.Figure 19
Radiation pattern obtained by amplitude-only control with double imposed null at 70° and 108°.Figure 20
Radiation pattern obtained by amplitude-only control with triple imposed null at 53°, 70°, and 109°.Figure 21
Radiation pattern obtained by amplitude-only control with a broad null sector centered 75° withΔ
θ
=
10
°.From Figures3–11 and 13–17, it can be concluded that BSA is capable of synthesizing CCAA patterns with low MSL and narrow FNBW values. Besides, BSA can be used to achieve low DRR values within the same optimization process. Furthermore, according to Figures 18–21, it can be said that BSA has capacity to synthesize the CCAA patterns with low MSL values and single, double, triple, and wide nulls at the desired directions.


## 5. Conclusion

In this paper, BSA is used for the synthesis of CCAA patterns with the low sidelobe levels at a fixed beamwidth and patterns with the single, multiple, and broad nulls imposed at the directions of interference. It can be concluded that the design of CCAA using BSA provides good sidelobe levels and null depth levels with a fixed beamwidth. The comparisons made between the results obtained by BSA and several metaheuristic algorithms show that BSA is a very competitive algorithm for the synthesis of antenna array patterns. Additionally, the convergence curve comparison shows that BSA has better convergence characteristic than DS and BFA.



---

*Source: 250841-2014-09-04.xml*