Synthesis of Thinned Linear and Planar Antenna Arrays Using Binary Pso Algorithm

Wang, Weibo; Feng, Quanyuan; Liu, Dong

doi:10.2528/pier12020301

Cited by 59 publications

(68 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…An optimization method based on an adaptive genetic algorithm has been applied to the realtime control of planar antenna arrays in [12]. The chaotic binary particle swarm optimization (CBPSO) algorithm is presented as a useful alternative for the synthesis of thinned arrays in [13]. But the global optimization methods are usually time consuming.…”

Section: Introductionmentioning

confidence: 99%

Pattern Synthesis of Concentric Circular Antenna Array by Nonlinear Least-Square Method

Guo¹,

Guo²,

Qu³

et al. 2013

PIER B

View full text Add to dashboard Cite

Abstract-An improved nonlinear least-square method is presented in this paper. This method changes the traditional least-square method's shortness of being sensitive to its initial conditions. Pattern synthesis for concentric circular arrays using nonlinear least-square method is introduced. The excitation amplitudes and phases of the array elements are optimized. This method can make the design of the feeding network much easier because the excitation amplitudes of the elements placed on the same ring are equal. The number of parameters to be optimized is reduced which leads to a faster simulation speed and makes the simulation results much more accurate. Also, the cost of designing the feeding network is reduced. The simulation results show the good agreement between the synthesized and desired radiation pattern. Also, the peak side lobe level (PSLL) of the synthesized radiation pattern is quite low.

show abstract

Section: Introductionmentioning

confidence: 99%

Pattern Synthesis of Concentric Circular Antenna Array by Nonlinear Least-Square Method

Guo¹,

Guo²,

Qu³

et al. 2013

PIER B

View full text Add to dashboard Cite

show abstract

“…According to the structure shown in Figure 1, where there are 2M isotropic elements placed symmetrically along the x-axis, and array factor AF at θ angle in XZ plane for a linear antenna array can be expressed as [7,9]:…”

Section: Thinned Arraymentioning

confidence: 99%

“…Most of these classical optimization methods (such as Newton methods, down-hill and conjugate gradient) are not well suited for thinning an array, because they can only optimize a few continuous problems and often get stuck in local optimal. Therefore, many stochastic, probabilistic or evolutionary optimization approach, such as simulated annealing [5], genetic algorithm [1], immune algorithm [6], ant colony optimization [7], different evolutions [8], particle swarm optimization algorithm [9] were used and shown to be effective for the synthesis of thinned arrays. Some other approaches [10,11] have also been proposed.…”

Section: Introductionmentioning

confidence: 99%

Synthesis of Thinned Array With Side Lobe Levels Reduction Using Improved Binary Invasive Weed Optimization

Liu¹,

Wu²

2014

PIER M

View full text Add to dashboard Cite

Abstract-As a very powerful optimization algorithm, invasive weed optimization has been widely applied to continuous optimization problems in electromagnetic (EM) field. However, the optimization of a thinned array can be formulated as a discrete-variable optimization problem with solutions encoded as binary strings. Therefore, in this paper, an improved binary invasive weed optimization (IBIWO) is proposed to design a thinned array with minimum side lobe levels. To evaluate the performance of the proposed algorithm, two examples have been presented and solved. Simulation results of the proposed thinned arrays obtained by IBIWO are compared with published results to verify the effectiveness of the proposed method.

show abstract

“…Therefore, mainly global optimization approaches, such as genetic algorithm (GA) [1,4], particle swarm optimization (PSO) [5], ant colony optimization (ACO) [6], differential evolution (DE) algorithm [7][8][9], and some other optimization tools [2,3], were used and shown to be effective for the synthesis of thinned arrays.…”

Section: Introductionmentioning

confidence: 99%

Synthesis of Large Planar Thinned Arrays Using Iwo-Ift Algorithm

Wang¹,

Jiao²,

Liu³

et al. 2013

PIER

View full text Add to dashboard Cite

Abstract-The iterative Fourier technique (IFT) is a high efficiency method that was proposed in recent past for the synthesis of large planar thinned arrays with isotropic radiating elements. However, the selection mechanism of IFT cannot always include the most useful elements in the "turned ON" families, which make the method trap in some local minima. Therefore, in this paper, inspired by invasive weed optimization (IWO) algorithm, a developed version of the iterative Fourier technique (IFT), IWO-IFT, is proposed for thinning large planar arrays. In this new method, the initial weeds are produced by IFT, and are further perturbed by IWO through repeatedly reproduction, dispersion, and exclusion over search space to find better weeds. Numerical results for synthesizing different circular thinned arrays demonstrated the superiority of IWO-IFT over the IFT method.

show abstract

Synthesis of Thinned Linear and Planar Antenna Arrays Using Binary Pso Algorithm

Cited by 59 publications

References 41 publications

Pattern Synthesis of Concentric Circular Antenna Array by Nonlinear Least-Square Method

Pattern Synthesis of Concentric Circular Antenna Array by Nonlinear Least-Square Method

Synthesis of Thinned Array With Side Lobe Levels Reduction Using Improved Binary Invasive Weed Optimization

Synthesis of Large Planar Thinned Arrays Using Iwo-Ift Algorithm

Contact Info

Product

Resources

About