IEEE International Symposium on Spread Spectrum Techniques and Applications (ISSSTA)

Performance evaluation of quantum based multi-user detector

Sándor Imre, Ferenc Balázs

Published Jun 25, 2003• 6 citations

Abstract

Future wired and wireless communication systems will employ pure or combined code division multiple access (CDMA) techniques, such as in the European 3G mobile UMTS or power line communications system, but also several 4G proposals include, for example, multicarrier (MC) CDMA. Previous investigations discovered the drawbacks of single user detectors (SUD), which are widely employed in narrowband IS-95 CDMA systems, and were forced to develop suitable multiuser detection schemes to increase the efficiency against interference. However, at this moment there are only suboptimal solutions available became of the rather high complexity of optimal detectors. One of the possible receiver technologies may be quantum assisted computing devices which allow high level parallelism in computation. The first commercial devices are estimated for the next years, which meets the advent of 3G and 4G systems. We analyze the error probability and give tight bounds in a static and dynamically changing environment for a novel quantum computation based quantum multi-user detection (QMUD) algorithm, employing a quantum counting algorithm, which provides an optimal solution.

DOI: 10.1109/isssta.2002.1049354

Related papers

Non-coherent multi-user detection based on quantum search

Sándor Imre, Ferenc Balázs

3G and 4G mobile systems are based on CDMA technology. In order to increase the efficiency of CDMA receivers a large amount of effort is invested to develop suitable multi-user detector techniques. However, at this moment there are only suboptimal solutions available because of the rather high complexity of optimal detectors. One of the possible receiver technologies can be the quantum assisted computing devices which allows high level parallelism in computation. The first commercial devices are estimated by 2004, which meets the advent of 3G and 4G systems. We introduce a novel quantum computation based quantum multi-user detection (QMUD), employing Grover's (see Bell Labs, April 1999)search algorithm, which provides optimal solution. The proposed algorithm is robust to any kind of noise/suboptimal solutions.

International Conference on CommunicationsJun 25, 200325 citations

Positive Operation Valued Measurement Based Multi-User Detection in DS-CDMA Systems

Sándor Imre, Ferenc Balázs

3G and 4G mobile are based on CDMA technology. In order to increase the effectiveness of CDMA receivers large amount of effort is invested to develop suitable multi-user detector techniques. However, at this moment there are only suboptimal solutions available because of the rather high complexity of optimal detectors. One of the possible receiver technologies can be the quantum assisted computing devices which allows high level parallelism in computation. The first commercial devices are estimated by 2004, which meets the advert of 3G and 4G systems. In this paper we introduce a novel quantum computation based Quantum Multi-user detection (QMUD) algorithm, employing simple Positive Operation Valued Measurement (POVM), which provides optimal solution. The proposed algorithm is robust to any kind of noise.

arXiv:quant-ph/0201039Jan 10, 20022 citations

The Application of Quantum POVM Algorithmin DS-CDMA Multiuser Detection

MA Xiu-fei, Wei Han

In this paper,we present a quantum computation based multiuser detector algorithm,which involves the Positive Operation Valued Measurement.QMUD provides optimal detection in finite time and complexity.The new method utilizes one of possible future receiver technologies of 3G and 4G mobile systems.

Journal of Xuzhou Normal UniversityJan 1, 20040 citations

Quantum multi-user detection

Shengmei Zhao, Baoyu Zheng

Future wired and wireless communication system will employ multi-user detection techniques, however, at this moment there are only suboptimal solutions available because of the rather high complexity of optimal detectors. Quantum detection techniques promise efficient optimal solutions to this NP (non-polynomial) hard problem. In this paper, we propose a novel approach in the multi-access quantum channel based on the quantum rotation algorithm, by which the minimum average probability of error can be obtained. We evaluate the probability of error under various correlation coefficients and signal-to-interference ratio, and compare them to that of classical optimal solution and the quantum solution under quantum Bayesian minimum cost strategy. The simulation results illustrate that the performance of quantum multi-user detection can be improved greatly when quantum rotation algorithm is employed. Meanwhile, much less time overhead is involved in the calculation.

International Symposium on Signal Processing and Its Applications (ISSPA)Oct 4, 200618 citations

Quantum-assisted multi-user wireless systems

Panagiotis Botsinis

The 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). 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. 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.

Mar 1, 20150 citations

Quantum Search Algorithms, Quantum Wireless, and a Low-Complexity Maximum Likelihood Iterative Quantum Multi-User Detector Design

Panagiotis Botsinis, Soon Xin Ng, Lajos Hanzo

The high complexity of numerous optimal classic communication schemes, such as the maximum likelihood (ML) multiuser detector (MUD), often prevents their practical implementation. In this paper, we present an extensive review and tutorial on quantum search algorithms (QSA) and their potential applications, and we employ a QSA that finds the minimum of a function in order to perform optimal hard MUD with a quadratic reduction in the computational complexity when compared to that of the ML MUD. Furthermore, we follow a quantum approach to achieve the same performance as the optimal soft-input soft-output classic detectors by replacing them with a quantum algorithm, which estimates the weighted sum of a function's evaluations. We propose a soft-input soft-output quantum-assisted MUD (QMUD) scheme, which is the quantum-domain equivalent of the ML MUD. We then demonstrate its application using the design example of a direct-sequence code division multiple access system employing bit-interleaved coded modulation relying on iterative decoding, and compare it with the optimal ML MUD in terms of its performance and complexity. Both our extrinsic information transfer charts and bit error ratio curves show that the performance of the proposed QMUD and that of the optimal classic MUD are equivalent, but the QMUD's computational complexity is significantly lower.

IEEE AccessJan 1, 201364 citations