2018
DOI: 10.1155/2018/6309192
|View full text |Cite
|
Sign up to set email alerts
|

A Hybrid Method Based on the Iterative Fourier Transform and the Differential Evolution for Pattern Synthesis of Sparse Linear Arrays

Abstract: A hybrid method that combines the iterative Fourier transform (IFT) and the algorithm of differential evolution (DE) is proposed to address the synthesis of low sidelobe sparse linear array (SLA) including many elements. Firstly, a thinned linear array (TLA) with the lattices spaced at half wavelength is obtained by the IFT. Then, for the elements of the TLA whose left or right spacing are greater than half wavelength, their placements are selected as the candidates which will be further optimized by the DE, a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
5
0

Year Published

2019
2019
2025
2025

Publication Types

Select...
4
1
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 22 publications
0
5
0
Order By: Relevance
“…Amplitude and phase tapering is highly dependent on cost with a different choice. It is possible using an amplitude tapering of the primary and secondary array or one of them and using phase tapering of the secondary array [26]- [31]. The excitation coefficients can be implementable through the adaptive analog BF in a massive MIMO antenna.…”
Section: Introductionmentioning
confidence: 99%
“…Amplitude and phase tapering is highly dependent on cost with a different choice. It is possible using an amplitude tapering of the primary and secondary array or one of them and using phase tapering of the secondary array [26]- [31]. The excitation coefficients can be implementable through the adaptive analog BF in a massive MIMO antenna.…”
Section: Introductionmentioning
confidence: 99%
“…Evolutionary algorithms are increasingly widely used in the optimization of sparse arrays. Generally, global optimization processes such as genetic algorithm (GA) [8,9] and differential evolution (DE) [10,11] are easy to fall into a dead loop; thus, the result of synthesis was a local optimal solution. Meanwhile, the computational complexity of these global optimization techniques increases exponentially with the increase of unknowns, so these processes cannot be guaranteed to reach the optimal solution in a reasonable time.…”
Section: Introductionmentioning
confidence: 99%
“…Inspired by the efficiency of the iterative Fourier transform (IFT) [26][27][28] in synthesizing both linear and planar thinned arrays (PTAs), a hybrid method based on the IFT and the algorithm of DE, called IFT-DE, was proposed in [29] for the synthesis of a uniformly amplitude linear sparse array (LSA) including many elements. In the first step of the method, the aperture of LSA is divided into a set of half wavelength spaced lattices.…”
Section: Introductionmentioning
confidence: 99%
“…In this paper, the IFT-DE is further extended to the synthesis of a uniform amplitude PSA with apertures ranging from small to moderate size. There are mainly two differences between the method in this paper and the algorithm proposed in [29]. Firstly, the 2D-FFT is performed over 2D lattices to get a planar thinned array (PTA).…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation