About this Journal Submit a Manuscript Table of Contents
Applied Computational Intelligence and Soft Computing
Volume 2012 (2012), Article ID 946398, 14 pages
http://dx.doi.org/10.1155/2012/946398
Research Article

Solving “Antenna Array Thinning Problem” Using Genetic Algorithm

1Symbiosis Institute of Computer Studies and Research, (A constituent of Symbiosis International University) Model Colony, Pune Maharashtra State 411016, India
2Departmetn of Information Technology, JS College of Engineering, Handewadi Road, Hadapsar, Pune 411028, India

Received 13 April 2012; Accepted 11 August 2012

Academic Editor: Yongqing Yang

Copyright © 2012 Rajashree Jain and G. S. Mani. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

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.