Imperialist competitive algorithm for minimum bit error rate beamforming

Authors:
Arash Khabbazi;Esmaeil Atashpaz-Gargari;Caro Lucas
Affiliations:
School of Electrical and Computer Engineering, University of Tehran, Tehran, Iran.;Control and Intelligent Processing Centre of Excellence, School of Electrical and Computer Engineering, University of Tehran, Tehran, Iran.;Control and Intelligent Processing Centre of Excellence, School of Electrical and Computer Engineering, University of Tehran, Tehran, Iran
Venue:
International Journal of Bio-Inspired Computation
Year:
2009

Citing 1
Cited 6

Practical Genetic Algorithms with CD-ROM

Practical Genetic Algorithms with CD-ROM

A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties

Expert Systems with Applications: An International Journal
Investigating the application of opposition concept to colonial competitive algorithm

International Journal of Bio-Inspired Computation
Analysis of adaptive proportional fair scheduling method on BD-GMD scheme for MIMO systems

International Journal of Wireless and Mobile Computing
Modified imperialist competitive algorithm based on attraction and repulsion concepts for reliability-redundancy optimization

Expert Systems with Applications: An International Journal
Bio-inspired methods for fast and robust arrangement of thermoelectric modulus

International Journal of Bio-Inspired Computation
Bio-inspired computation: success and challenges of IJBIC

International Journal of Bio-Inspired Computation

Quantified Score

Hi-index	0.00

Visualization

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.