Abstract
dc:description.abstractThe high complexity of numerous optimal classical communication schemes, such as the Maximum Likelihood (ML) and Maximum A posteriori Probability (MAP) Multi-User Detector (MUD) designed for coherent detection or the ML and MAP Multiple-Symbol Differential Detectors (MSDD) conceived for non-coherent receivers often prevents their practical implementation. In this thesis we commence with a review and tutorial on Quantum Search Algorithms (QSA) and propose a number of hard-output and iterative Quantum-assisted MUDs (QMUD) and MSDDs (QMSDD).<br/><br/>We employ a QSA, termed as the Durr-Hyer Algorithm (DHA) that finds the minimum of a function in order to perform near-optimal detection with quadratic reduction in the computational complexity, when compared to that of the ML MUD / MSDD. Two further techniques conceived for reducing the complexity of the DHA-based Quantum-assisted MUD (QMUD) are also proposed. These novel QMUDs / QMSDDs are employed in the uplink of various multiple access systems, such as Direct Sequence Code Division Multiple Access systems, Space Division Multiple Access systems as well as in Direct-Sequence Spreading and Slow Subcarrier Hopping SDMA systems amalgamated with Orthogonal Frequency Division Multiplexing and Interleave Division Multiple Access systems.<br/><br/>Furthermore, we follow a quantum approach to achieve the same performance as the optimal Soft Input Soft-Output (SISO) classical detectors by replacing them with a quantum algorithm, which estimates the weighted sum of all the evaluations of a function. We propose a SISO QMUD / QMSDD scheme, which is the quantum-domain equivalent of the MAP MUD / MSDD. Both our EXtrinsic Information Transfer (EXIT) charts and Bit Error Ratio (BER) curves show that the computational complexity of the proposed QMUD / QMSDD is significantly lower than that of the MAP MUD / MSDD, whilst their performance remains equivalent. Moreover, we propose two additional families of iterative DHA-based QMUD / QMSDDs for performing near-optimal MAP detection exhibiting an even lower tunable complexity than the QWSA QMUD. Several variations of the proposed QMUD / QMSDDs have been developed and they are shown to perform better than the state-of-the-art low-complexity MUDs / MSDDs at a given complexity. Their iterative decoding performance is investigated with the aid of non-Gaussian EXIT charts.<br/>
Degree
thesis:*- Name dc:type.qualificationname
- Ph.D.
- Level dc:type.qualificationlevel
- doctoral
- Grantor dc:publisher.institution
- University of Southampton
- Year dc:date.issued
- 2015
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Botsinis, Panagiotis
- Advisor dc:contributor.advisor
-
- Hanzo, Lajos
- ORCID person:identifier.orcid
Rights
- Language dc:language
- English, eng