scholarly journals Synthesis of Steered Flat-top Beam Pattern Using Evolutionary Algorithm

2016 ◽  
Vol 5 (3) ◽  
pp. 86 ◽  
Author(s):  
D. Mandal ◽  
K. S. Kola ◽  
J. Tewary ◽  
V. P. Roy ◽  
A. K. Bhattacharjee
Keyword(s):  
Evolutionary Algorithm ◽  
Dynamic Range ◽  
Synthesis Method ◽  
Elevation Angle ◽  
Differential Evolution Algorithm ◽  
Beam Pattern ◽  
Main Beam ◽  
Pattern Synthesis ◽  
Feed Networks ◽  
Flat Top Beam

In this paper a pattern synthesis method based on Evolutionary Algorithm is presented. A Flat-top beam pattern has been generated from a concentric ring array of isotropic elements by finding out the optimum set of elements amplitudes and phases using Differential Evolution algorithm. The said pattern is generated in three predefined azimuth planes instate of a single phi plane and also verified for a range of azimuth plane for the same optimum excitations. The main beam is steered to an elevation angle of 30 degree with lower peak SLL and ripple. Dynamic range ratio (DRR) is also being improved by eliminating the weakly excited array elements, which simplify the design complexity of feed networks.

scholarly journals Sparse Antenna Array Design for MIMO Radar Using Multiobjective Differential Evolution

2016 ◽  
Vol 2016 ◽  
pp. 1-12 ◽  
Author(s):  
Zhi-Kun Chen ◽  
Feng-Gang Yan ◽  
Xiao-Lin Qiao ◽  
Yi-Nan Zhao
Keyword(s):  
Differential Evolution ◽  
Antenna Array ◽  
Optimization Problem ◽  
Mean Squared Error ◽  
Differential Evolution Algorithm ◽  
Mimo Radar ◽  
Beam Pattern ◽  
Pattern Synthesis ◽  
Array Design ◽  
Second Stage

A two-stage design approach is proposed to address the sparse antenna array design for multiple-input multiple-output radar. In the first stage, the cyclic algorithm (CA) is used to establish a covariance matrix that satisfies the beam pattern approximation for a full array. In the second stage, a sparse antenna array with a beam pattern is designed to approximate the desired beam pattern. This paper focuses on the second stage. The optimization problem for the sparse antenna array design aimed at beam pattern synthesis is formulated, where the peak side lobe (PSL) is weakly constrained by the mean squared error. To solve this optimization problem, the differential evolution (DE) algorithm with multistrategy is introduced and PSL suppression is treated as an inequality constraint. However, in doing so, a new multiobjective optimization problem is created. To address this new problem, a multiobjective differential evolution algorithm based on Pareto technique is proposed. Numerical examples are provided to demonstrate the advantages of the proposed approach over state-of-the-art methods, including DE and genetic algorithm.

scholarly journals Shaped Beam Pattern Synthesis of Antenna Arrays Using Composite Differential Evolution with Eigenvector-Based Crossover Operator

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Sotirios K. Goudos
Keyword(s):  
Differential Evolution ◽  
Antenna Arrays ◽  
Design Method ◽  
Differential Evolution Algorithm ◽  
Beam Pattern ◽  
Crossover Operator ◽  
Pattern Synthesis ◽  
Shaped Beam ◽  
Rotationally Invariant ◽  
Beam Patterns

This paper addresses the problem of designing shaped beam patterns with arbitrary arrays subject to constraints. The constraints could include the sidelobe level suppression in specified angular intervals, the mainlobe halfpower beamwidth, and the predefined number of elements. In this paper, we propose a new Differential Evolution algorithm, which combines Composite DE with an eigenvector-based crossover operator (CODE-EIG). This operator utilizes eigenvectors of covariance matrix of individual solutions, which makes the crossover rotationally invariant. We apply this novel design method to shaped beam pattern synthesis for linear and conformal arrays. We compare this algorithm with other popular algorithms and DE variants. The results show CODE-EIG outperforms the other DE algorithms in terms of statistical results and convergence speed.

scholarly journals Research on Multibeam Pattern Synthesis of Time Modulated Array Based on Convex Optimization

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Jiawen Hu ◽  
Xikuan Dong ◽  
Jing Tan ◽  
Yachao Jiang ◽  
Hailin Li
Keyword(s):  
Convex Optimization ◽  
Dynamic Range ◽  
Linear Array ◽  
Synthesis Method ◽  
Optimization Method ◽  
Center Frequency ◽  
Pattern Synthesis ◽  
Beam Radiation ◽  
Second Stage ◽  
Two Stages

An efficient multibeam pattern synthesis method for time modulated array (TMA) is proposed in this paper. The aim of this method is to generate a beam pattern on the specified sideband of TMA. The pattern synthesis problem is divided into two stages. In the first stage, the sequential convex optimization method is used to suppress the sidelobe of the center frequency and reduce the amplitude dynamic range ratios (DRR). In the second stage, the iterative convex optimization method is used to realize the multibeam pattern synthesis in the sideband. Owing to the introduction of convex optimization, the proposed method could be more efficient than approaches using a global optimization algorithm. The proposed method is capable of realizing pattern synthesis under different DRR constraints and different beam radiation directions. Numerical examples of two beams and four beams patterns of 1000-element time modulated linear array verify the effectiveness of the proposed method.

Pattern Synthesis Method for Arbitrary Arrays

2011 ◽  
Vol 30 (3) ◽  
pp. 738-741
Author(s):  
Xia Zhang ◽  
Hai-hong Tao ◽  
Gui-sheng Lian
Keyword(s):  
Synthesis Method ◽  
Pattern Synthesis

Low-Sidelobe Shaped-Beam Pattern Synthesis With Amplitude Constraints

2021 ◽  
pp. 1-1
Author(s):  
Zhipeng Lin ◽  
Haoquan Hu ◽  
Shiwen Lei ◽  
Ruiming Li ◽  
Jing Tian ◽  
...  
Keyword(s):  
Beam Pattern ◽  
Pattern Synthesis ◽  
Shaped Beam ◽  
Low Sidelobe
Sign in / Sign up

Export Citation Format

Share Document