International Journal of Scientific Research Engineering & Technology (IJSRET)

Volume 2 Issue 6 pp 332-336 September 2013 www.ijsret.org ISSN 2278 0882

BROADSIDE LINEAR ANTENNA ARRAY SYNTHESIS USING GENETIC ALGORITHM

Shraddha Shrivastava Assistant professor, Electronics and communication department

Abstract- This paper is based on optimization of broadside linear antenna array. In this paper optimum value of weights of each antenna element is determined which produces radiation pattern with minimum side lobe level .In this work real coded Genetic algorithm is used. MATLAB is used as a platform. Adaptive feasible mutation rate is used which enables search in broader space along randomly generated directions to produce new generations. This improves the performance greatly to achieve the maximum reduction in side lobe level with minimum function calls. Keywords- Side lobe level, Genetic algorithm, broadside linear antenna array, Array factor

adaptive signal processing technique in which an array of antenna is exploited to achieve maximum reception in a look direction in which the signal of interest is present, while signal of same frequency from other directions which are not desired (signal of not interest) are rejected. The characteristics of the antenna array can be controlled by the geometry of the element and array excitation. But side lobe reduction in the radiation pattern [28],[31] should be performed to avoid degradation of total power efficiency and the interference suppression [2],[9] must be done to improve the Signal to noise plus interference ratio (SINR). Side lobe reduction and interference suppression can be obtained using the following techniques: 1) amplitude only control 2) phase only control 3) position only control and 4) complex weights (both amplitude and phase control). The process of choosing the antenna parameters to obtain desired radiation characteristics, such as the specific position of the nulls, the desired sidelobe level [4] and beam width of antenna pattern is known as pattern synthesis. Analytical studies by Stone who proposed binominal distribution, Dolph the DolphChebyshev amplitude distribution , Taylor, Elliot, Villeneuve Hansen and Woodyard, Bayliss laid the strong foundation on antenna array synthesis[20]-[24]. Today a lot of research on antenna array [2] [12], is being carried out using various optimization techniques to solve electromagnetic problems due to their robustness and easy adaptivity. One among them is Genetic algorithm [13] . R.L.Haupt has done much research on electromagnetics and antenna arrays using Genetic Algorithm [13]-[22]. In this paper, it is assumed that the array is uniform, where all the antenna elements are identical and equally spaced. The design criterion considered here is to minimize the sidelobe level [7] at a fixed main beam width. Hence the synthesis problem is, finding the

I. INTRODUCTION In many communication systems, point to point communication is used, for this highly directive beam of radiation is required. By arranging several dipoles in the form of an array or other antenna elements this can be achieved. Consider a linear array of n isotropic elements of equal amplitude and separated by distance d. The total field E at a far field point P in the given direction is given by,

.1 Where is the total phase difference of the fields from adjacent sources. It is given by;

One method to achieve a highly directional beam is to use adaptive beamforming.Adaptive beam forming is an

IJSRET @ 2013

International Journal of Scientific Research Engineering & Technology (IJSRET)

Volume 2 Issue 6 pp 332-336 September 2013 www.ijsret.org ISSN 2278 0882

weights that are optimum to provide the radiation pattern with maximum reduction in the sidelobe level. II.GENETIC ALGORITHM The genetic algorithm is a method for solving both constrained and unconstrained optimization problems that is based on natural selection, the process that drives biological evolution. The genetic algorithm repeatedly modifies a population of individual solutions. At each step, the genetic algorithm selects individuals at random from the current population to be parents and uses them to produce the children for the next generation. Over successive generations, the population "evolves" toward an optimal solution. GAs can be used when objective function is discontinuous, non differentiable, stochastic, or highly nonlinear. The flowchart is shown in Figure 1. In this paper, performance improvement is analyzed in order to obtain a desired pattern of linear antenna array using GA. Fixed mutation rate approach is used in classical GA. In this paper, adaptive feasible mutation rate is used, which shows improvement in performance throughout the evolution. The genetic algorithm uses three main types of rules at each step to create the next generation from the current population: Selection rules select the individuals, called parents, that contribute to the population at the next generation. Crossover rules combine two parents to form children for the next generation. Mutation rules apply random changes to individual parents to form children. Two more parameters are involved in GA i.e. population and number of generations. They are defined as given below Selection Evaluation of the fitness criterion to choose which individuals from a population will go on to reproduce. Some general methods used are Roulette Wheel Selection and Tournament Selection Crossover This is an exchange of substrings denoting chromosomes, for an optimization problem. It may be a single point cross over , two point cross over.

Mutation Mutation allows the population to change by introduction of random characteristics. Without mutation the population would quickly converge to a solution that may be or may not be correct. Mutation randomly chooses alleles to alter with a probability Pmut. Population The number of chromosomes considered in one generation Number of generations The maximum number of generations that the genetic algorithm can evolve into, before terminating.

BEGIN

INITIAL POPULATION

EVALUATE FITNESS OF POPULATION

SELECTION

CROSS OVER (MATING)

MUTATION

EVALUATE FITNESS OF POPULATION

CONVERGED

NO

YES
END

Fig.1 Flowchart of Genetic Algorithm IJSRET @ 2013

International Journal of Scientific Research Engineering & Technology (IJSRET)

Volume 2 Issue 6 pp 332-336 September 2013 www.ijsret.org ISSN 2278 0882

III. UNIFORM LINEAR ANTENNA ARRAY

Fig.3 Uniform linear antenna array The far field array factor of this array with an even number of isotropic elements (2N) can be expressed as N AF () = 2 a n cos (a / d n sin ) (2) n-1 Where an is amplitude of amplitude of nth element, is the angle from broadside and d n is the distance between position of nth element and array center .The main objective of this work is to find an appropriate set of required element weight that gives maximum side lobe level reduction and narrow main beam width. To find a set of values which produces the array pattern, the algorithm is used to minimize fitness function. The fitness function associated with this array is the maximum Side Lobe Level of its associated radiation field pattern to be minimized. The fitness function used for this work is given by Fitness =F1 = 20*log10 (F / max (F)) F = abs (H) Where H is normalized field strength. . The antenna model consists of N elements and equally spaced with d =0.5 along the y-axis. The number of elements are changed while the array geometry and spacing between the elements are constant. A continuous GA with a population size 20 and an adaptive feasible mutation rate is run for a total of 100 generations using MATLAB and the best result was found for each iteration. The cost function is the minimum side lobe level for the antenna pattern. Simulation is done for N = 24 elements. Table 1 shows the amplitude excitations for N=24 elements. Using adaptive feasible mutation rate better results are obtained as shown in table 2 as compared to results obtained by fixed mutation as in [1]..

Fig. 2 Linear antenna array In linear antenna array, all the antenna elements are arranged in a single line with equal spacing between them. In Fig 2 it is shown that the antenna elements are arranged with uniformly spacing, in a straight line along the y-axis, and N is the total number of elements in the antenna array with the physical separation distance as d, and the wave number of the carrier signal is k =2/. When kd is equal to (or d= /2) The phase shift between the elements experienced by the plane wave is kdcos. Weights can be applied to the individual antenna signals before the array factor (AF) is formed to control the direction of the main beam.This correspond to a multiple-input-single-output (MISO) system. The total AF is just the sum of the individual signals, given by the N N AF = E n = e jK n .................................. (2) n=1 n=1 Where En = e jKn and K= (nkd cos + n) is the phase difference. n is the phase angle. Only the magnitude of the AF in any direction is important, the absolute phase has no bearing on the transmitted or received signal. Therefore, only the relative phases of the individual antenna signals are important in calculating the AF. IV. SIMULATION RESULTS Consider an array of antenna consisting of N number of elements. It is assumed that the antenna elements are symmetric about the center of the linear array as shown in fig 3.

IJSRET @ 2013

International Journal of Scientific Research Engineering & Technology (IJSRET)

Volume 2 Issue 6 pp 332-336 September 2013 www.ijsret.org ISSN 2278 0882

V. CONCLUSION In this paper Genetic algorithm Solver in Optimization toolbox of MATLAB is used to obtain maximum reduction in side lobe level relative to the main beam on both sides of 0. This paper compares the results of new design used in this paper with the design of antenna array in [1],and it is found that the changes made in this design gives better values of antenna elements weights as compared to previous work. Adaptive feasible mutation with single point crossover showed the performance improvement by reducing the side lobe level below -20dB in most of the cases.The best sidelobe level obtained is -26.1 dB for N = 24 which is -14.97 dB in [1]. As a compromise in directivity is observed the work can be extended to improve the directivity also while reducing side lobe level, same experiment can be done for array with large number of elements as compared to this.Fig 4 shows the optimized radiation pattern and fig 5 shows the polar plot for N = 24 elements. Table 1: Amplitudes excitations for N=24 elements Wn W1 W2 W3 W4 W5 W6 W7 W8 W9 W10 W11 W12 W13 W14 W15 W16 W17 W18 W19 W20 W21 W22 W23 W24 Amplitude Excitation 0.0637 0.1278 0.7122 0.2699 0.6079 0.8534 0.5249 0.9204 0.4460 0.8140 0.5389 0.7493 0.4959 0.5363 0.4957 0.3957 0.4649 0.3561 0.2090 0.3284 0.0800 0.3627 0.1764 0.1583

Fig. 4 Optimized radiation pattern with reduced side lobe level of -26.1 Db for N= 24 elements

Fig. 6 Mean and best fitness for N = 24 elements. REFERENCES [1]T .S.Jeyali Laseetha, Dr. R Sukanesh Synthesis of linear antenna array using Genetic Algorithm to maximize side lobe level reduction International IJSRET @ 2013

Fig. 5 Radiation pattern for N= 24 elements

International Journal of Scientific Research Engineering & Technology (IJSRET)

Volume 2 Issue 6 pp 332-336 September 2013 www.ijsret.org ISSN 2278 0882

Journal of Computer Application (0975 -8887),Volume 20- No 7,April 2011. [2] M.A.Panduro, Design of Non-Uniform Linear Phased Arrays using Genetic Algorithms To Provide Maximum Interference Reduction Capability in a Wireless Communication System, Journal of the Chinese Institute of Engineers,Vol.29 No.7,pp 11951201(2006). [3] Stephen Jon Blank, On the Empirical optimization of Antenna Arrays, IEEE antenna and Propagation Magazine, 47, 2, pp.58-67, April 2005. [4] Aniruddha Basak.et.al, A Modified Invasive Weed Optimization Algorithm for Time- Modulated Linear Antenna Array Synthesis, IEEE Congress on Evolutionary Computation (CEC) DOI:10.1109/CEC.2010.5586276 pp.1-8, 2010. [5] Aritra Chowdhury et.al. Linear Antenna Array Synthesis using Fitness-Adaptive Differential Evolution Algorithm, IEEE Congress on Evolutionary Computation (CEC) 2010 pp.1-8,DOI.2010/5586518. [6] T.B.Chen,Y,B.Chen,Y.C.Jiao and F.S.Zhang, Synthesis of Antenna Array Using Particle Swarm Optimization, Asia-Pacific Conference proceedings on Microwave Conference,2005 ,APMC,2005,pp.4. [7] Peiging Xia and Mounir Ghogho, Evaluation of Multiple Effects Interference Cancellation in GNSS using Space- Time based Array Processing, International Journal of Control, Automation, and Systems, vol. 6, no. 6, pp. 884- 893, December 2008. [8] Aniruddha Basak, Siddharth Pal, Swagatam Das and Ajith Abraham, Circular Antenna Array Synthesis with a Differential Invasive Weed Optimization Algorithm, 10th International Conference on Hybrid Intelligent Systems (HIS 2010), Atlanta , USA (Accepted, 2010). [9] Peter J.Bevelacqua and Constantine A. Balanis, Optimizing Antenna Array Geometry for Interference Suppression, IEEE Transaction on Antenna And Propagation, Vol.55, no.3 pp 637-641,March 2007. [10] Peter J.Bevelacqua and Constantine A. Balanis, Optimizing Antenna Array Geometry for Interference Suppression, IEEE Transaction on Antenna And Propagation, Vol.55, no.3 pp 637-641,March 2007. [11] Stephen J.Blank, Antenna Array Synthesis Using Derivative, Non-Derivative and Random Search Optimization, IEEE Sarnoff Symposium, DOI 10.1109/SARNOF. 2008.4520115, pp 1-4, May 2008. [12] Korany R. Mahmoud, et.al. Analysis of Uniform Circular Arrays for Adaptive Beam forming Application Using Particle Swarm Optimization Algorithm, International Journal of RF and Microwave Computer Aided Engineering DOI 101.1002 pp.42-52.

[13] David E.Goldberg, John H.Holland, Genetic Algorithm and Machine Learning, Kluwer Academic Publishers, Machine Learning 3 Issue 2-3, pp 95-99, 1998. [14] R.L.Haupt, Directional Antenna System Having Sidelobe Suppression, Us Patent 4, pp571-594 Feb 18, 1986. [15] R.L.Haupt, Thinned arrays using genetic algorithm, IEEE Transaction on Antenna and Propagation, Vol.12 Issue 7, pp 993-999 July1994. [16] R.L.Haupt, Optimum quantized low sidelobe phase tapers for array,.IEEE Electronics Lett 31(14) pp1117-1118 July 1995. [17] R.L.Haupt, Synthesizing low sidelobe quantized amplitude and phase tapers for linear arrays using genetic algorithms, Proc Inte.Conf. Electromagnetics in Advanced Application, Torino, Italy, pp 221-224 Sept.1995. [18] R.L.Haupt, Adaptive Nulling With Weight Constraints,Progress In Electromagnetics Research B, Vol. 26, pp 23-38, 2010. [19] C.L.Dolph, A current distribution for broadside arrays which optimizes the relationship between beam width and Side-lobe level, Proc IRE 34 pp.3335-348 June 1946. [20] T.T Taylor, Design of line source antennas for narrow beam width and low side lobes, IRE AP Trans 4 pp 16- 28 Jan 1955. [21] R.S.Elliott, Antenna Theory and Design, Prentice-Hall, New York 1981. [22] A.T.Villeneuve, Taylor, Patterns for discrete pattern arrays, IEEE AP- S Trans 32(10) pp 1089-1094 October 1984. [23] W.W.Hansen and J.R.Woodyard, A new principle in directional antenna design, Proc. IRE 26 pp 333 -345 March 1938. [24] E.T.Bayliss, Design of Monopulse Antenna difference Patterns with low sidelobes, Bell Syst. Tech.J.47 pp623- 650 May-June 1968. [25]J.H.Holland, Adaptation in Natural and Artificial Systems, Univ. Michigan Press, Ann Arbor 1975. [26] D.E.Goldberg, Genetic Algorithm in search optimization and Machine Learning Addison-Wesley, New York, 1989. [27] B.Widrow et.al. Adaptive antenna system, IEEE.Proc 55(12) pp2143-2159 Dec 1967. [28] R.L.Haupt, An introduction to genetic algorithm for electromagnetics, IEEE Antenna. Propagation Mag 37(2), pp7-15 April 1995.

IJSRET @ 2013