Novel Low-complexity Ant Colony Based Multiuser Detector for Direct Sequence Code Division Multiple Access

In this paper, we present a novel multiuser detection (MUD) technique based on ant colony optimisation (ACO), for synchronous direct sequence code division multiple access 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 bit-error-rate performance in relatively few iterations providing 95% savings in computational complexity. This reduction in complexity is retained even when considering users with unequal received powers.

[1]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[2]  Thomas Stützle,et al.  Guest editorial: special section on ant colony optimization , 2002, IEEE Trans. Evol. Comput..

[3]  Sergio Verdú,et al.  Linear multiuser detectors for synchronous code-division multiple-access channels , 1989, IEEE Trans. Inf. Theory.

[4]  Loïc Brunel,et al.  Lattice decoding for joint detection in direct-sequence CDMA systems , 2003, IEEE Trans. Inf. Theory.

[5]  Lajos Hanzo,et al.  Single- and Multi-Carrier DS-CDMA: Multi-USer Detection, Space-Time Spreading, Synchronisation, Standards and Networking , 2003 .

[6]  W. Teich,et al.  Multiuser detection in DS-CDMA systems based on a lattice code decoder , 2002, IEEE Seventh International Symposium on Spread Spectrum Techniques and Applications,.

[7]  Emanuele Viterbo,et al.  A universal lattice code decoder for fading channels , 1999, IEEE Trans. Inf. Theory.

[8]  A. Viterbi.  CDMA: Principles of Spread Spectrum Communication , 1995 .

[9]  Xiaohu You,et al.  On performance of lattice reduction aided detection in the presence of receive correlation , 2004, Proceedings of the IEEE 6th Circuits and Systems Symposium on Emerging Technologies: Frontiers of Mobile and Wireless Communication (IEEE Cat. No.04EX710).

[10]  Jorma Lilleberg,et al.  Genetic algorithms for multiuser detection in synchronous CDMA , 1997, Proceedings of IEEE International Symposium on Information Theory.

[11]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[12]  Alister G. Burr,et al.  Double window multi-user detection for asynchronous DS-CDMA , 1996 .

[13]  Gregory W. Wornell,et al.  Lattice-reduction-aided detectors for MIMO communication systems , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[14]  S. Moshavi,et al.  Multi-user detection for DS-CDMA communications , 1996, IEEE Commun. Mag..

[15]  Wu-Sheng Lu,et al.  A genetic-algorithm-based multiuser detector for multiple-access communications , 1998, ISCAS '98. Proceedings of the 1998 IEEE International Symposium on Circuits and Systems (Cat. No.98CH36187).

[16]  P. Kempf.  On multi-user detection schemes for synchronous coherent CDMA systems , 1995, 1995 IEEE 45th Vehicular Technology Conference. Countdown to the Wireless Twenty-First Century.

[17]  Terence C. Fogarty.  Using the genetic algorithm to adapt intelligent systems , 1990 .

[18]  Sergio Verdu,et al.  Multiuser Detection , 1998 .

[19]  Ahmed K. Elhakeem,et al.  Signature code selection for multi-user detection scheme in CDMA systems , 1995, Proceedings 1995 Canadian Conference on Electrical and Computer Engineering.

[20]  A. H. Aghvami,et al.  Comparative study of interference cancellation schemes in multi-user detection , 1997 .