Quantum-Inspired Teaching-Learning-Based Optimization for Linear Array Pattern Synthesis

2018 ◽  
pp. 2106-2115
Author(s):  
H. Y. Gao ◽  
X. T. Zhang ◽  
Y. N. Du ◽  
M. Diao
Keyword(s):  
Linear Array ◽  
Pattern Synthesis ◽  
Array Pattern ◽  
Teaching Learning Based Optimization ◽  
Teaching Learning

Application of the Unit Circle Representation to Pattern Synthesis of Nonuniformly Spaced and Nonuniformly Excited Arrays based on the Teaching Learning Based Optimization

2019 ◽  
Vol 4 (1) ◽  
pp. 8-17
Author(s):  
Abdelmadjid RECIOUI
Keyword(s):  
Unit Circle ◽  
Antenna Array ◽  
Communication Systems ◽  
Sidelobe Level ◽  
Pattern Synthesis ◽  
Linear Arrays ◽  
Array Pattern ◽  
Teaching Learning Based Optimization ◽  
Null Placement ◽  
Teaching Learning

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.

scholarly journals Linear Array Pattern Synthesis Using An Improved Multiobjective Genetic Algorithm

2017 ◽  
Vol 26 (4) ◽  
pp. 1048-1059 ◽  
Author(s):  
C. Han ◽  
L. Wang ◽  
Z. Zhang ◽  
J. Xie ◽  
Z. Xing
Keyword(s):  
Genetic Algorithm ◽  
Linear Array ◽  
Pattern Synthesis ◽  
Multiobjective Genetic Algorithm ◽  
Array Pattern

Synthesizing Pattern with Broad Nulls through Orthogonal Method

2010 ◽  
Vol 121-122 ◽  
pp. 992-995
Author(s):  
Long Yang Huang ◽  
Wei Jun Pan
Keyword(s):  
Linear Array ◽  
Experimental Results ◽  
Uniform Linear Array ◽  
Pattern Synthesis ◽  
Steering Vector ◽  
Orthogonal Method ◽  
First Order ◽  
Orthogonalization Method ◽  
Array Pattern ◽  
Schmidt Orthogonalization

Based on the Gram-Schmidt orthogonalization method utilized for pattern synthesis of linear array without constraints, null derivative constraints are proposed to implement pattern synthesis with broad nulls. The advantage of the simplified computation resulted from steering vector orthogonalization in unconstrained orthogonal approach is maintained, and the uniform or non-uniform linear array pattern synthesis can be realized by this method. The experimental results show that the null constrained orthogonal approach can fulfill linear array pattern synthesis with constrains such as null constrains, first-order and second-order derivative null constraints.

Sign in / Sign up

Export Citation Format

Share Document