Adaptive antenna array pattern synthesis for suppressed sidelobe level and controlled null using genetic algorithm

Author(s):  
Parthasarathi Pal ◽  
Durbadal Mondal
2019 ◽  
Vol 4 (1) ◽  
pp. 8-17
Author(s):  
Abdelmadjid RECIOUI

Pattern synthesis of Antenna array has gained much attention over the last years as they constitute an important role in the modern communication systems. Unit circle-based techniques such as Schelkunoff null placement method have proved their effectiveness to synthesize uniformly spaced linear arrays. Nonuniformly spaced antenna array pattern synthesis has been investigated and interesting results have been obtained. In this work, the unit circle representation approach is applied to synthesize nonuniformly spaced and nonuniformly excited linear arrays. The objective is to accurately place nulls in the desired directions while achieving the least possible sidelobe level. The problem is cast as an optimization problem that is solved using the Teaching Learning Based Optimization (TLBO). Examples are dealt with to prove the design approach effectiveness and flexibility for modern communication system applications.


2020 ◽  
Vol 2020 ◽  
pp. 1-6
Author(s):  
Hicham Aziz ◽  
Mahmoud Moubadir ◽  
Abdelkrim Farkhsi ◽  
Naima Amar Touhami

This paper presents the conception and realization of a 2D antenna array using periodic leaky-wave antenna (PLWA) and the binomial array (BA) at 6 GHz as the application of WLAN. The series array of periodic leaky-wave antenna was provided by an array of five rectangular Patches connected by cross lines. The nonuniform amplitudes of the binomial array are used to reduce the sidelobe level; in this way, the center source radiates strongly on the broadside. The prototype of the proposed 2D antenna array is designed, fabricated, and tested. A good agreement is obtained between simulated and measurement results.


Author(s):  
F. Yaman ◽  
A. E. Ylmaz

In this paper, the uniform circular antenna array pattern synthesis problem is solved by means of the real coded genetic algorithm (GA). At the same time, the impacts of the mutation rate and the crossover position on the GAperformance are also investigated. For this purpose, a circular antenna array with uniformly spaced isotropic elements having identical excitation amplitudes is used as a model. Unlike the conventional GA (with fixed mutation rate and random crossover positions), typical GA implementations with variable mutation rate and restricted crossover position are considered for performance improvement. In conclusion, for the specific problem, decreasing mutation rate with negative derivative is observed to be outperforming the implementations with different mutation rate behaviors. Moreover, regarding the crossover technique, it is observed that imposing some restrictions on the crossover positions (rather than fully random position selection) yields better solutions.


Sign in / Sign up

Export Citation Format

Share Document