Discrete Artificial Bee Colony for Computationally Efficient Symbol Detection in Multidevice STBC MIMO Systems

Peer reviewed: 
Yes, item is peer reviewed.
Scholarly level: 
Final version published as: 

Advances in Artificial Intelligence Volume 2013 (2013), Article ID 578710, 14 pages http://dx.doi.org/10.1155/2013/578710

Date created: 
Multi-Input Multi-Output (MIMO)
Communication systems
Space Time Block-Code (STBC)

A Discrete Artificial Bee Colony (DABC) is presented for joint symbol detection at the receiver in a multidevice Space-Time Block Code (STBC) Mutli-Input Multi-Output (MIMO) communication system. Exhaustive search (maximum likelihood detection) for finding an optimal detection has a computational complexity that increases exponentially with the number of mobile devices, transmit antennas per mobile device, and the number of bits per symbol. ABC is a new population-based, swarm-based Evolutionary Algorithms (EA) presented for multivariable numerical functions and has shown good performance compared to other mainstream EAs for problems in continuous domain. This algorithm simulates the intelligent foraging behavior of honeybee swarms. An enhanced discrete version of the ABC algorithm is presented and applied to the joint symbol detection problem to find a nearly optimal solution in real time. The results of multiple independent simulation runs indicate the effectiveness of DABC with other well-known algorithms previously proposed for joint symbol detection such as the near-optimal sphere decoding, minimum mean square error, zero forcing, and semidefinite relaxation, along with other EAs such as genetic algorithm, estimation of distributions algorithm, and the more novel biogeography-based optimization algorithm.

Document type: 
You are free to copy, distribute and transmit this work under the following conditions: You must give attribution to the work (but not in any way that suggests that the author endorses you or your use of the work); You may not use this work for commercial purposes; You may not alter, transform, or build upon this work. Any further uses require the permission of the rights holder (or author if no rights holder is listed). These rights are based on the Creative Commons Attribution-NonCommercial-NoDerivatives License.