Interference suppression of linear antenna arrays with combined Backtracking Search Algorithm and Differential Evolution

2014 ◽  
Author(s):  
Sudipta Das ◽  
Durbadal Mandal ◽  
Rajib Kar ◽  
Sakti Prasad Ghoshal
Keyword(s):  
Differential Evolution ◽  
Antenna Arrays ◽  
Search Algorithm ◽  
Interference Suppression ◽  
Linear Antenna ◽  
Backtracking Search ◽  
Backtracking Search Algorithm ◽  
Linear Antenna Arrays

scholarly journals Pattern Synthesis of Linear Antenna Array Using Improved Differential Evolution Algorithm with SPS Framework

Sensors ◽  
2020 ◽  
Vol 20 (18) ◽  
pp. 5158
Author(s):  
Ruimeng Zhang ◽  
Yan Zhang ◽  
Jinping Sun ◽  
Qing Li
Keyword(s):  
Differential Evolution ◽  
Antenna Array ◽  
Antenna Arrays ◽  
Optimization Problem ◽  
Differential Evolution Algorithm ◽  
Linear Antenna ◽  
Pattern Synthesis ◽  
De Algorithm ◽  
Improved Differential Evolution Algorithm ◽  
Linear Antenna Arrays

In this paper, an improved differential evolution (DE) algorithm with the successful-parent-selecting (SPS) framework, named SPS-JADE, is applied to the pattern synthesis of linear antenna arrays. Here, the pattern synthesis of the linear antenna arrays is viewed as an optimization problem with excitation amplitudes being the optimization variables and attaining sidelobe suppression and null depth being the optimization objectives. For this optimization problem, an improved DE algorithm named JADE is introduced, and the SPS framework is used to solve the stagnation problem of the DE algorithm, which further improves the DE algorithm’s performance. Finally, the combined SPS-JADE algorithm is verified in simulation experiments of the pattern synthesis of an antenna array, and the results are compared with those obtained by other state-of-the-art random optimization algorithms. The results demonstrate that the proposed SPS-JADE algorithm is superior to other algorithms in the pattern synthesis performance with a lower sidelobe level and a more satisfactory null depth under the constraint of beamwidth requirement.

scholarly journals Pattern Nulling of Linear Antenna Arrays Using Backtracking Search Optimization Algorithm

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Kerim Guney ◽  
Ali Durmus
Keyword(s):  
Differential Evolution ◽  
Antenna Array ◽  
Optimization Algorithm ◽  
Search Algorithm ◽  
Clonal Selection Algorithm ◽  
Linear Antenna ◽  
Linear Antenna Array ◽  
Backtracking Search ◽  
Search Optimization ◽  
Backtracking Search Optimization Algorithm

An evolutionary method based on backtracking search optimization algorithm (BSA) is proposed for linear antenna array pattern synthesis with prescribed nulls at interference directions. Pattern nulling is obtained by controlling only the amplitude, position, and phase of the antenna array elements. BSA is an innovative metaheuristic technique based on an iterative process. Various numerical examples of linear array patterns with the prescribed single, multiple, and wide nulls are given to illustrate the performance and flexibility of BSA. The results obtained by BSA are compared with the results of the following seventeen algorithms: particle swarm optimization (PSO), genetic algorithm (GA), modified touring ant colony algorithm (MTACO), quadratic programming method (QPM), bacterial foraging algorithm (BFA), bees algorithm (BA), clonal selection algorithm (CLONALG), plant growth simulation algorithm (PGSA), tabu search algorithm (TSA), memetic algorithm (MA), nondominated sorting GA-2 (NSGA-2), multiobjective differential evolution (MODE), decomposition with differential evolution (MOEA/D-DE), comprehensive learning PSO (CLPSO), harmony search algorithm (HSA), seeker optimization algorithm (SOA), and mean variance mapping optimization (MVMO). The simulation results show that the linear antenna array synthesis using BSA provides low side-lobe levels and deep null levels.

Sign in / Sign up

Export Citation Format

Share Document