arXiv:2411.05411 · Asilomar Conference on Signals, Systems and Computers (ACSSC)

Quantum Annealing for Active User Detection in NOMA Systems

Romain Piron, Claire Goursaud

Published Oct 27, 2024• 8 citations

Abstract

Detecting active users in a non-orthogonal multiple access (NOMA) network poses a significant challenge for 5G/6G applications. Traditional algorithms tackling this task, relying on classical processors, have to make a compromise between performance and complexity. However, a quantum computing based strategy called quantum annealing (QA) can mitigate this tradeoff. In this paper, we first propose a mapping between the AUD searching problem and the identification of the ground state of an Ising Hamiltonian. Then, we compare the execution times of our QA approach for several code domain multiple access (CDMA) scenarios. We evaluate the impact of the cross-correlation properties of the chosen codes in a NOMA network for detecting the active user's set.

DOI: 10.1109/ieeeconf60004.2024.10943100

Related papers

Scheduling Quantum Annealing for Active User Detection in a NOMA Network

Romain Piron, Claire Goursaud

Active user detection in a non-orthogonal multiple access (NOMA) network is a major challenge for 5G/6G applications. However, classical algorithms that can perform this task suffer either from complexity or reduced performances. This work aims at proposing a quantum annealing approach to overcome this trade-off. Firstly, we show that the maximum a posteriori decoder of the activity pattern of the network can be seen as the ground state of an Ising Hamiltonian. For N users in a network with perfect channels, we propose a universal control function to schedule the annealing process. Our approach avoids to continuously compute the optimal control function but still ensures high success probability while demanding a lower annealing time than a linear control function. This advantage holds even in the presence of imperfections in the network.

arXiv:2407.21547IEEE International Conference on Quantum Computing and Engineering (QCE)Sep 15, 20243 citations

A Performance Comparison of Classical and Quantum Algorithm for Active User Detection

Muhammad Idham Habibie, Jihad Hamie, Claire Goursaud

The strong growth in the number of connected mobile devices has imposed new challenges in efficiently exploiting the available networks resources. Code Domain Non-Orthogonal Multiple Access (NOMA) technique appears as a tremendous efficient solution. Each device uses its assigned code to simultaneously transmit its data along with the user identifier, without any resource reservation exchange, saving precious wireless resources. However, this requires a receiver capable of blindly detecting the active users, which is highly complex. Driven by the promising superposition property of quantum architecture, the goal of this paper is to adapt and apply the quantum Grover algorithm for Active User Detection (AUD) purpose in the context of NOMA, to alleviate the search complexity. This adapted Grover’s algorithm is compared with the optimal classical Maximum Likelihood (ML) AUD receivers, as well as with the basic classical Conventional Correlation Receiver (CCR). A benchmark on the probability of AUD is assessed as a function of the Signal to Noise Ratio (SNR) of the received signal. We show that our adapted Grover’s algorithm is very promising in high SNR regime.

IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)Jul 4, 20226 citations

Towards Quantum Annealing for Multi-user NOMA-based Networks

Eldar Gabdulsattarov, Khaled Maaiuf Rabie, Xingwang Li +1 more

Quantum Annealing (QA) uses quantum fluctuations to search for a global minimum of an optimization-type problem faster than classical computer. To meet the demand for future internet traffic and mitigate the spectrum scarcity, this work presents the QA-aided maximum likelihood (ML) decoder for multi-user non-orthogonal multiple access (NOMA) networks as an alternative to the successive interference cancellation (SIC) method. The practical system parameters such as channel randomness and possible transmit power levels are taken into account for all individual signals of all involved users. The brute force (BF) and SIC signal detection methods are taken as benchmarks in the analysis. The QA-assisted ML decoder results in the same BER performance as the BF method outperforming the SIC technique, but the execution of QA takes more time than BF and SIC. The parallelization technique can be a potential aid to fasten the execution process. This will pave the way to fully realize the potential of QA decoders in NOMA systems.

arXiv:2301.03872IEEE Vehicular Technology ConferenceSep 1, 20224 citations

Quantum Annealing-Aided Multi-User Detection: An Application to Uplink Non-Orthogonal Multiple Access

Kouki Yonaga, Kenichi Takizawa

A new method to realize computation of the log-likelihood ratio (LLR) in multi-user detection (MUD) by quantum annealing (QA) is proposed herein. One metaheuristic algorithm for solving combinatorial optimization problems is QA. Recently, QA has been applied in various fields to hasten computations. This study specifically examines the application of QA in up-link non-orthogonal multiple access (UL-NOMA) that employs iterative MUD. Our proposed method, QA-aided MUD, uses QA to calculate LLR in iterative MUD. We tested QA-aided MUD with a D-Wave quantum annealer. The error rate analysis demonstrates that QA-aided MUD has comparable performance to that of conventional MUD method. Furthermore, when the annealing time was set to 20 µs, we demonstrated than that the total computation time is 1/10 of the computation time necessary when using a digital computer. We also evaluated the convergence behavior of QA-aided MUD through evolution of mutual information. The results indicate that QA-assisted MUD has almost identical convergence performance to that of the conventional MUD method for LLR calculations.

International Conference on CommunicationsMay 28, 20237 citations

Grover-Based PLS: AUD and Beamforming with Artificial Noise in CD-NOMA

Deemah H. Tashman, Soumaya Cherkaoui

Sixth-Generation (6G) networks will require massive connectivity, ultra-low latency, and robust security, making reliable Active User Detection (AUD) essential for interference control and physical layer protection. This letter proposes a Grover-based physical layer security (PLS) framework for a code-domain non-orthogonal multiple access (CD-NOMA) network, where the base station employs artificial-noise (AN)-assisted beamforming and identifies the active set via Grover's quantum search algorithm. We consider two threat models: passive eavesdroppers formed by detected inactive users, and active eavesdroppers selected as the top f% most frequent transmitters among detected active users. By aligning beams and AN with the Grover-based AUD output, the proposed scheme enlarges the main-wiretap rate gap and significantly improves the average secrecy rate compared with compressive sensing and classical correlation receiver baselines, while approaching maximum-likelihood detection performance with a quadratic reduction in search complexity. The impact of the information/AN power split, the base station transmit power, and the fraction of highly active users treated as eavesdroppers on secrecy is characterized through numerical simulations, and design insights are extracted for 6G PLS under both passive and active eavesdropping.

arXiv:2607.05429Jul 2, 20260 citations

Quantum Minimum Searching Algorithms for Active User Detection in Wireless IoT Networks

Muhammad Idham Habibie, Claire Goursaud, Jihad Hamie

The key features of 5G, such as ultra-reliable low latency (URLLC) and massive machine-type communication (mMTC), are designed to address the need for low latency and the ability to connect a large number of devices in the IoT context. To support these constraints, mobile devices transmit information without previously establishing a connection with the base station (BS). This requires the Base Station to detect in real-time the active users (process known as Active User Detection (AUD)). With classical processors, one can employ the Maximum Likelihood (ML) method (the optimal detector, but suffers from high complexity and delay), or suboptimal ones (which are simpler, but less reliable). Meanwhile, quantum algorithms, particularly Durr and Hoyer (DHA) algorithm, addressing minimum searching problems, can significantly reduce complexity while keeping good performances. However, these algorithms were designed for generic problems, and their initialization and parameterization are blindly done. Nonetheless, we can have access to prior information on the system’s behavior. Therefore, in this paper, we aim to adapt and improve these quantum algorithms by using prior knowledge on the system for the AUD problem. We first propose a novel algorithm, the Improved Iterative Minimum Searching Algorithm (IIMSA) where we define more efficiently the parameters. Then, further enhancements of IIMSA are obtained thanks to a better initialization of the algorithms by exploiting classical preprocessing of the received signals with classical Conventional Correlation Receiver (CCR) or Zero Forcing (ZF). The obtained results show that these proposed algorithms operate more efficiently (i.e., less complexity with better accuracy).

IEEE Internet of Things JournalApr 1, 20245 citations