International Journal of Microwave Science and Technology

Volume 2012 (2012), Article ID 256759, 8 pages

http://dx.doi.org/10.1155/2012/256759

## Nonuniformly Spaced Linear Antenna Array Design Using Firefly Algorithm

Department of Electrical and Electronic Engineering, Bangladesh University of Engineering and Technology, Dhaka 1000, Bangladesh

Received 31 October 2011; Revised 23 January 2012; Accepted 31 January 2012

Academic Editor: Ramon Gonzalo

Copyright © 2012 Mohammad Asif 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.

#### Abstract

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 different 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.

#### 1. Introduction

Multiple antennas can be arranged in space in various geometrical configurations to form an antenna array with highly directive radiation pattern [1, 2]. The radiation characteristics of the antenna array depend on some input parameters. These parameters are the relative magnitude and phase of the excitation current of each radiating element, radiation characteristics of each radiating element, the geometrical configuration of the array, and the separation distance between the array elements [2]. An antenna array can be designed to produce almost any arbitrary prescribed pattern by controlling these parameters. For this reason, antenna arrays find application in RADAR and wireless communication systems [3, 4].

Most antenna arrays are designed to produce a directive beam at a particular direction and while keeping the sidelobe level (SLL) small to avoid interference with other radiating sources. In most cases, this is achieved by controlling the magnitude and phase of the excitation amplitudes [5, 6]. In most cases, a relatively simple geometry is considered where the distance between two consecutive radiating elements is constant. However, exact control of phase and magnitude of excitation current of array elements requires complex and expensive electronic circuitry [4]. In case of phased arrays, where the direction of the main beam needs to be controlled electronically in real time [7], uses of such electronic circuits are unavoidable. However, in many applications, a dynamic control of array radiation pattern is not required. It is highly desirable in such cases to design an antenna array that does not require complex circuitry to control the phase and magnitude of excitation currents. Desired radiation characteristics can be achieved by proper placement of each individual radiating element in space while keeping the excitation current constant for all elements. Such arrays are known as nonuniformly spaced antenna arrays.

In linear antenna arrays, the antenna elements are placed along a straight line. Linear array of identical radiating elements are one of the common type of antenna arrays [4, 6]. Design method of linear uniformly spaced antenna arrays are widely covered in literature [5–8]. Most of these methods employ a heuristic optimization algorithm to find the phase and/or magnitude of the excitation currents of the array elements while keeping the separation between the array elements uniform. Particle Swarm Optimization (PSO) [5, 7], Genetic Algorithm (GA) [6] and Artificial Bee Colony (ABC) algorithm [8] have been successfully used to design such arrays. Although, design methods of Nonuniformly Spaced Linear Antenna arrays (NUSLA) exist, they have not received equal attention in the literature.

One of the first major articles describing nonuniformly spaced antenna arrays was published in 1961 [9]. The design method employed perturbation methods and concentrated on sidelobe reduction. An iterative method for sidelobe reduction was developed by Hodjat and Hovanessian [10]. Recently, Fourier transform and window techniques have been applied for designing NUSLA [11]. These methods are suitable for synthesizing radiation pattern with low SLL, but lacks flexibility to synthesize arbitrary radiation pattern.

Optimization-algorithm-based design methods of NUSLA allowed engineers to easily synthesize arbitrary radiation patters. The applications of DE and GA to synthesize NUSLA for low SLL have been reported in the literature [12, 13]. PSO has been successfully used to design NUSLA with low SLL and nulls in arbitrary positions [14]. Ant Colony Optimization (ACO) algorithm has also been used to synthesize NUSLA with arbitrary radiation pattern [15].

Oraizi and Fallahpour have presented an impressive study of NUSLA in their paper [16]. They used modified GA-based analysis to optimize the position of the array elements. However, the work does not mention the number of iterations required by GA to converge or any other indication convergence time. GA usually is not fast converging for antenna array problems and it is often outperformed by PSO and ABC [7, 8]. In this paper, we used a newly developed optimization algorithm called Firefly Algorithm (FA) to synthesize NUSLA and compare the performance of the algorithm with existing methods.

FA is a heuristic numeric optimization algorithm inspired by the behavior of fireflies [17, 18]. FA has been successfully used in many applications. Recently, FA has been used by Basu and Mahanti for designing linear antenna arrays [19]. The work concentrated on designing equally spaced linear array with variable excitation current. No work has yet been published on the application of FA for NUSLA design.

In this paper, FA is used to find the optimum spacing between the array elements to produce a desired broadside radiation pattern. The design examples with numerical results are provided. In the first example, a NUSLA is synthesized with minimum possible SLL. In the second example, a NUSLA is synthesized with low SLL and nulls in arbitrary direction. The paper is organized as follows: array geometry and mathematical formulation of the radiated electric field radiated by the array is presented in Section 2. A brief description of FA is given in Section 3. Numerical results are provided in Section 4 and concluding remarks are given in Section 5.

#### 2. Array Geometry and Mathematical Formulation

The linear antenna array is assumed to be composed of identical radiating elements. The radiating elements are taken to be dipoles antenna. The dipoles are positioned symmetrically around the origin on the -axis. The arms of the dipoles are parallel to the -axis. A two-dimensional schematic diagram of the array geometry is shown in Figure 1.

The total number of elements, is assumed to be even. The elements are divided into two groups of elements where . The elements are numbered as . The distances of elements from origin is denoted by . Due to symmetry, elements have the same distance values. The symmetry around the origin creates symmetrical radiation pattern, which is often desirable. It is possible to create symmetrical radiation pattern with unsymmetrical positioning of the array elements. However, the symmetry condition reduces computational complexities, as now only position of elements must be optimized instead of position of elements. To avoid complexities, symmetrical distribution of the elements around the origin is assumed in this paper.

The radiated field of the array depends on the radiation pattern of each array element and relative spacing of the array elements. The far-field radiation pattern of the array is given by [1, 3]

Here, is the radiation pattern of individual array elements, is the array factor, and are the zenith and azimuth angle of the spherical coordinate system. The coordinate system and the three dimensional geometry are shown in Figure 2.

The radiation pattern of each array element is assumed to be

The array factor is given by [16] Here, is wave number = and is wavelength of radiation.

Using (1), (2), and (3), the overall radiation pattern is given by

In this paper, the objective is to find optimum values of to produce a desired far-field radiation pattern. It is noted that for the given geometry and type of radiating elements chosen, does not affect the field variation with . So, for optimization process is carried out at * θ = *90° plane only.

Desired radiation pattern must be defined to measure the performance of the array. Since two different designs are to be implemented using the proposed method, two different desired patterns are defined as follows:

Here, is desired main beamwidth, is desired sidelobe level, is desired null level, is desired starting angular position of the null, and is desired ending angular position of the null.

Equation (5) represents a desired radiation pattern with a prescribed SLL and beamwidth. Equation (6) represents a desired radiation pattern with a specific SLL and beamwidth along with a predefined null level at an arbitrary direction. The angular extent of the null region is defined by the angles and .

The deviation of the obtained far-field pattern from the desired pattern is evaluated using the cost function. The cost function is defined as

Here, the summation is performed over the discrete field points that are numerically calculated. For the two different desired patterns defined in (5) and (6), two different cost functions can be defined. For each case, the fitness function is defined as

It can be noted that, when the obtained radiation pattern 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 fitness function has negative values. Large deviations result is high positive cost values and high negative fitness values. So, the goal of the optimization process is to minimize the cost function or maximize the fitness function by finding appropriate values of .

#### 3. Overview of Firefly Algorithm

FA is an optimization algorithm inspired by behavior and motion of fireflies. It is a population-based optimization algorithm which uses swarm intelligence to converge [17, 18]. It is similar to other optimization algorithms employing swarm intelligence such as PSO and ABC. But FA is found to have superior performance in many cases [19].

FA initially produces a swarm of fireflies located randomly in the search space. The initial distribution is usually produced from a uniform random distribution. The position of each firefly in the search space represents a potential solution of the optimization problem. The dimension of the search space is equal to the number of optimizing parameters 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 value is assigned to each firefly. The FA uses a phenomenon known is *bioluminescent communication* to model the movement of the fireflies through the search space. The brightness of each firefly depends on the fitness value of that firefly. Each firefly is attracted by the brightness of other fireflies and tries to move towards them. The velocity or the pull a firefly towards another firefly depends on the attractiveness. The attractiveness depends on the relative distance between the fireflies. It can be a function of the brightness of the fireflies as well. A brighter firefly far away may not be as attractive as a less bright firefly that is closer. In each iterative step, FA computes the brightness and the relative attractiveness of each firefly. Depending on these values, the positions of the fireflies are updated. After a sufficient amount of iterations, all fireflies converge to the best possible position on the search space.

The number of fireflies in the swarm is known as the population size, . The selection of population size depends on the specific optimization problem. However, typically a population size of 20 to 40 is used for PSO and FA for most applications [14, 17]. For the current problem, the solution space is dimensional, where each dimension represents the position of an array element. The position of the th firefly is denoted by a vector where, Here, and .

The search space is limited in mth dimension by the following inequality:

The value of the variables and depend on the optimization problem. For the current NUSLA synthesis problem, these variables represent minimum allowed and maximum allowed separation distance of consecutive array elements. Initially, the positions of the fireflies are generated from a uniform distribution using the following equation:

Here, rand is a uniform random variable with values ranging from 0 to 1. The value of *rand* is different for each value of and . Equation (11) generates random values from a uniform distribution within the prescribed range defined by (10). The initial distribution does not significantly affect the performance of the algorithm. Each time the algorithm is executed, the optimization process starts with a different set of initial points. However, in each case, the algorithm finds the optimum solution. In case of multiple possible sets of solutions, the algorithm may converge on different solutions each time. But each of those solutions will be valid as they all will satisfy the design requirements.

The brightness of the th firefly, is given by

The attractiveness between the th and pth firefly, given by [17]

Here, is Cartesian distance between and given by is a constant taken to be 1. is another constant whose value is related to the dynamic range of the search space.

The position of firefly is updated in each iterative step. If the brightness of pth firefly is larger than the brightness of the th firefly, then the th firefly moves towards the pth firefly. The motion is denoted by the following equation:

Here, rand is a random number between 0 and 1, taken from a uniform distribution. *α* is a constant whose value depends on the dynamic range of the solution space.

At each iterative step, the brightness and the attractiveness of each firefly is calculated. The brightness of each firefly is compared with all other fireflies and the positions of the fireflies are updated using (15). After a sufficient number of iterations, all the fireflies converge to the same position in the search space and the global optimum is achieved.

#### 4. Numerical Simulation and Results

For numerical simulations, a element NUSLA is considered. As symmetry about the origin is assumed, only the position of elements located on the positive -axis needs to be optimized. The population size is taken to be 40 and maximum number of iterations is limited to 65. The search space is bounded by defining the minimum and maximum separation between two consecutive elements to be and , respectively, implying the solution space limiting variables defined in (10) have the following values: For . The limiting values in all dimensions of the solution space are assumed to be the same. These values are selected so that mutual coupling between the elements remains negligible [16]. The dynamic range of the search space is . is taken to be 80% of the dynamic range initially and the value is linearly decreased to zero at maximum iteration number. The parameter is taken to be equal to the dynamic range. So,

The parameters of the first desired radiation pattern defined by (5) are selected as

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 was verified that these were the lowest possible values of beamwidth and SLL.

The parameters of the second desired radiation pattern defined by (6) are selected as

Two nulls symmetrical spaced around the main beam (located at 90°) extending from 46° to 54° and 126° to 134° with null level of –40 dB are desired. To achieve this, the requirements on desired SLL must be relaxed compared to the previous case. For this reason, desired SLL in this case is set to –20 dB compared to previous value of –23 dB. This relaxation in SLL constraint allows the possibility of reduction of main beamwidth. For this reason, the maximum main beamwidth in this case is selected as 12° compared to 13.4° of the previous case.

The NUSLA for the two desired radiation patterns is designed using FA algorithm. For comparison, the same designs are performed using PSO algorithm also. The value of the parameters of the PSO algorithm is selected the same as the ones used in [14]. However, the population size of 20 was used in [14]. For proper comparison, the population size for the PSO algorithm is taken to be 40, which is identical to the population size used in the FA algorithm.

FORTRAN computer coding (with G95 compiler) is used to implement the FA and PSO algorithm and formulating the far-field pattern. The optimum position of the array elements obtained from FA and PSO for the first desired radiation pattern is shown in Table 1.

It can be observed from Table 1 that the two algorithms produce different sets of solution values. Using these values, the far-field radiation pattern at * θ* = 90° plane ( plane) is calculated. The radiation pattern obtained from the FA is shown in Figure 3 and the radiation pattern obtained from the PSO algorithm is shown in Figure 4. The desired pattern is also highlighted in red in the same figures.

It can be seen that both radiation patterns satisfy most of the design criterion. In [16], the maximum SLL of –22.6 dB was achieved with a 20 element NUSLA of similar geometry. In this paper, using FA algorithm, the SLL value is limited to –23.5 dB using the same number of array elements. So the proposed FA-based outperforms the GA-based method described in [16]. For the PSO algorithm, SLL constraint has not been met by the design obtained from PSO in only a small angular region. So, FA outperforms PSO in terms of output as well. However, the performance of the algorithms cannot be compared form the final output only. The convergence speed of the algorithms can show the difference in performance: the convergence rate observed from the fitness versus iteration plot for the algorithms. This is shown in Figure 5.

It can be seen that for FA, the fitness function value reaches its maximum possible value zero within 20 iterations. The saturation of fitness value implies convergence. However, for PSO, maximum value of –14.317 is achieved. It took PSO around 50 iterations to reach this value. The fact that zero fitness value was not achieved implies that the obtained radiation pattern does not perfectly match with the desired radiation pattern, which is apparent from Figure 4. The most noticeable fact observed from Figure 5 is the fast converging characteristics of FA compared to PSO indicated by the sharper slope of the blue curve compared to the red one.

Similar analysis was performed to synthesize NUSLA for the second desired radiation pattern. The second desired pattern is characterized by two nulls located symmetrically around the main-lobe region. The optimum position of the array elements obtained from FA and PSO for the first desired radiation pattern is shown in Table 2.

It can be observed from Table 2 that the two algorithms produce different sets of solution values. The radiation pattern obtained from the FA and PSO algorithm are shown in Figures 6 and 7, respectively. The desired pattern is also highlighted in red in the same figures.

It can be observed that the results obtained from FA satisfy the design criterion very well. The results from PSO maintain the desired pattern for the most part, with only a few sidelobes exceeding the limit. This implies that PSO has not converged perfectly. This fact can be further illustrated by observing the fitness function values. This is shown in Figure 8. Again, the superior performance of FA compared to PSO can be observed by the sharper slope of the blue curve compared to the red curve. The maximum fitness value achieved for FA is –0.1456, whereas this value is –82.223. FA clearly outperforms PSO in terms of convergence rate and maximum fitness value reached within a limited number of iterations.

Due to the presence of random number parameters in 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 as well. ABC usually requires over 100 iterations (with a population size of 30 to 40) to reach convergence in antenna array problems [7, 8]. So, it can be concluded that FA is a very fast converging algorithm.

Using the optimized position of the array elements, the normalized radiated power in the far-field zone of the antenna array is calculated for the first design problem. Equation (4) along with the fact that power varies at is used to calculate contour plots of normalized radiated power at plane and plane. The plots are shown in Figures 9 and 10.

As the array elements are located along the axis, Figure 9 shows the broadside radiation characteristics of the array. The same results are also seen from Figure 3. The power distribution in the plane resembles the radiation pattern of a dipole antenna. This is expected, as the array elements are dipoles and the array factor does not contribute to the field distribution at plane ( plane).

#### 5. Conclusion

Two nonuniformly spaced linear antenna arrays are designed for two distinct design requirements. The radiation characteristics of the designed arrays are numerically evaluated. The separations between the array elements are determined using firefly algorithm and PSO algorithm. It has been found that the design obtained from FA satisfies the predefined SLL, beamwidth, and null requirements very well. The design obtained from PSO satisfies most of the design requirements but it is outperformed by FA in terms of convergence rate and obtained global best results. Also, a lower value of SLL is achieved using FA-based design method compared to other similar arrays designed by GA. Overall, the FA is found to be very suitable for NUSLA design compared to other existing optimization-algorithm-based methods.

#### References

- C. A. Balanis,
*Antenna Theory Analysis and Design*, John Wiley & Sons, 3rd edition, 2005. - C. A. Balanis,
*Modern Antenna Handbook*, John Wiley & Sons, 2008. - J. D. Kraus, R. J. Marhefka, and A. S. Khan,
*Antennas for all Applications*, Tata McGraw-Hill, 3rd edition, 2007. - R. C. Hansen, “Chapter 20: phased arrays,” in
*Antenna Engineering Handbook*, J. L. Volakis, Ed., McGraw-Hill, 4th edition, 2007. View at Google Scholar - T. B. Chen, Y. B. Chen, Y. C. Jiao, and F. S. Zhang, “Synthesis of antenna array using particle swarm optimization,” in
*Proceedings of the Asia-Pacific Microwave Conference (APMC '05)*, vol. 3, p. 4, December 2005. View at Publisher · View at Google Scholar · View at Scopus - A. Recioui, A. Azrar, H. Bentarzi, M. Dehmas, and M. Chalal, “Synthesis of linear arrays with sidelobe reduction constraint using genetic algorithm,”
*International Journal of Microwave and Optical Technology*, vol. 3, no. 5, pp. 524–530, 2008. View at Google Scholar - M. A. Zaman, S. A. Mamun, M. Gaffar, S. M. Choudhury, and M. A. Matin, “Phased array synthesis using modified particle swarm optimization,”
*Journal of Engineering Science and Technology Review*, vol. 4, no. 1, pp. 68–73, 2011. View at Google Scholar - M. A. Zaman, M. Gaffar, M. M. Alam, S. A. Mamun, and M. A. Matin, “Syntehsis of antenna arrays using artificial bee colony optimization algorithm,”
*International Journal of Microwave and Optical Technology*, vol. 6, no. 4, pp. 234–241, 2011. View at Google Scholar - R. Harrington, “Sidelobe reduction by nonuniform element spacing,”
*IRE Transactions on Antennas and Propagation*, vol. 9, no. 2, pp. 187–192, 1961. View at Google Scholar - F. Hodjat and S. A. Hovanessian, “Nonuniformly spaced linear and planar array antennas for sidelobe reduction,”
*IEEE Transactions on Antennas and Propagation*, vol. 26, no. 2, pp. 198–204, 1978. View at Google Scholar · View at Scopus - X. F. Ren, J. A. Azevedo, and A. M. Casimiro, “Synthesis of non-uniformly spaced arrays using the Fourier transform and window techniques,”
*IET Microwaves, Antennas and Propagation*, vol. 3, no. 8, pp. 1245–1253, 2009. View at Publisher · View at Google Scholar · View at Scopus - 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 · View at Google Scholar · View at Scopus - K. Chen, Z. He, and C. Han, “A modified real GA for the sparse linear array synthesis with multiple constraints,”
*IEEE Transactions on Antennas and Propagation*, vol. 54, no. 7, pp. 2169–2173, 2006. View at Publisher · View at Google Scholar · View at Scopus - M. M. Khodier and C. G. Christodoulou, “Linear array geometry synthesis with minimum sidelobe level and null control using particle swarm optimization,”
*IEEE Transactions on Antennas and Propagation*, vol. 53, no. 8, pp. 2674–2679, 2005. View at Publisher · View at Google Scholar · View at Scopus - E. Rajo-lglesias and Q. Quevedo-Teruel, “Linear array synthesis using an ant-colony-optimization-based algorithm,”
*IEEE Antennas and Propagation Magazine*, vol. 49, no. 2, pp. 70–79, 2007. View at Publisher · View at Google Scholar · View at Scopus - H. Oraizi and M. Fallahpour, “Nonuniformly spaced linear array design for the specified beamwidth/sidelobe level or specified directivity/sidelobe level with coupling considerations,”
*Progress in Electromagnetic Research M*, vol. 4, pp. 185–209, 2008. View at Google Scholar - X. S. Yang, “Firefly algorithms for multimodal optimization,” in
*Stochastic Algorithms: Foundations and Appplications*, O. Watanabe and T. Zeugmann, Eds., vol. 5792 of*SAGA 2009, Lecture Notes in Computer Science*, pp. 169–178, Springer, Berlin, Germany, 2009. View at Google Scholar - X. S. Yang, “Firefly algorithm, stochastic test functions and design optimisation,”
*International Journal of Bio-Inspired Computing*, vol. 2, no. 2, pp. 78–84, 2010. View at Google Scholar - B. Basu and G. K. Mahanti, “Firefly and artificial bees colony algorithm for synthesis of scanned and broadside linear array antenna,”
*Progress in Electromagnetic Research B*, vol. 32, pp. 169–190, 2011. View at Google Scholar