scholarly journals Array Pattern Synthesis Using a Hybrid Differential Evolution and Analytic Algorithm

Electronics ◽  
2021 ◽  
Vol 10 (18) ◽  
pp. 2227
Author(s):  
Rui Li ◽  
Le Xu ◽  
Xiaoqun Chen ◽  
Yong Yang ◽  
Xiaoning Yang ◽  
...  

In this paper, a hybrid differential evolution and weight total least squares method (HDE-WTLSM) is proposed for antenna array pattern synthesis. A variable diagonal weight matrix is introduced in total least squares method. Then, the weight matrix is optimized by differential evolution (DE) algorithm to control the differences of the desired level and the obtained level in different directions. This algorithm combines the advantages of evolutionary algorithm and numerical algorithm, so it has a wider application range and faster convergence speed. To compare HDE-WTLSM with DE algorithm and typical numerical algorithms, these methods are applied to a linear antenna array and a conformal truncated conical array. Using our method, lower sidelobe levels and deeper nulls are obtained. The simulation results verify the validity and efficiently of HDE-WTLSM.

Sensors ◽  
2020 ◽  
Vol 20 (18) ◽  
pp. 5158
Author(s):  
Ruimeng Zhang ◽  
Yan Zhang ◽  
Jinping Sun ◽  
Qing Li

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.


2011 ◽  
Vol 113 ◽  
pp. 429-441 ◽  
Author(s):  
Rui Li ◽  
Le Xu ◽  
Xiao-Wei Shi ◽  
Na Zhang ◽  
Zhi-Qing Lv

2014 ◽  
Vol 4 (1) ◽  
Author(s):  
C. Hu ◽  
Y. Chen ◽  
Y. Peng

AbstractIn the classical geodetic data processing, a non- linear problem always can be converted to a linear least squares adjustment. However, the errors in Jacob matrix are often not being considered when using the least square method to estimate the optimal parameters from a system of equations. Furthermore, the identity weight matrix may not suitable for each element in Jacob matrix. The weighted total least squares method has been frequently applied in geodetic data processing for the case that the observation vector and the coefficient matrix are perturbed by random errors, which are zero mean and statistically in- dependent with inequality variance. In this contribution, we suggested an approach that employ the weighted total least squares to solve the nonlinear problems and to mitigate the affection of noise in Jacob matrix. The weight matrix of the vector from Jacob matrix is derived by the law of nonlinear error propagation. Two numerical examples, one is the triangulation adjustment and another is a simulation experiment, are given at last to validate the feasibility of the developed method.


Author(s):  
Dmitriy Vladimirovich Ivanov ◽  

The article proposes the estimation of the gross output vector in the presence of errors in the matrix of direct costs and the final consumption vector. The article suggests the use of the total least squares method for estimating the gross output vector. Test cases showed that the accuracy of the proposed estimates of the gross output vector is higher than the accuracy of the estimates obtained using the classical least squares method (OLS).


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.


Sign in / Sign up

Export Citation Format

Share Document