A Hybrid Optimization for Pattern Synthesis of Large Antenna Arrays

Liu, Jiazhou; Zhao, Zhiqin; Yang, Kai; Liu, Qing

doi:10.2528/pier13121606

Cited by 21 publications

(24 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The aforementioned classification is obviously a very simplified one, since the years hybrid and mixed strategies have been presented [35][36][37][38][39][40][41]; furthermore, the recent development of compressive sensing [42], and related algorithms, has provided effective and computationally-efficient algorithms [43][44][45][46][47][48][49][50][51][52][53]. In particular, the synthesis of sparse linear arrays of hundreds of wavelengths was shown in [53], a result that to the best knowledge of the authors is currently unmatched.…”

Section: Introductionmentioning

confidence: 99%

Efficient Large Sparse Arrays Synthesis by Means of Smooth Re-Weighted L1 Minimization

et al. 2019

View full text Add to dashboard Cite

In this paper, we present an efficient technique for the synthesis of very large sparse arrays, with arbitrary circularly-symmetrical upper bounds for the pattern specifications. The algorithm, which is based on iterative smooth re-weighted L1 minimizations, is very flexible and is capable of achieving very good performances with respect to competitive algorithms. Furthermore, thanks to its efficiency, planar arrays of hundreds of wavelengths can be synthesized with limited computational effort.

show abstract

Section: Introductionmentioning

confidence: 99%

Efficient Large Sparse Arrays Synthesis by Means of Smooth Re-Weighted L1 Minimization

et al. 2019

View full text Add to dashboard Cite

show abstract

“…However, due to the limitation of the FFT, the GA-FFT method can be only applied to the synthesis of equally spaced array without considering element mutual coupling and platform effect. Recently, the nonuniform FFT has been applied to accelerate the pattern calculation for an unequally spaced array [14][15][16]. However, the nonuniform FFT deals only with the array factor, and it cannot be applicable when the pattern of the array including coupling effects is considered.…”

Section: Introductionmentioning

confidence: 99%

Generalisation of genetic algorithm and fast Fourier transform for synthesising unequally spaced linear array shaped pattern including coupling effects

You

Liu

et al. 2017

IET Microwaves, Antennas & Propagation

Self Cite

View full text Add to dashboard Cite

Antenna arrays with shaped patterns have drawn significant attention for their wide applications in radar, sonar and communication systems. The combination of genetic algorithm (GA) and fast Fourier transform (FFT) has been used to synthesize shaped pattern of antenna array's factor without considering coupling effects. In this work, the GA-FFT method is generalized by integrating with a new virtual active element pattern expansion (VAEPE) method which approximates each active element pattern as the radiation pattern by exciting several equally spaced virtual elements surrounding the real element position. The generalized GA-FFT can be applicable for the shaped pattern synthesis of unequally spaced linear arrays including mutual coupling and platform effect. Several synthesis examples with different pattern shapes and different antenna structures are given to demonstrate the effectiveness, accuracy and robustness of the proposed method.

show abstract

“…Recently, the matrix pencil method (MPM) [1], forward-backward matrix pencil method (FBMPM) [2], and hybrid technique between the method of moments and the genetic algorithm (MoM/GA) [3] have been successfully applied to synthesizing linear antenna arrays. A new iterative technique for pencil beam pattern synthesis of linear and planar antenna arrays using minimized number of antenna elements is presented in [4]. The technique is based on a hybrid combination between the Nonuniform Fourier Transform (NUFFT) and a global optimization method.…”

Section: Introductionmentioning

confidence: 99%

“…Two novel strategies for best of random mutation and randomized local search are introduced to enhance and accelerate the convergence of standard differential evolution algorithm (SDE). Although these arrays synthesis algorithms [4][5][6] provide high performance, they are time consuming.…”

Section: Introductionmentioning

confidence: 99%

A New Ge/Pso Antenna Arrays Synthesis Technique and Its Application to Doa Estimation

Abdullah¹

2017

PIER M

View full text Add to dashboard Cite

Abstract-Direction of arrival estimation has a noteworthy significance in numerous applications, such as radar systems, smart antennas, sonar, mobile communications, and space communications. The algorithms used to estimate the direction of arrival are to some degree complex and time consuming. Also, the number of antenna elements is a discriminating parameter for assessing the performance of the DoA technique. For real time systems, quick and savvy techniques are required. Along these lines, decreasing the estimation time and also reducing the system cost while keeping a generally high precision are crucial issues. In this paper, a new technique for linear antenna arrays synthesis using optimized number of antenna elements and its application to direction of arrival estimation is introduced. The synthesized arrays exhibit approximately the same radiation pattern as the original arrays. The optimized antenna arrays are synthesized using reduced number of antenna elements. In this case, the number of antenna elements reduction will minimize the system cost and decrease the number of picked samples from the different signal sources. As the number of samples decreases, the dimensions of the steering matrix and data correlation matrix are reduced. In this context, the computational burden, estimation time, and system cost are optimized. The proposed technique can be applied to single or multi-snapshot DoA estimation techniques.

show abstract

A Hybrid Optimization for Pattern Synthesis of Large Antenna Arrays

Cited by 21 publications

References 23 publications

Efficient Large Sparse Arrays Synthesis by Means of Smooth Re-Weighted L1 Minimization

Efficient Large Sparse Arrays Synthesis by Means of Smooth Re-Weighted L1 Minimization

Generalisation of genetic algorithm and fast Fourier transform for synthesising unequally spaced linear array shaped pattern including coupling effects

A New Ge/Pso Antenna Arrays Synthesis Technique and Its Application to Doa Estimation

Contact Info

Product

Resources

About