A Crossover Improved Genetic Algorithm and Its Application in Non-Uniform Linear Antenna Arrays

Author(s):  
Bhargav Appasani ◽  
Rahul Pelluri ◽  
Vijay Kumar Verma ◽  
Nisha Gupta

Genetic Algorithm (GA) is a widely used optimization technique with multitudinous applications. Improving the performance of the GA would further augment its functionality. This paper presents a Crossover Improved GA (CIGA) that emulates the motion of fireflies employed in the Firefly Algorithm (FA). By employing this mimicked crossover operation, the overall performance of the GA is greatly enhanced. The CIGA is tested on 14 benchmark functions conjointly with the other existing optimization techniques to establish its superiority. Finally, the CIGA is applied to the practical optimization problem of synthesizing non-uniform linear antenna arrays with low side lobe levels (SLL) and low beam width, both requirements being incompatible. However, the proposed CIGA applied for the synthesis of a 12 element array yields an SLL of [Formula: see text]29.2[Formula: see text]dB and a reduced beam width of 19.1[Formula: see text].

2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Prerna Saxena ◽  
Ashwin Kothari

The aim of this paper is to introduce the grey wolf optimization (GWO) algorithm to the electromagnetics and antenna community. GWO is a new nature-inspired metaheuristic algorithm inspired by the social hierarchy and hunting behavior of grey wolves. It has potential to exhibit high performance in solving not only unconstrained but also constrained optimization problems. In this work, GWO has been applied to linear antenna arrays for optimal pattern synthesis in the following ways: by optimizing the antenna positions while assuming uniform excitation and by optimizing the antenna current amplitudes while assuming spacing and phase as that of uniform array. GWO is used to achieve an array pattern with minimum side lobe level (SLL) along with null placement in the specified directions. GWO is also applied for the minimization of the first side lobe nearest to the main beam (near side lobe). Various examples are presented that illustrate the application of GWO for linear array optimization and, subsequently, the results are validated by benchmarking with results obtained using other state-of-the-art nature-inspired evolutionary algorithms. The results suggest that optimization of linear antenna arrays using GWO provides considerable enhancements compared to the uniform array and the synthesis obtained from other optimization techniques.


2013 ◽  
Vol 2013 ◽  
pp. 1-13 ◽  
Author(s):  
Gopi Ram ◽  
Durbadal Mandal ◽  
Rajib Kar ◽  
Sakti Prasad Ghoshal

A novel optimization technique which is developed on mimicking the collective animal behaviour (CAB) is applied for the optimal design of hyper beamforming of linear antenna arrays. Hyper beamforming is based on sum and difference beam patterns of the array, each raised to the power of a hyperbeam exponent parameter. The optimized hyperbeam is achieved by optimization of current excitation weights and uniform interelement spacing. As compared to conventional hyper beamforming of linear antenna array, real coded genetic algorithm (RGA), particle swarm optimization (PSO), and differential evolution (DE) applied to the hyper beam of the same array can achieve reduction in sidelobe level (SLL) and same or less first null beam width (FNBW), keeping the same value of hyperbeam exponent. Again, further reductions of sidelobe level (SLL) and first null beam width (FNBW) have been achieved by the proposed collective animal behaviour (CAB) algorithm. CAB finds near global optimal solution unlike RGA, PSO, and DE in the present problem. The above comparative optimization is illustrated through 10-, 14-, and 20-element linear antenna arrays to establish the optimization efficacy of CAB.


2021 ◽  
Vol 10 (2) ◽  
pp. 67-77
Author(s):  
S. I. Abdelrahman ◽  
A. H. Hussein ◽  
A. E. A. Shaalan

Side lobe level reduction is one of the most critical research topics in antenna arrays beamforming as it mitigates the interfering and jamming signals. In this paper, a hybrid combination between the Genetic algorithm (GA) optimization technique and the gauss elimination (GE) equation solving technique is utilized for the introduction of the proposed GA/GE beamforming technique for linear antenna arrays. The proposed technique estimates the optimum excitation coefficients and the non-uniform inter-elements spacing for a specific side lobe (SL) cancellation without disturbing the half power beamwidth (HPBW) of the main beam. Different size Chebychev linear antenna arrays are taken as simulation targets. The simulation results revealed the effectiveness of the proposed technique


A lot of research is being carried out to reduce side lobe levels (SSLs) in the radiation pattern of antenna arrays. A number of novel optimization techniques have been developed over the years and adapted for this purpose. In this paper, a number of window functions are applied to suppress the maximum side lobe level (MSLL) in linear antenna arrays. The window functions Bartlett, Taylor, Hanning, Barthann, Hamming, Gaussian, Blackman, Chebyshev, Blackman-Harris and Kaiser are considered in the simulation. The optimized pattern for a 10 element linear antenna array and corresponding normalized window tappers for every window are presented. Finally the efficiency of all windows is compared in terms of their computed parameters.


2016 ◽  
Vol 65 (1) ◽  
pp. 5-18 ◽  
Author(s):  
El Hadi Kenane ◽  
Farid Djahli

Abstract This paper presents a new modified method for the synthesis of non-uniform linear antenna arrays. Based on the recently developed invasive weeds optimization technique (IWO), the modified invasive weeds optimization method (MIWO) uses the mutation process for the calculation of standard deviation (SD). Since the good choice of SD is particularly important in such algorithm, MIWO uses new values of this parameter to optimize the spacing between the array elements, which can improve the overall efficiency of the classical IWO method in terms of side lobe level (SLL) suppression and nulls control. Numerical examples are presented and compared to the existing array designs found in the literature, such as ant colony optimization (ACO), particle swarm optimization (PSO), and comprehensive learning PSO (CLPSO). Results show that MIWO method can be a good alternative in the design of non-uniform linear antenna array.


Author(s):  
Anas A. Amaireh ◽  
Asem S. Al-Zoubi ◽  
Nihad I. Dib

In this paper, symmetric scanned linear antenna arrays are synthesized, in order to minimize the side lobe level of the radiation pattern. The feeding current amplitudes are considered as the optimization parameters. Newly proposed optimization algorithms are presented to achieve our target; Antlion Optimization (ALO) and a new hybrid algorithm. Three different examples are illustrated in this paper; 20, 26 and 30 elements scanned linear antenna array. The obtained results prove the effectiveness and the ability of the proposed algorithms to outperform and compete other algorithms like Symbiotic Organisms Search (SOS) and Firefly Algorithm (FA).


2021 ◽  
Author(s):  
Ali Durmus ◽  
Rifat KURBAN ◽  
Ercan KARAKOSE

Abstract Today, the design of antenna arrays is very important in providing effective and efficient wireless communication. The purpose of antenna array synthesis is to obtain a radiation pattern with low side lobe level (SLL) at a desired half power beam width (HPBW) in far-field. The amplitude and position values ​​of the array elements can be optimized to obtain a radiation pattern with suppressed SLLs. In this paper swarm-based meta-heuristic algorithms such as Particle Swarm Optimization (PSO), Artificial Bee Colony (ABC), Mayfly algorithm (MA) and Jellyfish Search (JS) algorithms are compared to realize optimal design of linear antenna arrays. Extensive experiments are conducted on designing 10, 16, 24 and 32-element linear arrays by determining the amplitude and positions. Experiments are repeated 30 times due to the random nature of swarm-based optimizers and statistical results show that performance of the novel algorithms, MA and JS, are better than well-known methods PSO and ABC.


Sign in / Sign up

Export Citation Format

Share Document