The University of Southampton
University of Southampton Institutional Repository

Low-complexity iterative quantum multi-user detection in SDMA systems

Low-complexity iterative quantum multi-user detection in SDMA systems
Low-complexity iterative quantum multi-user detection in SDMA systems
The potentially excessive complexity of the Maximum Likelihood Multi-User Detector (ML MUD) in large-scale Spatial Division Multiple Access (SDMA) systems dictates the employment of low-complexity sub-optimal MUDs in the context of conventional systems. However, this limitation was circumvented by the recently proposed Durr-Høyer Algorithm (DHA)-aided Quantum Weighted Sum Algorithm (QWSA)-based Quantum Multi-User Detector (QMUD) employed for performing optimal ML iterative detection in SDMA systems. Focusing our attention on the QWSA, we analyse the QMUD and the evolution of the quantum system with the aid of a simple SDMA uplink scenario. We characterize the performance of the DHA-QWSA QMUD advocated, which is capable of matching the performance of the ML MUD both in terms of its EXIT charts and BER curves.
computational complexity, quantum computing, quantum search algorithms, spatial division multiple access
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) Low-complexity iterative quantum multi-user detection in SDMA systems At IEEE International Conference on Communications, Australia. 10 - 14 Jun 2014. 6 pp.

Record type: Conference or Workshop Item (Paper)

Abstract

The potentially excessive complexity of the Maximum Likelihood Multi-User Detector (ML MUD) in large-scale Spatial Division Multiple Access (SDMA) systems dictates the employment of low-complexity sub-optimal MUDs in the context of conventional systems. However, this limitation was circumvented by the recently proposed Durr-Høyer Algorithm (DHA)-aided Quantum Weighted Sum Algorithm (QWSA)-based Quantum Multi-User Detector (QMUD) employed for performing optimal ML iterative detection in SDMA systems. Focusing our attention on the QWSA, we analyse the QMUD and the evolution of the quantum system with the aid of a simple SDMA uplink scenario. We characterize the performance of the DHA-QWSA QMUD advocated, which is capable of matching the performance of the ML MUD both in terms of its EXIT charts and BER curves.

PDF 2col_main_QWSA-SDMA.pdf - Author's Original
Download (482kB)

More information

Accepted/In Press date: 10 June 2014
Venue - Dates: IEEE International Conference on Communications, Australia, 2014-06-10 - 2014-06-14
Keywords: computational complexity, quantum computing, quantum search algorithms, spatial division multiple access
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 362236
URI: http://eprints.soton.ac.uk/id/eprint/362236
PURE UUID: 7bdd4ef3-2fe2-4d88-ab5c-8ae994196935
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: 18 Feb 2014 16:21
Last modified: 18 Jul 2017 02:54

Export record

Contributors

Author: Panagiotis Botsinis
Author: Soon Xin Ng ORCID iD
Author: 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

Library staff edit
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 http://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.

×