Forward-Reverse Orthogonal Matching Pursuit-Union-Subspace Pursuit-Based Multiuser Detector for Uplink Grant-Free NOMA Networks

Multiuser Detection (MUD) is quite challenging in uplink grant-free non-orthogonal multiple access wireless communication networks in which users sporadically transmit data. The reason for this is that the base station (BS) must perform detection of both multiuser activity and user signals concurrently, because knowledge of user activity status is not available at the BS. In this paper, a new multiuser detector, named the Forward-Reverse Orthogonal Matching Pursuit–Union–Subspace pursuit (FROMPUS)-based MUD, is proposed. The detector takes advantage of the concept of an initial support set. This serves as initial knowledge that is then employed in the reconstruction of active users’ signals. In addition, the detector uses the “serial-include” technique of incorporating a likely support set element candidates and a reliability testing procedure in which the most prominent elements of the support set are selected. To assess the performance of the proposed detector, computer simulations are performed. The results obtained for various parameter settings show that the FROMPUS performs better than any of the other five detectors considered in this paper. However, this excellent performance comes with a slightly higher computational complexity cost. Nonetheless, the cost is inconsequential, since the detector operates at the BS where complexity is of low priority in comparison to performance.

An Efficient Two-Stage Receiver Base on AOR Iterative Algorithm and Chebyshev Acceleration for Uplink Multiuser Massive-MIMO OFDM Systems

The massive multiple-input multiple-output systems (M-MIMO) and orthogonal frequency-division multiplexing (OFDM) are considered to be some of the most promising key techniques in the emerging 5G and advanced wireless communication systems nowadays. Not only are the benefits of applying M-MIMO and OFDM for broadband communication well known, but using them for the application of the Internet of Things (IoT) requires a large amount of wireless transmission, which is a developing topic. However, its high complexity becomes a problem when there are numerous antennas. In this paper, we provide an effective two-stage multiuser detector (MUD) with the assistance of the accelerated over-relaxation (AOR) iterative algorithm and Chebyshev acceleration for the uplink of M-MIMO OFDM systems to achieve a better balance between bit error rate (BER) performance and computational complexity. The first stage of the receiver consists of an accelerated over-relaxation (AOR)-based estimator and is intended to yield a rough initial estimate of the relaxation factor ω, the acceleration parameter γ, and transmitted symbols. In the second stage, the Chebyshev acceleration method is used for detection, and a more precise signal is produced through efficient iterative estimation. Additionally, we call this proposed scheme Chebyshev-accelerated over-relaxation (CAOR) detection. Conducted simulations show that the developed receiver, with a modest computational load, can provide superior performance compared with previous works, especially in the MU M-MIMO uplink environments.

Generalized Receiver with Parallel Interference Cancellation for Multiuser Detection

Parallel interference cancellation is considered as a simple yet effective multiuser detector for direct -sequence code-division multiple-access (DS-CDMA) systems. However, system performance be deteriorated due to unreliable interference cancellation in the early stages. Thus, a detector with the partial parallel interfere-nce cancellation in which the partial cancellation factors are introduced to control the interference cancellation level has been developed as a remedy. Although the partial cancellation factors are crucial, complete solutions for their optimal values are not available. In this paper, we consider a two-stage decoupled generalized receiver with the partial parallel interference cancellation. Using the minimum bit error rate (BER) criterion, we derive a complete set of optimal partial cancellation factors. This includes the optimal partial cancellation factors for pe-riodic and aperiodic spreading codes in channels with the additive white Gaussian noise and multipath chann-els. Simulation results demonstrate that the considered theoretical optimal partial cancellation factors agree clo-sely with empirical ones. The proposed two-stage generalized receiver with the partial parallel interference can-cellation using the derived optimal partial cancellation factors outperforms not only a two-stage, but also a three-stage conventional generalized receiver with the full parallel interference cancellation.

Limited-Search Chase Decoding Algorithm for LDPC Coded Underwater Acoustic Multiuser Channels

In this paper, we propose a low-complexity soft-input/soft-output (SISO) Chase multiuser detector that has a polynomial computational complexity in terms of the number of the least reliable bit positions for low-density parity-check (LDPC) coded code-division multiple-access (CDMA) systems, which is a potentially competitive technology for underwater acoustic networks (UWAN). Simulation results over highly correlated channels show that the proposed detector can afford searching over a larger number of the least reliable bit positions and achieve better bit-error-rate (BER) performance as compared with the Chase-II detector at much lower complexity.

Low-Complexity Address Generation for Multiuser Detectors in IDMA Systems

This paper presents a low-complexity address generation unit (AGU) for multiuser detectors in interleave division multiple access (IDMA) systems. To this end, for the first time, all possible options for designing AGUs are first analyzed in detail. Subsequently, a complexity reduction technique is applied to each of those architectures. More specifically, some components in AGUs are relocated to make them shareable and removable without affecting the functionality. The complete transparency of such renovation makes it applicable to any existing multiuser detector without tailoring the interfacing components therein. Measuring the hardware complexity, all the resulting AGUs are compared with each other, and a new architecture simpler than the state-of-the-art one is developed. Implementation results in a 65 nm CMOS process, demonstrating that the proposed AGU can alleviate the equivalent gate count and the power consumption of the prior process by 13% and 31%, respectively.

Exact Bit Error-Rate Analysis of Two-User NOMA Using QAM with Arbitrary Modulation Orders

This work considers the exact bit error rate (BER) analysis of a two-user non-orthogonal multiple access (NOMA) system using quadrature amplitude modulation (QAM). Unlike existing work, no constraints on the modulation order of the QAM symbols for any user. Closed-form expressions are derived for the BER of joint multiuser detector (JMuD), which is demonstrated that it is equivalent to the successive interference cancellation (SIC) receiver. Moreover, a general expression is derived for the relation between the power allocation factors for the two users, which depends on the modulation order for each user.