Solving "Antenna Array Thinning Problem" Using Genetic Algorithm. (27th September 2012)

• Record Type: Journal Article
• Authors: Jain, Rajashree; Mani, G. S.
• Other Names: Yang Yongqing Academic Editor.
• Is Part Of: Applied computational intelligence and soft computing. Volume 2012(2012)
• Publication Date: 2012-09-27
• Subjects: Computational intelligence -- Periodicals; Soft computing -- Periodicals; 006.305
• DOI: 10.1155/2012/946398
• Languages: English
• ISSNs: 1687-9724

Abstract

Abstract : Thinning involves reducing total number of active elements in an antenna array without causing major degradation in system performance. Dynamic thinning is the process of achieving this under real-time conditions. It is required to find a strategic subset of antenna elements for thinning so as to have its optimum performance. From a mathematical perspective this is a nonlinear, multidimensional problem with multiple objectives and many constraints. Solution for such problem cannot be obtained by classical analytical techniques. It will be required to employ some type of search algorithm which can lead to a practical solution in an optimal. The present paper discusses an approach of using genetic algorithm for array thinning. After discussing the basic concept involving antenna array, array thinning, dynamic thinning, and application methodology, simulation results of applying the technique to linear and planar arrays are presented.