Backtracking Search Optimization Algorithm for Synthesis of Concentric Circular Antenna Arrays

30Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

A backtracking search optimization algorithm (BSA) is proposed for the synthesis of concentric circular antenna arrays (CCAAs) with the low sidelobe levels at a fixed beamwidth. Several numerical examples of CCAA patterns with the single, multiple, and broad nulls imposed at the directions of interference are also given to illustrate the performance and flexibility of the proposed algorithm. BSA is a relatively new population based evolutionary optimization algorithm. The numerical results show that the design of CCAA using BSA provides good sidelobe levels with a fixed beamwidth. The nulling patterns obtained by BSA are also very good. The quality of results obtained by the BSA is checked by comparing with that of several metaheuristic algorithms in the literature. BSA is also compared with differential search (DS) and bacterial foraging algorithms (BFA) in terms of iterative performances.

Cite

CITATION STYLE

APA

Guney, K., Durmus, A., & Basbug, S. (2014). Backtracking Search Optimization Algorithm for Synthesis of Concentric Circular Antenna Arrays. International Journal of Antennas and Propagation, 2014. https://doi.org/10.1155/2014/250841

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free