2009Systems engineering and electronicsRequires access

Sparse circular arrays method based on modified DE algorithm

Han Chun-lin

Open publisher page 2 citations

Abstract

Circular arrays are widely used because of their pattern characteristics,but their sidelobe levels are high compared with the mainlobe levels.Aimming at the problem of rarefying circular arrays antenna modules to minimize sidelobe levels as much as possible and taking the angle subtraction as the individual element,this paper carries on arranging the certain arrays size,the certain number of arrays element and the certain minimum element spacing sparse optimization arrays by using a modified differential evolution algorithm,which reduces search region and enhances search efficiency.The simulation results show that the method may enhance the convergence rate and reduce the circular arrays sidelobe levels effectively.

About this research paper

What this paper is about

Circular arrays are widely used because of their pattern characteristics,but their sidelobe levels are high compared with the mainlobe levels.Aimming at the problem of rarefying circular arrays antenna modules to minimize sidelobe levels as much as possible and taking the angle subtraction as the individual element,this paper carries on arranging the certain arrays size,the certain number of arrays element and the certain minimum element spacing sparse optimization arrays by using a modified differential evolution algorithm,which reduces search region and enhances search efficiency.The simulation results show that the method may enhance the convergence rate and reduce the circular arrays sidelobe levels effectively.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Circular arrays are widely used because of their pattern characteristics,but their sidelobe levels are high compared with the mainlobe levels.Aimming at the problem of rarefying circular arrays antenna modules to minimize sidelobe levels as much as possible and taking the angle subtraction as the individual element,this paper carries on arranging the certain arrays size,the certain number of arrays element and the certain minimum element spacing sparse optimization arrays by using a modified differential evolution algorithm,which reduces search region and enhances search efficiency.The simulation results show that the method may enhance the convergence rate and reduce the circular arrays sidelobe levels effectively.

Key concepts: Convergence (economics), Algorithm, Circular buffer, Antenna array, Element (criminal law), Antenna (radio), Rate of convergence, Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Sparse circular arrays method based on modified DE algorithm — Research Paper | ScholarLens