Solving “Antenna Array Thinning Problem” Using Genetic Algorithm

  • Jain R
  • Mani G
N/ACitations
Citations of this article
14Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Jain, R., & Mani, G. S. (2012). Solving “Antenna Array Thinning Problem” Using Genetic Algorithm. Applied Computational Intelligence and Soft Computing, 2012, 1–14. https://doi.org/10.1155/2012/946398

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