NOVEL LOW-COMPLEXITY ANT COLONY BASED MULTIUSER DETECTOR FOR DIRECT SEQUENCE CODE DIVISION MULTIPLE ACCESS

Abstract

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.