2015 Asia-Pacific Microwave Conference (APMC) 2015
DOI: 10.1109/apmc.2015.7412993
|View full text |Cite
|
Sign up to set email alerts
|

Sparse circular array pattern optimization based on MOPSO and convex optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 5 publications
0
4
0
Order By: Relevance
“…The algorithms involved in the simulation include the proposed DPSO-HSS algorithm, RDPSO algorithm in [ 13 ], NPSOWM algorithm in [ 14 ], and MOPSO-CO algorithm in [ 4 ].…”
Section: Numerical Results and Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…The algorithms involved in the simulation include the proposed DPSO-HSS algorithm, RDPSO algorithm in [ 13 ], NPSOWM algorithm in [ 14 ], and MOPSO-CO algorithm in [ 4 ].…”
Section: Numerical Results and Analysismentioning
confidence: 99%
“…Rahardjo et al [ 3 ] developed a new method for designing linear thinned arrays using spacing coefficients based on Taylor line source distribution, which is verified to be able to correctly match different beam pattern configurations without repeated global optimization. Recently, analytical thinning methods by convex optimization [ 4 ] and Bayesian compressive sensing [ 5 ] have been introduced, but these methods need to set a suitable reference pattern as a precondition. Keizer [ 6 ] proposed the iterative Fourier technique (IFT) for array thinning.…”
Section: Introductionmentioning
confidence: 99%
“…Theoretically, the low side lobe level (SLL) can be obtained by optimizing the feeding current and position of each element. Some algorithms are employed to large scale sparse array optimizations, such as genetic algorithm (GA) [3], particle swarm optimization [4], and Harmony Search Algorithm [5]. Among the optimization methods, genetic algorithm is one of the most popular optimization techniques used for side lobe level reduction [6][7][8][9], since GAs [10] are well suited for sparse and thinning array optimization.…”
Section: Introductionmentioning
confidence: 99%
“…Various optimization methods have been reported to synthesize sparse circular arrays in [14][15][16][17][18][19][20][21][22], including analytical techniques and evolutionary algorithms. In [14] and [15], the vector mapping (VM) method and matrix mapping method were used to handle complicated constraints for linear and planar arrays, respectively.…”
Section: Introductionmentioning
confidence: 99%