Thinning of concentric circular arrays using galaxy based search algorithm

In this work, the thinning of concentric circular arrays using Galaxy Based Search Algorithm (GBSA). The purpose is to obtain reduce the power taken by the array while preserving acceptable properties as compared to the conventional arrays. Three arrays are considered: a three ring array, an array of five rings and another one of seven rings were used. The aim is to see the impact and effectiveness of thinning as the number of elements of the array increases. The varied parameter is amplitude-only and the variation is not continuous from 0 to 1 but is constrained to take binary values i.e. either 0 or 1. This work exploits the GBSA adaptability to this problem where the variables can only take binary values, in addition to the good performance it demonstrated with the continuous problems.