The University of Southampton
University of Southampton Institutional Repository

Iterative multiuser detection and channel decoding for DS-CDMA using Harmony Search

Iterative multiuser detection and channel decoding for DS-CDMA using Harmony Search
Iterative multiuser detection and channel decoding for DS-CDMA using Harmony Search
A novel random-guided optimization method is proposed for multiuser detection (MUD) in DS-CDMA systems employing the so-called Harmony Search (HS) algorithm. We specifically design the HS-aided MUD for the communications problem considered and apply it in an iterative joint MUD and channel decoding framework. Our simulation results demonstrate that a near-single-user performance can be achieved without the employment of the full-search-based optimum MUD even in extremely highly loaded DS-CDMA systems.
evolutionary algorithm, harmony search algorithm, iterative receiver, markov chain monte carlo algorithm, multiuser detection
917-920
Zhang, Rong
3be8f78f-f079-4a3f-a151-76ecd5f378f4
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Zhang, Rong
3be8f78f-f079-4a3f-a151-76ecd5f378f4
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Zhang, Rong and Hanzo, Lajos (2009) Iterative multiuser detection and channel decoding for DS-CDMA using Harmony Search. IEEE Signal Processing Letters, 16 (10), 917-920.

Record type: Article

Abstract

A novel random-guided optimization method is proposed for multiuser detection (MUD) in DS-CDMA systems employing the so-called Harmony Search (HS) algorithm. We specifically design the HS-aided MUD for the communications problem considered and apply it in an iterative joint MUD and channel decoding framework. Our simulation results demonstrate that a near-single-user performance can be achieved without the employment of the full-search-based optimum MUD even in extremely highly loaded DS-CDMA systems.

Text
MuD_Channel_Decoding_DSCDMA_HS.pdf - Version of Record
Download (266kB)

More information

Published date: October 2009
Keywords: evolutionary algorithm, harmony search algorithm, iterative receiver, markov chain monte carlo algorithm, multiuser detection
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 267778
URI: https://eprints.soton.ac.uk/id/eprint/267778
PURE UUID: 30862098-2fab-4059-ba0c-9f3eebe4b8fe
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 14 Aug 2009 06:45
Last modified: 20 Jul 2019 01:26

Export record

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.

×