Binary ant colony algorithm for symbol detection in a spatial multiplexing system

  • Authors:
  • Adnan Khan;Sajid Bashir;Muhammad Naeem;Syed Ismail Shah;Asrar Sheikh

  • Affiliations:
  • Centre for Advanced Studies in Engineering, Islamabad, Pakistan;Centre for Advanced Studies in Engineering, Islamabad, Pakistan;Simnon Fraser University Burnaby BC Canada;Iqra University Islamabad, Islamabad, Pakistan;Foundation University, Islamabad, Pakistan

  • Venue:
  • UC'07 Proceedings of the 6th international conference on Unconventional Computation
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

While an optimal Maximum Likelihood (ML) detection using an exhaustive search method is prohibitively complex, we show that binary Ant Colony Optimization (ACO) based Multi-Input Multi-Output (MIMO) detection algorithm gives near-optimal Bit Error Rate (BER) performance with reduced computational complexity. The simulation results suggest that the reported unconventional detector gives an acceptable performance complexity trade-off in comparison with conventional ML and non-linear Vertical Bell labs Layered Space Time (VBLAST) detectors. The proposed technique results in 7- dB enhanced BER performance with acceptable increase in computational complexity in comparison with VBLAST. The reported algorithm reduces the computer time requirement by as much as 94% over exhaustive search method with a reasonable BER performance.