The University of Southampton
University of Southampton Institutional Repository

Reduced-complexity near-optimal Ant-Colony-aided multi-user detection for CDMA systems

Reduced-complexity near-optimal Ant-Colony-aided multi-user detection for CDMA systems
Reduced-complexity near-optimal Ant-Colony-aided multi-user detection for CDMA systems
Reduced-complexity near-maximum-likelihood Ant-Colony Optimization (ACO) assisted Multi-User Detectors (MUDs) are proposed and investigated. The exhaustive search complexity of the optimal detection algorithm may be deemed excessive for practical applications. For example, a Space-Time Block Coded (STBC) two transmit assisted K = 32-user system has to search through the candidate-space for finding the final detection output during 264 times per symbol duration by invoking the Euclidean-distance-calculation of a 64-element complex-valued vector. Hence, a nearoptimal or near-ML MUDs are required in order to provide a near-optimal BER performance at a significantly reduced complexity.

Specifically, the ACO assisted MUD algorithms proposed are investigated in the context of a Multi-Carrier DS-CDMA (MC DS-CDMA) system, in a Multi-Functional Antenna Array (MFAA) assisted MC DS-CDMA system and in a STBC aided DS-CDMA system. The ACO assisted MUD algorithm is shown to allow a fully loaded MU system to achieve a near-single user performance, which is similar to that of the classic Minimum Mean Square Error (MMSE) detection algorithm. More quantitatively, when the STBC assisted system support K = 32 users, the complexity imposed by the ACO based MUD algorithm is a fraction of 1 × 10?18 of that of the full search-based optimum MUD.

In addition to the hard decision based ACO aided MUD a soft-output MUD was also developed,which was investigated in the context of an STBC assisted DS-CDMA system using a three-stage concatenated, iterative detection aided system. It was demonstrated that the soft-output system is capable of achieving the optimal performance of the Bayesian detection algorithm.
Xu, Chong
acdb0d0f-a2a4-406f-b206-5abfe2228007
Xu, Chong
acdb0d0f-a2a4-406f-b206-5abfe2228007
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Xu, Chong (2009) Reduced-complexity near-optimal Ant-Colony-aided multi-user detection for CDMA systems. University of Southampton, Faculty of Physical and Applied Sciences, Doctoral Thesis, 270pp.

Record type: Thesis (Doctoral)

Abstract

Reduced-complexity near-maximum-likelihood Ant-Colony Optimization (ACO) assisted Multi-User Detectors (MUDs) are proposed and investigated. The exhaustive search complexity of the optimal detection algorithm may be deemed excessive for practical applications. For example, a Space-Time Block Coded (STBC) two transmit assisted K = 32-user system has to search through the candidate-space for finding the final detection output during 264 times per symbol duration by invoking the Euclidean-distance-calculation of a 64-element complex-valued vector. Hence, a nearoptimal or near-ML MUDs are required in order to provide a near-optimal BER performance at a significantly reduced complexity.

Specifically, the ACO assisted MUD algorithms proposed are investigated in the context of a Multi-Carrier DS-CDMA (MC DS-CDMA) system, in a Multi-Functional Antenna Array (MFAA) assisted MC DS-CDMA system and in a STBC aided DS-CDMA system. The ACO assisted MUD algorithm is shown to allow a fully loaded MU system to achieve a near-single user performance, which is similar to that of the classic Minimum Mean Square Error (MMSE) detection algorithm. More quantitatively, when the STBC assisted system support K = 32 users, the complexity imposed by the ACO based MUD algorithm is a fraction of 1 × 10?18 of that of the full search-based optimum MUD.

In addition to the hard decision based ACO aided MUD a soft-output MUD was also developed,which was investigated in the context of an STBC assisted DS-CDMA system using a three-stage concatenated, iterative detection aided system. It was demonstrated that the soft-output system is capable of achieving the optimal performance of the Bayesian detection algorithm.

Text
report-thesis_xu.pdf - Other
Restricted to Repository staff only until 31 December 2021.
Available under License University of Southampton Thesis Licence.

More information

Published date: June 2009
Organisations: University of Southampton, Southampton Wireless Group

Identifiers

Local EPrints ID: 206015
URI: https://eprints.soton.ac.uk/id/eprint/206015
PURE UUID: a01171da-756c-4c15-86bb-7f6edc639ccd
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 14 Dec 2011 16:59
Last modified: 20 Feb 2019 01:38

Export record

Contributors

Author: Chong Xu
Thesis advisor: Lajos Hanzo ORCID iD

University divisions

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×