Professional Documents
Culture Documents
Research Article: Nonuniformly Spaced Linear Antenna Array Design Using Firefly Algorithm
Research Article: Nonuniformly Spaced Linear Antenna Array Design Using Firefly Algorithm
Research Article: Nonuniformly Spaced Linear Antenna Array Design Using Firefly Algorithm
Research Article
Nonuniformly Spaced Linear Antenna Array Design Using Firefly
Algorithm
Copyright 2012 M. A. Zaman and Md. Abdul Matin. 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.
A nonuniformly spaced linear antenna array with broadside radiation characteristics is synthesized using firefly algorithm and
particle swarm optimization. The objective of the work is to find the optimum spacing between the radiating antenna elements
which will create a predefined arbitrary radiation pattern. The excitation amplitudes of all the antenna elements are assumed to be
constant. The optimum spacing between the array elements are obtained using firefly algorithm. The minimum allowed distance
between the antenna elements is defined in such a way that mutual coupling between the elements can be ignored. Numerical
analysis is performed to calculate the far-field radiation characteristics of the array. Two numerical examples are shown to form
two dierent desired predefined radiation patterns. The performance of the firefly algorithm and particle swarm optimization is
compared in terms of convergence rate and global best solution achieved. The performances of the optimized nonuniformly spaced
arrays are analyzed. Finally, contour plots of the radiated power from the optimized array in the horizontal plane and vertical plane
in the far-field region are provided.
Figure 2: Coordinate system and three dimensional geometry of It can be noted that, when the obtained radiation pattern
the array. matches with the desired pattern, the cost function and the
fitness function have zero values. When the patterns do not
match, the cost function has positive values and the fit-
Here, k is wave number = 2/ and is wavelength of ness function has negative values. Large deviations result is
radiation. high positive cost values and high negative fitness values. So,
Using (1), (2), and (3), the overall radiation pattern is the goal of the optimization process is to minimize the cost
given by function or maximize the fitness function by finding appro-
priate values of dn .
1
M
FF , = sin cos kdn cos . (4)
N n=1 3. Overview of Firefly Algorithm
In this paper, the objective is to find optimum values of FA is an optimization algorithm inspired by behavior and
dn to produce a desired far-field radiation pattern. It is noted motion of fireflies. It is a population-based optimization al-
that for the given geometry and type of radiating elements gorithm which uses swarm intelligence to converge [17, 18].
chosen, dn does not aect the field variation with . So, for It is similar to other optimization algorithms employing swa-
optimization process is carried out at = 90 plane only. rm intelligence such as PSO and ABC. But FA is found to have
Desired radiation pattern must be defined to measure the superior performance in many cases [19].
performance of the array. Since two dierent designs are to FA initially produces a swarm of fireflies located ran-
be implemented using the proposed method, two dierent domly in the search space. The initial distribution is usually
desired patterns are defined as follows: produced from a uniform random distribution. The position
of each firefly in the search space represents a potential solu-
0 dB, BW BW tion of the optimization problem. The dimension of the
<< ,
FFdes,1 90 , = 2 2 (5) search space is equal to the number of optimizing parameters
SLLdes , otherwise. in the given problem. The fitness function takes the position
of a firefly as input and produces a single numerical output
value denoting how good the potential solution is. A fitness
BW BW
0 dB, << , value is assigned to each firefly. The FA uses a phenome-
2 2
NL NH non known is bioluminescent communication to model the
FFdes,2 90 , = NLLdes , << , (6)
2 2 movement of the fireflies through the search space. The bri-
SLLdes , otherwise. ghtness of each firefly depends on the fitness value of that
firefly. Each firefly is attracted by the brightness of other fire-
Here, BW is desired main beamwidth, SLLdes is desired flies and tries to move towards them. The velocity or the pull
sidelobe level, NLLdes is desired null level, NS is desired a firefly towards another firefly depends on the attractive-
starting angular position of the null, and NE is desired ness. The attractiveness depends on the relative distance be-
ending angular position of the null. tween the fireflies. It can be a function of the brightness of
Equation (5) represents a desired radiation pattern with the fireflies as well. A brighter firefly far away may not be as
a prescribed SLL and beamwidth. Equation (6) represents a attractive as a less bright firefly that is closer. In each iterative
4 International Journal of Microwave Science and Technology
step, FA computes the brightness and the relative attractive- o is a constant taken to be 1. is another constant whose
ness of each firefly. Depending on these values, the positions value is related to the dynamic range of the search space.
of the fireflies are updated. After a sucient amount of The position of firefly is updated in each iterative step. If
iterations, all fireflies converge to the best possible posi- the brightness of pth firefly is larger than the brightness of the
tion on the search space. nth firefly, then the nth firefly moves towards the pth firefly.
The number of fireflies in the swarm is known as the pop- The motion is denoted by the following equation:
ulation size, P. The selection of population size depends on
the specific optimization problem. However, typically a pop- xn, new = xn, old + mn xp, old xn, old + (rand 0.5).
ulation size of 20 to 40 is used for PSO and FA for most appli- (15)
cations [14, 17]. For the current problem, the solution space
is M dimensional, where each dimension represents the posi- Here, rand is a random number between 0 and 1, taken
tion of an array element. The position of the nth firefly is de- from a uniform distribution. is a constant whose value
noted by a vector xn where, depends on the dynamic range of the solution space.
At each iterative step, the brightness and the attractive-
xn = xn1 , xn2 , xn3 , . . . , xnm , . . . , xnM . (9) ness of each firefly is calculated. The brightness of each firefly
is compared with all other fireflies and the positions of the
Here, n = 1, 2, 3 P and m = 1, 2, 3, . . . , M. fireflies are updated using (15). After a sucient number of
The search space is limited in mth dimension by the iterations, all the fireflies converge to the same position in the
following inequality: search space and the global optimum is achieved.
m m
xLow < xnm < xHigh . (10) 4. Numerical Simulation and Results
m m
The value of the variables xLow and xHigh depend on For numerical simulations, a N = 20 element NUSLA is
the optimization problem. For the current NUSLA synthesis considered. As symmetry about the origin is assumed, only
problem, these variables represent minimum allowed and the position of M = 10 elements located on the positive x-
maximum allowed separation distance of consecutive array axis needs to be optimized. The population size is taken to
elements. Initially, the positions of the fireflies are generated be 40 and maximum number of iterations is limited to 65.
from a uniform distribution using the following equation: The search space is bounded by defining the minimum and
maximum separation between two consecutive elements to
m
xnm = xLow m
+ xHigh m
xLow rand. (11) be 0.35 and 0.9, respectively, implying the solution space
limiting variables defined in (10) have the following values:
Here, rand is a uniform random variable with values m
xLow = 0.35,
ranging from 0 to 1. The value of rand is dierent for each (16)
m
value of m and n. Equation (11) generates random values xHigh = 0.9.
from a uniform distribution within the prescribed range
defined by (10). The initial distribution does not significantly For m = 1, 2, . . . , M. The limiting values in all dimensions of
aect the performance of the algorithm. Each time the the solution space are assumed to be the same. These values
algorithm is executed, the optimization process starts with are selected so that mutual coupling between the elements
a dierent set of initial points. However, in each case, the remains negligible [16]. The dynamic range of the search
algorithm finds the optimum solution. In case of multiple space is 0.9 0.35 = 0.55. is taken to be 80% of the
possible sets of solutions, the algorithm may converge on dynamic range initially and the value is linearly decreased to
dierent solutions each time. But each of those solutions will zero at maximum iteration number. The parameter is taken
be valid as they all will satisfy the design requirements. to be equal to the dynamic range. So,
The brightness of the nth firefly, In is given by
m m
= 0.8 xHigh xLow ,
In = ffitness (xn ). (12) m m
(17)
= xHigh xLow .
The attractiveness between the nth and pth firefly, np The parameters of the first desired radiation pattern
given by [17] defined by (5) are selected as
2
np = o exp rnp . (13) BW < 13.4 ,
(18)
SLLdes = 23.5 dB.
Here, rnp is Cartesian distance between xn and xp given
by These values are selected based on typical beamwidth
and SLL values of 20 element linear antenna array [16].
From multiple trial runs of the optimization algorithm, it
M
2
rnp = xn xp = xnm xm
p . (14) was verified that these were the lowest possible values of
m=1 beamwidth and SLL.
International Journal of Microwave Science and Technology 5
Table 1: Optimized position of the array elements for the first design example.
Element number, n 1 2 3 4 5 6 7 8 9 10
FA 0.189 0.540 0.934 1.292 1.726 2.141 2.639 3.173 3.899 4.634
Position, dn /
PSO 0.239 0.857 1.362 1.929 2.576 3.193 3.881 4.762 5.662 6.397
SLLdes = 20 dB 15
Table 2: Optimized position of the array elements for the second design example.
Element number, n 1 2 3 4 5 6 7 8 9 10
FA 0.214 0.689 1.087 1.504 2.018 2.578 3.045 3.805 4.449 5.106
Position, dn /
PSO 0.219 0.654 1.125 1.539 2.176 2.666 3.236 3.950 4.478 5.083
0 0
5
100
10
15
20
300 25
30
400
35
40
500
45
50
10 20 30 40 50 60 0 20 40 60 80 100 120 140 160 180
Iteration number Angle, (deg)
satisfy the design criterion very well. The results from PSO
20 maintain the desired pattern for the most part, with only a
25
few sidelobes exceeding the limit. This implies that PSO has
not converged perfectly. This fact can be further illustrated
30
by observing the fitness function values. This is shown in
35 Figure 8. Again, the superior performance of FA compared
40 to PSO can be observed by the sharper slope of the blue
curve compared to the red curve. The maximum fitness value
45
achieved for FA is 0.1456, whereas this value is 82.223. FA
50 clearly outperforms PSO in terms of convergence rate and
0 20 40 60 80 100 120 140 160 180
Angle, (deg)
maximum fitness value reached within a limited number of
iterations.
Figure 6: Optimized radiation pattern of the NUSLA at = 90 Due to the presence of random number parameters in
plane obtained from FA algorithm for the second design example. FA and PSO, the results vary on each time the program
is executed. However, in all cases, the FA converges faster
than PSO. Since, PSO usually outperforms GA for antenna
array problems, it is expected that FA will outperform GA
by the sharper slope of the blue curve compared to the red as well. ABC usually requires over 100 iterations (with a
one. population size of 30 to 40) to reach convergence in antenna
Similar analysis was performed to synthesize NUSLA for array problems [7, 8]. So, it can be concluded that FA is a
the second desired radiation pattern. The second desired very fast converging algorithm.
pattern is characterized by two nulls located symmetrically Using the optimized position of the array elements,
around the main-lobe region. The optimum position of the normalized radiated power in the far-field zone of the
the array elements obtained from FA and PSO for the first antenna array is calculated for the first design problem.
desired radiation pattern is shown in Table 2. Equation (4) along with the fact that power varies at 1/r 2 is
International Journal of Microwave Science and Technology 7
0 1000 0
600 10
500
1000
200 30
1500
600 40
2000 1000 50
1000 600 200 200 600 1000
Distance, x/
10 20 30 40 50 60
Iteration number
Figure 10: Relative power at far-field region in the xz plane.
PSO
FA
beamwidth, and null requirements very well. The design
Figure 8: Fitness value versus iteration number for FA and PSO obtained from PSO satisfies most of the design requirements
algorithm for the second design problem. but it is outperformed by FA in terms of convergence rate
and obtained global best results. Also, a lower value of SLL is
1000 achieved using FA-based design method compared to other
0
similar arrays designed by GA. Overall, the FA is found to be
600
very suitable for NUSLA design compared to other existing
20 optimization-algorithm-based methods.
Relative power (dB)
Distance, y/
200
40 References
200
[1] C. A. Balanis, Antenna Theory Analysis and Design, John Wiley
60 & Sons, 3rd edition, 2005.
600 [2] C. A. Balanis, Modern Antenna Handbook, John Wiley & Sons,
2008.
[3] J. D. Kraus, R. J. Marhefka, and A. S. Khan, Antennas for all
1000 80
1000 600 200 200 600 1000 Applications, Tata McGraw-Hill, 3rd edition, 2007.
Distance, x/ [4] R. C. Hansen, Chapter 20: phased arrays, in Antenna Engi-
neering Handbook, J. L. Volakis, Ed., McGraw-Hill, 4th edition,
Figure 9: Relative power at far-field region in the xy plane. 2007.
[5] T. B. Chen, Y. B. Chen, Y. C. Jiao, and F. S. Zhang, Synthesis
of antenna array using particle swarm optimization, in Pro-
ceedings of the Asia-Pacific Microwave Conference (APMC 05),
used to calculate contour plots of normalized radiated power vol. 3, p. 4, December 2005.
at xy plane and xz plane. The plots are shown in Figures 9 [6] A. Recioui, A. Azrar, H. Bentarzi, M. Dehmas, and M. Chalal,
and 10. Synthesis of linear arrays with sidelobe reduction constraint
As the array elements are located along the x axis, using genetic algorithm, International Journal of Microwave
Figure 9 shows the broadside radiation characteristics of the and Optical Technology, vol. 3, no. 5, pp. 524530, 2008.
array. The same results are also seen from Figure 3. The [7] M. A. Zaman, S. A. Mamun, M. Gaar, S. M. Choudhury, and
power distribution in the xz plane resembles the radiation M. A. Matin, Phased array synthesis using modified particle
pattern of a dipole antenna. This is expected, as the array ele- swarm optimization, Journal of Engineering Science and Tech-
ments are dipoles and the array factor does not contribute to nology Review, vol. 4, no. 1, pp. 6873, 2011.
the field distribution at xz plane ( = 0 plane). [8] M. A. Zaman, M. Gaar, M. M. Alam, S. A. Mamun, and M. A.
Matin, Syntehsis of antenna arrays using artificial bee colony
optimization algorithm, International Journal of Microwave
5. Conclusion and Optical Technology, vol. 6, no. 4, pp. 234241, 2011.
[9] R. Harrington, Sidelobe reduction by nonuniform element
Two nonuniformly spaced linear antenna arrays are designed spacing, IRE Transactions on Antennas and Propagation, vol.
for two distinct design requirements. The radiation characte- 9, no. 2, pp. 187192, 1961.
ristics of the designed arrays are numerically evaluated. The [10] F. Hodjat and S. A. Hovanessian, Nonuniformly spaced linear
separations between the array elements are determined using and planar array antennas for sidelobe reduction, IEEE Trans-
firefly algorithm and PSO algorithm. It has been found that actions on Antennas and Propagation, vol. 26, no. 2, pp. 198
the design obtained from FA satisfies the predefined SLL, 204, 1978.
8 International Journal of Microwave Science and Technology
Rotating
Machinery
International Journal of
The Scientific
Engineering Distributed
Journal of
Journal of
Journal of
Control Science
and Engineering
Advances in
Civil Engineering
Hindawi Publishing Corporation Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014
Journal of
Journal of Electrical and Computer
Robotics
Hindawi Publishing Corporation
Engineering
Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014
VLSI Design
Advances in
OptoElectronics
International Journal of
International Journal of
Modelling &
Simulation
Aerospace
Hindawi Publishing Corporation Volume 2014
Navigation and
Observation
Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014
in Engineering
Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014
Engineering
Hindawi Publishing Corporation
http://www.hindawi.com Volume 2010
Hindawi Publishing Corporation
http://www.hindawi.com
http://www.hindawi.com Volume 2014
International Journal of
International Journal of Antennas and Active and Passive Advances in
Chemical Engineering Propagation Electronic Components Shock and Vibration Acoustics and Vibration
Hindawi Publishing Corporation Hindawi Publishing Corporation Hindawi Publishing Corporation Hindawi Publishing Corporation Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014