The University of Southampton
University of Southampton Institutional Repository

Fixed-complexity quantum-assisted multi-user detection for CDMA and SDMA

Fixed-complexity quantum-assisted multi-user detection for CDMA and SDMA
Fixed-complexity quantum-assisted multi-user detection for CDMA and SDMA
In a system supporting numerous users the complexity of the optimal Maximum Likelihood Multi-User Detector (ML MUD) becomes excessive. Based on the superimposed constellations of K users, the ML MUD outputs the specific multilevel K-user symbol that minimizes the Euclidean distance with respect to the faded and noise-contaminated received multi-level symbol. Explicitly, the Euclidean distance is considered as the Cost Function (CF). In a system supporting K users employing M-ary modulation, the ML MUD uses MK CF evaluations (CFE) per time slot. In this contribution we propose an Early Stopping-aided Durr-Høyer algorithm-based Quantum-assisted MUD (ES-DHA QMUD) based on two techniques for achieving optimal ML detection at a low complexity. Our solution is also capable of flexibly adjusting the QMUD's performance and complexity trade-off, depending on the computing power available at the base station. We conclude by proposing a general design methodology for the ES-DHA QMUD in the context of both CDMA and SDMA systems.
pp. 990-1000
Botsinis, Panagiotis
d7927fb0-95ca-4969-9f8c-1c0455524a1f
Ng, Soon Xin
e19a63b0-0f12-4591-ab5f-554820d5f78c
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Botsinis, Panagiotis
d7927fb0-95ca-4969-9f8c-1c0455524a1f
Ng, Soon Xin
e19a63b0-0f12-4591-ab5f-554820d5f78c
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Botsinis, Panagiotis, Ng, Soon Xin and Hanzo, Lajos (2014) Fixed-complexity quantum-assisted multi-user detection for CDMA and SDMA. IEEE Transactions on Communications, vol. 62 (no. 3), pp. 990-1000. (doi:10.1109/TCOMM.2014.012514.130615).

Record type: Article

Abstract

In a system supporting numerous users the complexity of the optimal Maximum Likelihood Multi-User Detector (ML MUD) becomes excessive. Based on the superimposed constellations of K users, the ML MUD outputs the specific multilevel K-user symbol that minimizes the Euclidean distance with respect to the faded and noise-contaminated received multi-level symbol. Explicitly, the Euclidean distance is considered as the Cost Function (CF). In a system supporting K users employing M-ary modulation, the ML MUD uses MK CF evaluations (CFE) per time slot. In this contribution we propose an Early Stopping-aided Durr-Høyer algorithm-based Quantum-assisted MUD (ES-DHA QMUD) based on two techniques for achieving optimal ML detection at a low complexity. Our solution is also capable of flexibly adjusting the QMUD's performance and complexity trade-off, depending on the computing power available at the base station. We conclude by proposing a general design methodology for the ES-DHA QMUD in the context of both CDMA and SDMA systems.

Text
TCOM-13-0615-2.pdf - Author's Original
Download (896kB)

More information

e-pub ahead of print date: 3 February 2014
Published date: March 2014
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 361476
URI: https://eprints.soton.ac.uk/id/eprint/361476
PURE UUID: 9cdf9ca5-a2b5-4494-bc04-135e5259b012
ORCID for Soon Xin Ng: ORCID iD orcid.org/0000-0002-0930-7194
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 24 Jan 2014 10:04
Last modified: 02 Aug 2018 00:34

Export record

Altmetrics

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.

×