By Topic

Near-Optimal Multiuser Detection in Asynchronous MC-CDMA via the Ant Colony Approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hijazi, S.L. ; Dept. of Electr. & Comput. Eng., Kansas State Univ., Manhattan, KS ; Natarajan, B.

In this paper, we present a novel multiuser detection (MUD) structure for asynchronous multi-carrier code division multiple access (MC-CDMA) systems. Previously proposed MUDs assume a desired user while performing joint demodulation. As a result, multiple runs of the demodulation process become necessary to obtain all users' information. In this paper, we present a MUD structure that detects all users' symbols simultaneously in one run. The proposed structure is based on extending the integration time at the receiver to capture the energy scattered in two consecutive symbol durations. We derive the optimal receiver structure and implement it using a low-complexity ant colony optimization (ACO) approach. The proposed ACO-MUD is based on the cooperative foraging strategy of real ants and is shown to converge to the optimal MUD BER performance in relatively few iterations with a 97.7% saving in complexity over an exhaustive search technique

Published in:

Wireless Pervasive Computing, 2007. ISWPC '07. 2nd International Symposium on

Date of Conference:

5-7 Feb. 2007