Approximating the pareto fronts for synthesis of planar antenna array using binary cat swarm optimization algorithm

Various performance indices like peak sidelobe level (PSLL), first null beamwidth (FNBW) and count of elements contrast to each other while designing an antenna array. A swarm-based intelligence mechanism has been discussed here for optimizing these performance indices. In particular, a pareto front...

Full description

Saved in:
Bibliographic Details
Published inJournal of physics. Conference series Vol. 2471; no. 1; pp. 12023 - 12030
Main Authors Vankayalapati, Sahiti, Pappula, Lakshman, Kumar, KTPS, rao, K. Narayana, Raju, K. Hemanth Kumar, Vinay, V. Sai
Format Journal Article
LanguageEnglish
Published Bristol IOP Publishing 01.04.2023
Subjects
Algorithms
Antenna arrays
Antennas
Approximation
Optimization
Performance indices
Physics
Sidelobes
Synthesis
Online AccessGet full text
ISSN1742-6588
1742-6596
1742-6596
DOI10.1088/1742-6596/2471/1/012023

Cover

More Information
Summary:Various performance indices like peak sidelobe level (PSLL), first null beamwidth (FNBW) and count of elements contrast to each other while designing an antenna array. A swarm-based intelligence mechanism has been discussed here for optimizing these performance indices. In particular, a pareto front is approximated for bringing out the best compromised array performance having low PSLL with narrow FNBW while maintaining a smaller number of antenna elements. A thinned planar antenna array of 20×10 was synthesized using multi-objective modified binary cat swarm optimization (MO-BCSO) algorithm to obtain the optimal positions of the array elements. The indicated technique is most appropriate for the synthesis of large antenna arrays.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1742-6588
1742-6596
1742-6596
DOI:10.1088/1742-6596/2471/1/012023