Generalised MBER-based vector precoding design for multiuser transmission

We propose a generalized vector precoding (VP) design based on the minimum bit error rate (MBER) criterion for multiuser transmission in the downlink of a multiuser system, where the base station (BS) equipped with multiple transmitting antennas communicates with single-receiving-antenna mobile station (MS) receivers each having a modulo device. Given the knowledge of the channel state information and the current information symbol vector to be transmitted, our scheme directly generates the effective symbol vector based on the MBER criterion using the particle swarm optimization (PSO) algorithm. The proposed PSO-aided generalized MBER VP scheme is shown to outperform the powerful minimum mean-square-error (MMSE) VP and improved MMSE-VP benchmarks, particularly for rank-deficient systems, where the number of BS transmitting antennas is lower than the number of MSs supported

Quantum-aided multi-user transmission in non-orthogonal multiple access systems

With the research on implementing a universal quantum computer being under the technological spotlight, new possibilities appear for their employment in wireless communications systems for reducing their complexity and improving their performance. In this treatise, we consider the downlink of a rank-deficient, multi-user system and we propose the discrete-valued and continuous-valued Quantum-assisted Particle Swarm Optimization (QPSO) algorithms for performing Vector Perturbation (VP) precoding, as well as for lowering the required transmission power at the Base Station (BS), while minimizing the expected average Bit Error Ratio (BER) at the mobile terminals. We use the Minimum BER (MBER) criterion. We show that the novel quantum-assisted precoding methodology results in an enhanced BER performance, when compared to that of a classical methodology employing the PSO algorithm, while requiring the same computational complexity in the challenging rank-deficient scenarios, where the number of transmit antenna elements at the BS is lower than the number of users. Moreover, when there is limited Channel State Information (CSI) feedback from the users to the BS, due to the necessary quantization of the channel states, the proposed quantum-assisted precoder outperforms the classical precoder

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

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

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

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

Recursive least squares semi-blind beamforming for MIMO using decision directed adaptation and constant modulus criterion

A new semi-blind adaptive beamforming scheme is proposed for multi-input multi-output (MIMO) induced and space- division multiple-access based wireless systems that employ high order phase shift keying signaling. A minimum number of training symbols, very close to the number of receiver antenna elements, are used to provide a rough initial least squares estimate of the beamformer0s weight vector. A novel cost function combining the constant modulus criterion with decision-directed adaptation is adopted to adapt the beamformer weight vector. This cost function can be approximated as a quadratic form with a closed-form solution, based on which we then derive the recursive least squares (RLS) semi-blind adaptive beamforming algorithm. This semi-blind adaptive beamforming scheme is capable of converging fast to the minimum mean-square-error beamforming solution, as demonstrated in our simulation study. Our proposed semi-blind RLS beamforming algorithm therefore provides an e±cient detection scheme for the future generation of MIMO aided mobile communication systems

On Efficient Signal Processing Algorithms for Signal Detection and PAPR Reduction in OFDM Systems

The driving force of the study is susceptibility of LS algorithm to noise. As LS algorithm is simple to implement, hence it’s performance improvement can contribute a lot to the wireless technology that are especially deals with high computation. Cascading of AdaBoost algorithm with LS greatly influences the OFDM system performance. Performance of Adaptive Boosting based symbol recovery was investigated on the performance of LS, MMSE, BLUE were also compared with the performance of AdaBoost algorithm and MMSE has been found the higher computational complexity. Furthermore, MMSE also requires apriori channel statistics and computational complexity O(5N3) of the MMSE increases exponentially as the number of carrier increases. For the Adaboost case the computational complexity calculation is little different.Therefore, in the training stage of the AdaBoost algorithm, the computational complexity is only O(nT M) Furthermore, as it is a classification algorithm so in the receiver side we will require a separate de-mapper (or decoder) to get the desired data bits, i.e., a. SAS aided DCT based PAPR reduction 1326 and b. SAS aided DCT based PAPR reduction. A successive addition subtraction preprocessed DCT based PAPR reduction technique was proposed. Here, the performance of proposed method was compared with other preexisting techniques like SLM and PTS and the performance of the proposed method was seen to outperform specially in low PAPR region. In the proposed PAPR reduction method, the receiver is aware of the transmitted signal processing, this enables a reverse operation at the receiver to extract the transmit data. Hence the requirement of sending extra information through extra subcarrier is eliminated. The proposed method is also seen to be spectrally efficient. In the case of PTS and SLM it is inevitable to send the side information to retrieve the transmit signal. Hence, these two methods are spectrally inefficient. Successive addition subtraction based PAPR reduction method was also applied to MIMO systems. The performance of the SAS based PAPR reduction method also showed better performance as compared to other technique. An extensive simulation of MIMO OFDM PAPR reduction was carried out by varying the number of subcarriers and number of transmitter antennas. A detailed computational complexity analysis was also carried out. BATE aided SDMA multi user detection. A detailed study of SDMA system was carried out with it’s mathematical analysis.Many linear and non linear detectors like ML, MMSE, PIC, SIC have been proposed in literature for multiuser detection of SDMA system. However, except MMSE every receivers other are computational extensive. So as to enhance the performance of the MMSE MUD a meta heuristic Bat algorithm was incorporated in cascade with MMSE

A Linear Multi-User Detector for STBC MC-CDMA Systems based on the Adaptive Implementation of the Minimum-Conditional Bit-Error-Rate Criterion and on Genetic Algorithm-assisted MMSE Channel Estimation

The implementation of efficient baseband receivers characterized by affordable computational load is a crucial point in the development of transmission systems exploiting diversity in different domains. In this paper, we are proposing a linear multi-user detector for MIMO MC-CDMA systems with Alamouti’s Space-Time Block Coding, inspired by the concept of Minimum Conditional Bit-Error-Rate (MCBER) and relying on Genetic-Algorithm (GA)-assisted MMSE channel estimation. The MCBER combiner has been implemented in adaptive way by using Least-Mean-Square (LMS) optimization. Firstly, we shall analyze the proposed adaptive MCBER MUD receiver with ideal knowledge of Channel Status Information (CSI). Afterwards, we shall consider the complete receiver structure, encompassing also the non-ideal GA-assisted channel estimation. Simulation results evidenced that the proposed MCBER receiver always outperforms state-of-the-art receiver schemes based on EGC and MMSE criterion exploiting the same degree of channel knowledge (i.e. ideal or estimated CSI)