Ant-Colony-Based Multiuser Detection for MC DS-CDMA Systems
Ant-Colony-Based Multiuser Detection for MC DS-CDMA Systems
In this contribution we present a novel ant colony optimization (ACO) based multi-user detector (MUD) designed for synchronous multi-carrier direct sequence code division multiple access (MC DSCDMA) systems. The operation of the ACO-based MUD is based on the behaviour of the ant colony in nature. The ACO-based MUD aims for achieving the same bit-error-rate (BER) performance as the optimum maximum likelihood (ML) MUD, without carrying out an exhaustive search of the entire MC DS-CDMA search space constituted by all possible combinations of the received multi-user vectors. We will demonstrate that the system is capable of supporting almost as many users as the number of chips in the spreading sequence, while searching only a small fraction of the entire ML search space. It will also be demonstrated that the number of floating point operations per second is a factor of 108 lower for the proposed ACO-based MUD than that of the ML MUD, when supporting K = 32 users in a MC DS-CDMA system employing 31-chip Gold codes as the T-domain spreading sequence.
960-964
Xu, C
744a2cb6-5baa-4fd9-9999-3f93001bb414
Yang, L-L
ae425648-d9a3-4b7d-8abd-b3cfea375bc7
Hanzo, L
66e7266f-3066-4fc0-8391-e000acce71a1
30 September 2007
Xu, C
744a2cb6-5baa-4fd9-9999-3f93001bb414
Yang, L-L
ae425648-d9a3-4b7d-8abd-b3cfea375bc7
Hanzo, L
66e7266f-3066-4fc0-8391-e000acce71a1
Xu, C, Yang, L-L and Hanzo, L
(2007)
Ant-Colony-Based Multiuser Detection for MC DS-CDMA Systems.
IEEE VTC'07 (Fall), Baltimore, MD, United States.
30 Sep - 03 Oct 2007.
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
In this contribution we present a novel ant colony optimization (ACO) based multi-user detector (MUD) designed for synchronous multi-carrier direct sequence code division multiple access (MC DSCDMA) systems. The operation of the ACO-based MUD is based on the behaviour of the ant colony in nature. The ACO-based MUD aims for achieving the same bit-error-rate (BER) performance as the optimum maximum likelihood (ML) MUD, without carrying out an exhaustive search of the entire MC DS-CDMA search space constituted by all possible combinations of the received multi-user vectors. We will demonstrate that the system is capable of supporting almost as many users as the number of chips in the spreading sequence, while searching only a small fraction of the entire ML search space. It will also be demonstrated that the number of floating point operations per second is a factor of 108 lower for the proposed ACO-based MUD than that of the ML MUD, when supporting K = 32 users in a MC DS-CDMA system employing 31-chip Gold codes as the T-domain spreading sequence.
Text
04349858.pdf
- Other
More information
Published date: 30 September 2007
Additional Information:
Event Dates: 30 September-3 October 2007
Venue - Dates:
IEEE VTC'07 (Fall), Baltimore, MD, United States, 2007-09-30 - 2007-10-03
Organisations:
Southampton Wireless Group
Identifiers
Local EPrints ID: 264954
URI: http://eprints.soton.ac.uk/id/eprint/264954
PURE UUID: 4129270e-f45d-40ab-94b5-62adc22fd98f
Catalogue record
Date deposited: 12 Dec 2007 15:03
Last modified: 18 Mar 2024 02:49
Export record
Contributors
Author:
C Xu
Author:
L-L Yang
Author:
L Hanzo
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics