Novel low-complexity DS-CDMA multiuser detector based on ant colony optimization

Author

Hijazi, Samer L. ; Natarajan, Balasubramaniam

Author_Institution

Dept. of Electr. & Comput. Eng., Kansas State Univ., Manhattan, KS, USA

Volume

3

fYear

2004

fDate

26-29 Sept. 2004

Firstpage

1939

Abstract

We present a novel multiuser detection (MUD) technique, based on ant colony optimization (ACO), for synchronous direct sequence code division multiple access (DS-CDMA) systems. ACO algorithms are based on the cooperative foraging strategy of real ants. While an optimal MUD design using an exhaustive search method is prohibitively complex, we show that the ACO based MUD converges to the optimal BER performance in relatively few iterations, providing 9.5% saving in computational complexity.

Keywords

code division multiple access; computational complexity; convergence of numerical methods; error statistics; iterative methods; multiuser detection; optimisation; search problems; spread spectrum communication; BER; MUD; ant colony optimization; computational complexity; cooperative foraging strategy; exhaustive search method; iterations; multiuser detection; synchronous DS-CDMA; synchronous direct sequence code division multiple access; Ant colony optimization; Bit error rate; Computational complexity; Detectors; Genetic algorithms; Maximum likelihood detection; Multiaccess communication; Multiuser detection; Particle swarm optimization; Search methods;

fLanguage

English

Publisher

ieee

Conference_Titel

Vehicular Technology Conference, 2004. VTC2004-Fall. 2004 IEEE 60th

ISSN

1090-3038

Print_ISBN

0-7803-8521-7

Type

conf

DOI

10.1109/VETECF.2004.1400376

Filename

1400376