Sum/Difference Pattern Synthesis with Dynamic Range Ratio Control for Arbitrary Arrays

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.

Download Full-text

Difference pattern synthesis using a particle swarm optimizer

2009 Loughborough Antennas & Propagation Conference ◽

10.1109/lapc.2009.5352416 ◽

2009 ◽

Author(s):

Asim Ali Khan ◽

Anthony Keith Brown

Keyword(s):

Particle Swarm ◽

Particle Swarm Optimizer ◽

Pattern Synthesis ◽

Difference Pattern

Download Full-text

An Array Pattern Synthesis Method with the Constraint of Weight Amplitude Dynamic Range

2009 2nd International Congress on Image and Signal Processing ◽

10.1109/cisp.2009.5304381 ◽

2009 ◽

Author(s):

Xuehui He ◽

Ying Liu ◽

Shunjun Wu

Keyword(s):

Dynamic Range ◽

Synthesis Method ◽

Pattern Synthesis ◽

Array Pattern

Download Full-text

An Improved Pattern Synthesis Iterative Method in Planar Arrays for Obtaining Efficient Footprints with Arbitrary Boundaries

Sensors ◽

10.3390/s21072358 ◽

2021 ◽

Vol 21 (7) ◽

pp. 2358

Author(s):

Aarón Ángel Salas-Sánchez ◽

Cibrán López-Álvarez ◽

Juan Antonio Rodríguez-González ◽

María Elena López-Martín ◽

Francisco José Ares-Pena

Keyword(s):

Dynamic Range ◽

Three Dimensional ◽

Numerical Approach ◽

Test Cases ◽

Pattern Synthesis ◽

Maximum Order ◽

Space Applications ◽

Planar Arrays ◽

Aperture Distribution

In the present paper, an iterative technique devoted to reproducing efficient footprints with arbitrary boundaries for planar arrays is addressed. The methodology here depicted is based on exploiting the nature of the continuous aperture distribution by expressing it as a Fourier series of moderately high orders. In this manner, the resulting illumination boundary is defined by a target three-dimensional flat-topped pattern composed of stretching and shrinking modified circular Taylor patterns and the maximum order of the series to obtain a good reconstruction is determined by means of the iterative process. Examples and comparisons with the previous literature were conducted by analyzing square and rectangular contoured beams as test cases. Additionally, interesting potentials regarding space applications from a geostationary satellite are outlined by means of the EuTELSAT (European Telecommunications Satellite Organization) European coverage case study. In such a way, its numerical approach was analyzed by including subarray architectures and discussing improvements about dynamic range ratio of the excitations without critical power losses within the illumination region.

Download Full-text

Sum and difference pattern synthesis for conformal arrays

10.1049/cp.2009.0426 ◽

2009 ◽

Author(s):

Liu Jun ◽

Liu Zheng ◽

Qi Fei-lin

Keyword(s):

Pattern Synthesis ◽

Conformal Arrays ◽

Difference Pattern

Download Full-text

Sum and difference pattern synthesis with antenna correction

2014 IEEE Antennas and Propagation Society International Symposium (APSURSI) ◽

10.1109/aps.2014.6904388 ◽

2014 ◽

Author(s):

Jiazhou Liu ◽

Zhiqin Zhao ◽

Kai Yang ◽

Qing Huo Liu

Keyword(s):

Pattern Synthesis ◽

Difference Pattern

Download Full-text

Pattern Synthesis of Time-Modulated Sparse Array by an OPM-CVX Algorithm

Mathematical Problems in Engineering ◽

10.1155/2020/5491921 ◽

2020 ◽

Vol 2020 ◽

pp. 1-15

Author(s):

Lei Liang ◽

Yachao Jiang ◽

Jialing Liu ◽

Hailin Li ◽

Jianjiang Zhou

Keyword(s):

Convex Optimization ◽

Perturbation Method ◽

Dynamic Range ◽

Radiation Power ◽

Side Lobe ◽

Switching Function ◽

Side Lobe Level ◽

Pattern Synthesis ◽

Sparse Arrays ◽

Minimum Number

This paper addresses the constrained multiobjective optimization problem of time-modulated sparse arrays. The synthesis objective is to find an optimal element arrangement and associated excitation strategy of sparse arrays, which realize the balance of radiation power and sideband suppression performance with minimum number of elements, and suppress side lobe level simultaneously. A novel hybrid algorithm based on orthogonal perturbation method and convex optimization (OPM-CVX) for the synthesis of time-modulated sparse antenna array is presented in this paper. In order to satisfy the main lobe beamforming and side lobe suppression of sparse arrays, the proposed method optimizes element positions with minimum array numbers by orthogonal perturbation method and optimizes excitations of array element with dynamic range ratio constraint by convex optimization. Furthermore, a trapezoidal pulse time-modulated switching function is proposed to find the balance of radiation power and sideband suppression performance. The numerical results indicate that the proposed algorithm can be an effective approach for synthesis problems of time-modulated sparse arrays.

Download Full-text