Radiation beam pattern synthesis for coherent MIMO radar antenna arrays

2014 ◽  
Vol 56 (11) ◽  
pp. 2740-2745 ◽  
Author(s):  
Hai Deng ◽  
Zhe Geng ◽  
Braham Himed
2016 ◽  
Vol 2016 ◽  
pp. 1-12 ◽  
Author(s):  
Zhi-Kun Chen ◽  
Feng-Gang Yan ◽  
Xiao-Lin Qiao ◽  
Yi-Nan Zhao

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.


2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Sotirios K. Goudos

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.


2015 ◽  
Vol 63 (2) ◽  
pp. 543-552 ◽  
Author(s):  
Lilin Guo ◽  
Hai Deng ◽  
Braham Himed ◽  
Tan Ma ◽  
Zhe Geng

Author(s):  
Zhipeng Lin ◽  
Haoquan Hu ◽  
Shiwen Lei ◽  
Ruiming Li ◽  
Jing Tian ◽  
...  

2013 ◽  
Vol 137 ◽  
pp. 371-388 ◽  
Author(s):  
Xin Li ◽  
Wen-Tao Li ◽  
Xiao-Wei Shi ◽  
Jing Yang ◽  
Jian-Feng Yu

Sign in / Sign up

Export Citation Format

Share Document