MIMO-aided near-capacity turbo transceivers: taxonomy and performance versus complexity

In this treatise, we firstly review the associated Multiple-Input Multiple-Output (MIMO) system theory and review the family of hard-decision and soft-decision based detection algorithms in the context of Spatial Division Multiplexing (SDM) systems. Our discussions culminate in the introduction of a range of powerful novel MIMO detectors, such as for example Markov Chain assisted Minimum Bit-Error Rate (MC-MBER) detectors, which are capable of reliably operating in the challenging high-importance rank-deficient scenarios, where there are more transmitters than receivers and hence the resultant channel-matrix becomes non-invertible. As a result, conventional detectors would exhibit a high residual error floor. We then invoke the Soft-Input Soft-Output (SISO) MIMO detectors for creating turbo-detected two- or three-stage concatenated SDM schemes and investigate their attainable performance in the light of their computational complexity. Finally, we introduce the powerful design tools of EXtrinsic Information Transfer (EXIT)-charts and characterize the achievable performance of the diverse near- capacity SISO detectors with the aid of EXIT charts

Fixed-complexity quantum-assisted multi-user detection for CDMA and SDMA

In a system supporting numerous users the complexity of the optimal Maximum Likelihood Multi-User Detector (ML MUD) becomes excessive. Based on the superimposed constellations of K users, the ML MUD outputs the specific multilevel K-user symbol that minimizes the Euclidean distance with respect to the faded and noise-contaminated received multi-level symbol. Explicitly, the Euclidean distance is considered as the Cost Function (CF). In a system supporting K users employing M-ary modulation, the ML MUD uses MK CF evaluations (CFE) per time slot. In this contribution we propose an Early Stopping-aided Durr-Høyer algorithm-based Quantum-assisted MUD (ES-DHA QMUD) based on two techniques for achieving optimal ML detection at a low complexity. Our solution is also capable of flexibly adjusting the QMUD's performance and complexity trade-off, depending on the computing power available at the base station. We conclude by proposing a general design methodology for the ES-DHA QMUD in the context of both CDMA and SDMA systems

Multi-user detection for multi-carrier communication systems

Doctor of PhilosophyDepartment of Electrical and Computer EngineeringBalasubramaniam NatarajanWireless broadband communications is a rapidly growing industry. New enabling technologies such as multi-carrier code division multiple access (MC-CDMA) are shaping the future of wireless systems. However, research efforts in improving MC-CDMA receiver performance have received limited attention and there is a need for innovative receiver designs for next generation MC-CDMA. In this thesis, we propose novel multi-user detection (MUD) schemes to enhance the performance of both synchronous and asynchronous MC-CDMA. First, we adapt the ant colony optimization (ACO) approach to solve the optimal MUD problem in MC-CDMA systems. Our simulations indicate that the ACO based MUD converges to the optimal BER performance in relatively few iterations providing more that 95% savings in computational complexity. Second, we propose a new MUD structure specifically for asynchronous MC-CDMA. Previously proposed MUDs for asynchronous MC-CDMA perform the detection for one user (desired user) at a time, mandating multiple runs of the algorithm to detect all users' symbols. In this thesis, for the first time we present a MUD structure that detects all users' symbols simultaneously in one run by extending the receiver's integration window to capture the energy scattered in two consecutive symbol durations. We derive the optimal, decorrelator and minimum mean square error (MMSE) MUD for the extended window case. Our simulations demonstrate that the proposed MUD structures not only perform similar to a MUD that detects one user at a time, but its computational complexity is significantly lower. Finally, we extend the MUD ideas to multicarrier implementation of single carrier systems. Specifically, we employ the novel MUD structure as a multi-symbol detection scheme in CI-CDMA and illustrate the resulting performance gain via simulations

ACO-Based Multi-User Detection in Cooperative CDMA Networks

In this paper, the cooperative diversity is investigated in the uplink of a Code Division Multiple Access (CDMA) network in which users cooperate by relaying each other’s messages toward the Base Station (BS). It is assumed that the spreading waveforms are not orthogonal and hence, Multiple Access Interference (MAI) exists at the relay nodes as well as the BS. MAI degrades the signal quality at both relays and BS and decreases the cooperative diversity gain. To alleviate this problem, an Ant Colony Optimization (ACO) based Multi-User Detector (MUD) has been proposed to efficiently combine the received signals from the direct and relay paths and sub-optimally extract transmitted bits at the BS. The computational complexity of proposed algorithm is significantly lower than that of the Maximum Likelihood (ML) detector. More explicitly, for a cooperative network supporting 15 users, the computational complexity of the proposed ACO algorithm is a factor of 103 lower than that of the optimum Bayesian detector. Simulation results show that the performance of the proposed ACO-based detector can closely approach the maximum diversity in terms of BER and efficiently cancel the MAI at the BS

Quantum search algorithms, quantum wireless, and a low-complexity maximum likelihood iterative quantum multi-user detector design

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

A universal space-time architecture for multiple-antenna aided systems

In this tutorial, we first review the family of conventional multiple-antenna techniques, and then we provide a general overview of the recent concept of the powerful Multiple-Input Multiple-Output (MIMO) family based on a universal Space-Time Shift Keying (STSK) philosophy. When appropriately configured, the proposed STSK scheme has the potential of outperforming conventional MIMO arrangements

On Development of Some Soft Computing Based Multiuser Detection Techniques for SDMA–OFDM Wireless Communication System

Space Division Multiple Access(SDMA) based technique as a subclass of Multiple Input Multiple Output (MIMO) systems achieves high spectral efficiency through bandwidth reuse by multiple users. On the other hand, Orthogonal Frequency Division Multiplexing (OFDM) mitigates the impairments of the propagation channel. The combination of SDMA and OFDM has emerged as a most competitive technology for future wireless communication system. In the SDMA uplink, multiple users communicate simultaneously with a multiple antenna Base Station (BS) sharing the same frequency band by exploring their unique user specific-special spatial signature. Different Multiuser Detection (MUD) schemes have been proposed at the BS receiver to identify users correctly by mitigating the multiuser interference. However, most of the classical MUDs fail to separate the users signals in the over load scenario, where the number of users exceed the number of receiving antennas. On the other hand, due to exhaustive search mechanism, the optimal Maximum Likelihood (ML) detector is limited by high computational complexity, which increases exponentially with increasing number of simultaneous users. Hence, cost function minimization based Minimum Error Rate (MER) detectors are preferred, which basically minimize the probability of error by iteratively updating receiver’s weights using adaptive algorithms such as Steepest Descent (SD), Conjugate Gradient (CG) etc. The first part of research proposes Optimization Techniques (OTs) aided MER detectors to overcome the shortfalls of the CG based MER detectors. Popular metaheuristic search algorithms like Adaptive Genetic Algorithm (AGA), Adaptive Differential Evolution Algorithm (ADEA) and Invasive Weed Optimization (IWO), which rely on an intelligent search of a large but finite solution space using statistical methods, have been applied for finding the optimal weight vectors for MER MUD. Further, it is observed in an overload SDMA–OFDM system that the channel output phasor constellation often becomes linearly non-separable. With increasing the number of users, the receiver weight optimization task turns out to be more difficult due to the exponentially increased number of dimensions of the weight matrix. As a result, MUD becomes a challenging multidimensional optimization problem. Therefore, signal classification requires a nonlinear solution. Considering this, the second part of research work suggests Artificial Neural Network (ANN) based MUDs on thestandard Multilayer Perceptron (MLP) and Radial Basis Function (RBF) frameworks fo

Performance analysis of biological resource allocation algorithms for next generation networks.

Masters Degree. University of KwaZulu-Natal, Durban.Abstract available in PDF.Publications listed on page iii

Resource allocation in non-orthogonal multiple access technologies for 5G networks and beyond.

Doctoral Degree. University of KwaZulu-Natal, Durban.The increasing demand of mobile and device connectivity poses challenging requirements for 5G wireless communications, such as high energy- and spectral-efficiency and low latency. This necessitates a shift from orthogonal multiple access (OMA) to Non-Orthogonal Multiple Access (NOMA) techniques, namely, power-domain NOMA (PD-NOMA) and code-domain NOMA (CD-NOMA). The basic idea behind NOMA schemes is to co-multiplex different users on the same resource elements (time slot, OFDMA sub-carrier, or spreading code) via power domain (PD) or code domain (CD) at the transmitter while permitting controllable interference, and their successful multi-user detection (MUD) at the receiver albeit, increased computational complexity. In this work, an analysis on the performance of the existing NOMA schemes is carried out. Furthermore, we investigate the feasibility of a proposed uplink hybrid-NOMA scheme namely power domain sparse code multiple access (PD-SCMA) that integrates PD-NOMA and CD-NOMA based sparse code multiple access (SCMA) on heterogeneous networks (HetNets). Such hybrid schemes come with resource allocation (RA) challenges namely; codebook allocation, user pairing and power allocation. Therefore, hybrid RA schemes namely: Successive Codebook Ordering Assignment (SCOA) for codebook assignment (CA), opportunistic macro cell user equipment (MUE)- small cell user equipment (SUE) pairing (OMSP) for user pairing (UP), and a QoS-aware power allocation (QAPA) for power allocation (PA) are developed for an energy efficient (EE) system. The performance of the RA schemes is analyzed alongside an analytical RA optimization algorithm. Through numerical results, the proposed schemes show significant improvements in the EE of the small cells in comparison with the prevalent schemes. Additionally, there is significant sum rate performance improvement over the conventional SCMA and PD-NOMA. Secondly, we investigate the multiplexing capacity of the hybrid PD-SCMA scheme in HetNets. Particularly, we investigate and derive closed-form solutions for codebook capacity, MUE multiplexing and power capacity bounds. The system’s performance results into low outage when the system’s point of operation is within the multiplexing bounds. To alleviate the RA challenges of such a system at the transmitter, dual parameter ranking (DPR) and alternate search method (ASM) based RA schemes are proposed. The results show significant capacity gain with DPR-RA in comparison with conventional RA schemes. Lastly, we investigate the feasibility of integrating the hybrid PD-SCMA with multiple-input multipleoutput (MIMO) technique namely, M-PD-SCMA. The attention to M-PD-SCMA resides in the need of lower number of antennas while preserving the system capacity thanks to the overload in PDSCMA. To enhance spectral efficiency and error performance we propose spatial multiplexing at the transmitter and a low complex joint MUD scheme based on successive interference cancellation (SIC) and expectation propagation algorithm (EPA) at the receiver are proposed. Numerical results exhibit performance benchmark with PD-SCMA schemes and the proposed receiver achieves guaranteed bit error rate (BER) performance with a bounded increase in the number of transmit and receive antennas. Thus, the feasibility of an M-PD-SCMA system is validated