Linear Aperiodic Array Synthesis Using Differential Evolution Algorithm

Zhang, Fenggan; Jia, Weimin; Mao, Yao

doi:10.1109/lawp.2013.2270930

Cited by 50 publications

(25 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the optimization of linear array, we search the best position shift and optimized amplitude for setting  = 0 and  S =0, 15, 30, 45, 60 to synthesize the pattern according to (6). The fitness value of the initial iteration and final iteration has an expectant convergence by FPSO.…”

Section: Numerical Examples and Results Analysismentioning

confidence: 99%

Array Pattern Synthesis Using a Digital Position Shift Method

Han¹,

Wang²

2016

RADIOENGINEERING

View full text Add to dashboard Cite

show abstract

Section: Numerical Examples and Results Analysismentioning

confidence: 99%

Array Pattern Synthesis Using a Digital Position Shift Method

Han¹,

Wang²

2016

RADIOENGINEERING

View full text Add to dashboard Cite

show abstract

“…Therefore, sparse arrays have more freedom degrees of optimization to achieve lower PSLL than thin arrays have. Recently, several approaches, such as analytical methods [3][4][5], modified genetic algorithm (MGA) [6], differential evolution algorithm (DEA) [7], vector mapping and simultaneous perturbation stochastic approximation [8], and invasive weed optimization (IWO) [9] have been developed for synthesizing sparse arrays. The performances of those techniques on achieving low PSLL are quite limited as a result of position-only optimization.…”

Section: Introductionmentioning

confidence: 99%

A Hybrid Algorithm for Synthesizing Linear Sparse Arrays

Zhao¹,

Zhang²,

Yang³

2016

PIER C

View full text Add to dashboard Cite

Abstract-A hybrid algorithm based on the invasive weed optimization (IWO) and the convex optimization (CVX) is proposed for minimizing the peak sidelobe level (PSLL) of linear array with focused and/or shaped beam pattern. In this approach, IWO is adopted to produce the array (described by element positions), and CVX is used to determine the excitations for each produced array. Then the corresponding PSLL acts as the fitness function of IWO to find the optimal positions which lead to the minimum PSLL. Numerical experiments are conducted to validate the effectiveness and robustness of the proposed hybrid approach. Compared with other techniques, a lower PSLL can be achieved with a fixed main beam width or with a shaped main beam using this hybrid algorithm. Moreover, this method can easily cope with some constraints on the aperture, such as the minimum element spacing and the total number of elements.

show abstract

“…Sidelobe suppression problem has been widely discussed by researchers in the context of centralized antenna array [7][8][9][10][11][12][13][14][15][16][17][18][19]. Metaheuristic algorithms such as genetic algorithm (GA) [14], particle swarm optimization (PSO) [17,16,15] and evolutionary algorithm (EA) [18,11,19] are popular approaches that has been undertaken to solve this problem in the past.…”

Section: Introductionmentioning

confidence: 99%

“…Metaheuristic algorithms such as genetic algorithm (GA) [14], particle swarm optimization (PSO) [17,16,15] and evolutionary algorithm (EA) [18,11,19] are popular approaches that has been undertaken to solve this problem in the past. However, most of these researches exploit the array's geometry to achieve beampattern with reduced sidelobe, whereas position of the nodes in CB scenarios usually cannot be arranged.…”

Section: Introductionmentioning

confidence: 99%