Imperialist competitive algorithm for minimum bit error rate beamforming Online publication date: Mon, 26-Jan-2009
by Arash Khabbazi, Esmaeil Atashpaz-Gargari, Caro Lucas
International Journal of Bio-Inspired Computation (IJBIC), Vol. 1, No. 1/2, 2009
Abstract: In this paper, the recently introduced optimisation strategy, imperialist competitive algorithm (ICA) is used to design an optimal antenna array which minimises the error probability for binary phase shift keying modulation, called minimum bit error rate (MBER) beamforming. ICA is used to deal with the high complexity and high dimensionality of this challenging problem which can not be easily solved by gradient-based methods. The results are compared to that of both a genetic algorithm (GA) and the optimal array obtained by a properly set gradient based algorithm. Comparison shows that in contrast with GA, ICA leads to the array with error probability which is very close to the optimal value. Also, being faster than GA, ICA minimises the cost function with more consistency. The total results show that ICA is a powerful and reliable tool for solving complex optimisation problems such as MBER beamforming.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook