The University of Southampton
University of Southampton Institutional Repository

Genetic-Algorithm-Assisted Multiuser Detection in Asynchronous CDMA Communications

Genetic-Algorithm-Assisted Multiuser Detection in Asynchronous CDMA Communications
Genetic-Algorithm-Assisted Multiuser Detection in Asynchronous CDMA Communications
Abstract—In an asynchronous direct-sequence code-division multiple-access, a specific bit of the reference user is interfered by two asynchronously arriving surrounding bits of all the other users supported by the system. Hence, for optimum multiuser detection, the entire input bit sequence influencing the current bit decisions must be considered, which results in a high detection delay as well as a high receiver complexity. Suboptimal multiuser-detection methods have been proposed based on a truncated observation window, in which the so-called “edge” bits are tentatively estimated by some other means. Using a similar approach, a multiuser detector is developed in this contribution that invokes genetic algorithms (GAs) in order to estimate both the desired bits as well as the edge bits within the truncated observation window. Using computer simulations, we showed that by employing GAs for improving the estimation reliability of the edge bits, our proposed multiuser detector is capable of achieving a near-optimum bit-error-rate performance, while imposing a lower complexity than the optimum multiuser detector. Index Terms—Code-division multiple access (CDMA), genetic algorithms (GAs), multiuser detection.
0018-9545
1413-1422
YEN, K.
612372e4-f48b-4d17-8e9f-6dd57676d3e9
HANZO, L.
66e7266f-3066-4fc0-8391-e000acce71a1
YEN, K.
612372e4-f48b-4d17-8e9f-6dd57676d3e9
HANZO, L.
66e7266f-3066-4fc0-8391-e000acce71a1

YEN, K. and HANZO, L. (2004) Genetic-Algorithm-Assisted Multiuser Detection in Asynchronous CDMA Communications. IEEE Transactions on Vehicular Technology, 53 (5), 1413-1422.

Record type: Article

Abstract

Abstract—In an asynchronous direct-sequence code-division multiple-access, a specific bit of the reference user is interfered by two asynchronously arriving surrounding bits of all the other users supported by the system. Hence, for optimum multiuser detection, the entire input bit sequence influencing the current bit decisions must be considered, which results in a high detection delay as well as a high receiver complexity. Suboptimal multiuser-detection methods have been proposed based on a truncated observation window, in which the so-called “edge” bits are tentatively estimated by some other means. Using a similar approach, a multiuser detector is developed in this contribution that invokes genetic algorithms (GAs) in order to estimate both the desired bits as well as the edge bits within the truncated observation window. Using computer simulations, we showed that by employing GAs for improving the estimation reliability of the edge bits, our proposed multiuser detector is capable of achieving a near-optimum bit-error-rate performance, while imposing a lower complexity than the optimum multiuser detector. Index Terms—Code-division multiple access (CDMA), genetic algorithms (GAs), multiuser detection.

Text
ky-lh-sept04-tvt.pdf - Other
Download (556kB)

More information

Published date: September 2004
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 260286
URI: https://eprints.soton.ac.uk/id/eprint/260286
ISSN: 0018-9545
PURE UUID: 87585312-f36b-4f01-9e8b-c2d18b1b354b
ORCID for L. HANZO: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 19 Jan 2005
Last modified: 07 Aug 2019 00:53

Export record

Contributors

Author: K. YEN
Author: L. 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.

×