Hybrid Iterative Multiuser Detection for Channel Coded Space Division Multiple Access OFDM Systems

Space division multiple access (SDMA) aided orthogonal frequency division multiplexing (OFDM) systems assisted by efficient multiuser detection (MUD) techniques have recently attracted intensive research interests. The maximum likelihood detection (MLD) arrangement was found to attain the best performance, although this was achieved at the cost of a computational complexity, which increases exponentially both with the number of users and with the number of bits per symbol transmitted by higher order modulation schemes. By contrast, the minimum mean-square error (MMSE) SDMA-MUD exhibits a lower complexity at the cost of a performance loss. Forward error correction (FEC) schemes such as, for example, turbo trellis coded modulation (TTCM), may be efficiently combined with SDMA-OFDM systems for the sake of improving the achievable performance. Genetic algorithm (GA) based multiuser detection techniques have been shown to provide a good performance in MUD-aided code division multiple access (CDMA) systems. In this contribution, a GA-aided MMSE MUD is proposed for employment in a TTCM assisted SDMA-OFDM system, which is capable of achieving a similar performance to that attained by its optimum MLD-aided counterpart at a significantly lower complexity, especially at high user loads. Moreover, when the proposed biased Q-function based mutation (BQM) assisted iterative GA (IGA) MUD is employed, the GA-aided system’s performance can be further improved, for example, by reducing the bit error ratio (BER) measured at 3 dB by about five orders of magnitude in comparison to the TTCM assisted MMSE-SDMA-OFDM benchmarker system, while still maintaining modest complexity

Iterative Joint Channel Estimation and Symbol Detection for Multi-User MIMO OFDM

Multiple-Input-Multiple-Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM) systems have recently attracted substantial research interest. However, compared to Single-Input-Single-Output (SISO) systems, channel estimation in the MIMO scenario becomes more challenging, owing to the increased number of independent transmitter-receiver links to be estimated. In the context of the Bell LAyered Space-Time architecture (BLAST) or Space Division Multiple Access (SDMA) multi-user MIMO OFDM literature, no channel estimation technique allows the number of users to be higher than the number of receiver antennas, which is often referred to as an “overloaded” scenario. In this contribution we propose a new Genetic Algorithm (GA) assisted iterative joint channel estimation and multiuser detection approach for MIMO SDMA-OFDM systems, which exhibits a robust performance in the above-mentioned overloaded scenario. Furthermore, GA-aided Multi-User Detection (MUD) techniques found in the literature can only provide a hard-decision output, while the proposed GA is capable of providing “soft” outputs, hence achieving an improved performance with the aid of channel decoders. Finally, a range of simulation results are provided to demonstrate the superiority of the proposed scheme

Performance Analysis of Overloaded Mimo-Ofdm Systems Using Iterative Joint Turbo Decoding

The Third Generation Partnership Project (3GPP) Long Term Evolution (LTE) employs turbo codes as its Forward Error Correction (FEC) standard along with multiple input, multiple output (MIMO) systems is used for achieving an excellent error correcting capability and higher throughput. Even if turbo decoding scheme gives adequate performance in ideal MIMO systems, but there is a significant performance degradation in an overloaded MIMO system when the number of transmit antennas is larger than that of receive antennas. In joint turbo decoding, controls of soft information be located accompanied for every permutation of bits from all stream. A super trellis diagram is obtained by combining the trellis diagram of each stream. Experimental results obtained through the joint turbo decoding achieve better performance than the turbo decoding scheme especially in the case of an overloaded MIMO systems. In this paper, BER and throughput for joint turbo decoding scheme is analyzed with different channels (TU channel, Rayleigh fading channel, Rician fading channel) and compared with viterbi decoding. Based on this analysis, joint turbo decoding scheme of MIMO systems with four transmit and two receive antenna of Rician fading channel achieved better performance with BER of 10-3 and higher throughput

Application of integer quadratic programming in detection of high-dimensional wireless systems

High-dimensional wireless systems have recently generated a great deal of interest due to their ability to accommodate increasing demands for high transmission data rates with high communication reliability. Examples of such large-scale systems include single-input, single-output symbol spread OFDM system, large-scale single-user multi-input multi-output (MIMO) OFDM systems, and large-scale multiuser MIMO systems. In these systems, the number of symbols required to be jointly detected at the receiver is relatively large. The challenge with the practical realization of these systems is to design a detection scheme that provides high communication reliability with reasonable computational complexity, even as the number of simultaneously transmitted independent communication signals becomes very large.^ Most of the optimal or near-optimal detection techniques that have been proposed in the literature of relatively low-dimensional wireless systems, such as MIMO systems in which number of antennas is less than 10, become problematic for high-dimensional detection problems. That is, their performance degrades or the computational complexity becomes prohibitive, especially when higher-order QAM constellations are employed.^ In the first part of this thesis, we propose a near-optimal detection technique which offers a flexible trade-off between complexity and performance. The proposed technique formulates the detection problem in terms of Integer Quadratic Programming (IQP), which is then solved through a controlled Branch and Bound (BB) search tree algorithm. In addition to providing good performance, an important feature of this approach is that its computational complexity remains roughly the same even as we increase the constellation order from 4-QAM to 256-QAM. The performance of the proposed algorithm is investigated for both symbol spread OFDM systems and large-scale MIMO systems with both frequency selective and at fading channels.^ The second part of this work focuses on a reduced complexity version of IQP referred to as relaxed quadratic programming (QP). In particular, QP is used to reformulate two widely used detection schemes for MIMO OFDM: (1) Successive Interference Cancellation (SIC) and (2) Iterative Detecting and Decoding (IDD). First, SIC-based algorithms are derived via a QP formulation in contrast to using a linear MMSE detector at each stage. The resulting QP-SIC algorithms offer lower computational complexity than the SIC schemes that employ linear MMSE at each stage, especially when the dimension of the received signal vector is high. Three versions of QP-SIC are proposed based on various trade-offs between complexity and receiver performance; each of the three QP-SIC algorithms outperforms existing SIC techniques. Second, IDD-based algorithms are developed using a QP detector. We show how the soft information, in terms of the Log Likelihood Ratio (LLR), can be extracted from the QP detector. Further, the procedure for incorporating the a-priori information that is passed from the channel decoder to the QP detector is developed. Simulation results are presented demonstrating that the use of QP in IDD offers improved performance at the cost of a reasonable increase in complexity compared to linear detectors

Iterative Detection for Overloaded Multiuser MIMO OFDM Systems

Inspired by multiuser detection (MUD) and the ‘Turbo principle’, this thesis deals with iterative interference cancellation (IIC) in overloaded multiuser multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems. Linear detection schemes, such as zero forcing (ZF) and minimum mean square error (MMSE) cannot be used for the overloaded system because of the rank deficiency of channel matrix, while the optimal approach, the maximum likelihood (ML) detection has high computational complexity. In this thesis, an iterative interference cancellation (IIC) multiuser detection scheme with matched filter and convolutional codes is considered. The main idea of this combination is a low complexity receiver. Parallel interference cancellation (PIC) is employed to improve the multiuser receiver performance for overloaded systems. A log-likelihood ratio (LLR) converter is proposed to further improve the reliability of the soft value converted from the output of the matched filter. Simulation results show that the bit error rate (BER) performance of this method is close to the optimal approach for a two user system. However, for the four user or more user system, it has an error floor of the BER performance. For this case, a channel selection scheme is proposed to distinguish whether the channel is good or bad by using the mutual information based on the extrinsic information transfer (EXIT) chart. The mutual information can be predicted in a look-up table which greatly reduces the complexity. For those ‘bad’ channels identified by the channel selection, we introduce two adaptive transmission methods to deal with such channels: one uses a lower code rate, and the other is multiple transmissions. The use of an IIC receiver with the interleave-division multiple access (IDMA) to further improve the BER performance without any channel selection is also investigated. It has been shown that this approach can remove the error floor. Finally, the influence of channel accuracy on the IIC is investigated. Pilot-based Wiener filter channel estimation is used to test and verify how much the IIC is influenced by the channel accuracy

BER and Capacity/Spectral Efficiency Enhancement of MIMO Systems Using Digital Antenna Arrays Beamforming

Multi-input Multi-output (MIMO) systems are of the most promising ones in the field of wireless communications as they provide high data rates and reduce the bit error rate (BER) using spatial multiplexing (SM) and diversity gain techniques, respectively. The deep review of MIMO systems shows that most of them are based on the utilization of uniform linear antennas (ULA) arrays. For further performance enhancement, a new digital array beamforming technique for linear antenna arrays optimization is introduced for both single-user and multi-user MIMO systems to achieve maximum gain. In our proposed technique, the antenna arrays are implemented for a higher gain by adjusting the feeding and the distance between the antenna elements. The modified mathematical model for our proposed digital array beamforming MIMO system has been derived and merged to the current linear detection techniques such as Maximum Likelihood (ML), Zero Forcing (ZF), and Minimum Mean Square Error (MMSE). The simulation results demonstrated the superiority of our proposed technique over the traditional MIMO systems in terms of BER and spectral efficiency (SE)

Gaussian Message Passing for Overloaded Massive MIMO-NOMA

This paper considers a low-complexity Gaussian Message Passing (GMP) scheme for a coded massive Multiple-Input Multiple-Output (MIMO) systems with Non-Orthogonal Multiple Access (massive MIMO-NOMA), in which a base station with $N_s$ antennas serves $N_u$ sources simultaneously in the same frequency. Both $N_u$ and $N_s$ are large numbers, and we consider the overloaded cases with $N_u>N_s$. The GMP for MIMO-NOMA is a message passing algorithm operating on a fully-connected loopy factor graph, which is well understood to fail to converge due to the correlation problem. In this paper, we utilize the large-scale property of the system to simplify the convergence analysis of the GMP under the overloaded condition. First, we prove that the \emph{variances} of the GMP definitely converge to the mean square error (MSE) of Linear Minimum Mean Square Error (LMMSE) multi-user detection. Secondly, the \emph{means} of the traditional GMP will fail to converge when $N_u/N_s< (\sqrt{2}-1)^{-2}\approx5.83$. Therefore, we propose and derive a new convergent GMP called scale-and-add GMP (SA-GMP), which always converges to the LMMSE multi-user detection performance for any $N_u/N_s>1$, and show that it has a faster convergence speed than the traditional GMP with the same complexity. Finally, numerical results are provided to verify the validity and accuracy of the theoretical results presented.Comment: Accepted by IEEE TWC, 16 pages, 11 figure

Soft-decision equalization techniques for frequency selective MIMO channels

Multi-input multi-output (MIMO) technology is an emerging solution for high data rate wireless communications. We develop soft-decision based equalization techniques for frequency selective MIMO channels in the quest for low-complexity equalizers with BER performance competitive to that of ML sequence detection. We first propose soft decision equalization (SDE), and demonstrate that decision feedback equalization (DFE) based on soft-decisions, expressed via the posterior probabilities associated with feedback symbols, is able to outperform hard-decision DFE, with a low computational cost that is polynomial in the number of symbols to be recovered, and linear in the signal constellation size. Building upon the probabilistic data association (PDA) multiuser detector, we present two new MIMO equalization solutions to handle the distinctive channel memory. With their low complexity, simple implementations, and impressive near-optimum performance offered by iterative soft-decision processing, the proposed SDE methods are attractive candidates to deliver efficient reception solutions to practical high-capacity MIMO systems. Motivated by the need for low-complexity receiver processing, we further present an alternative low-complexity soft-decision equalization approach for frequency selective MIMO communication systems. With the help of iterative processing, two detection and estimation schemes based on second-order statistics are harmoniously put together to yield a two-part receiver structure: local multiuser detection (MUD) using soft-decision Probabilistic Data Association (PDA) detection, and dynamic noise-interference tracking using Kalman filtering. The proposed Kalman-PDA detector performs local MUD within a sub-block of the received data instead of over the entire data set, to reduce the computational load. At the same time, all the inter-ference affecting the local sub-block, including both multiple access and inter-symbol interference, is properly modeled as the state vector of a linear system, and dynamically tracked by Kalman filtering. Two types of Kalman filters are designed, both of which are able to track an finite impulse response (FIR) MIMO channel of any memory length. The overall algorithms enjoy low complexity that is only polynomial in the number of information-bearing bits to be detected, regardless of the data block size. Furthermore, we introduce two optional performance-enhancing techniques: cross- layer automatic repeat request (ARQ) for uncoded systems and code-aided method for coded systems. We take Kalman-PDA as an example, and show via simulations that both techniques can render error performance that is better than Kalman-PDA alone and competitive to sphere decoding. At last, we consider the case that channel state information (CSI) is not perfectly known to the receiver, and present an iterative channel estimation algorithm. Simulations show that the performance of SDE with channel estimation approaches that of SDE with perfect CSI

Layered Steered Space–Time-Spreading-Aided Generalized MC DS-CDMA

Abstract—We present a novel trifunctional multiple-input– multiple-output (MIMO) scheme that intrinsically amalgamates space–time spreading (STS) to achieve a diversity gain and a Vertical Bell Labs layered space–time (V-BLAST) scheme to attain a multiplexing gain in the context of generalized multicarrier direct-sequence code-division multiple access (MC DS-CDMA), as well as beamforming. Furthermore, the proposed system employs both time- and frequency-domain spreading to increase the number of users, which is also combined with a user-grouping technique to reduce the effects of multiuser interference

Polynomial matrix QR decomposition and iterative decoding of frequency selective MIMO channels

For a frequency flat multi-input multi-output (MIMO) system the QR decomposition can be applied to reduce the MIMO channel equalization problem to a set of decision feedback based single channel problems. Using a novel technique for polynomial matrix QR decomposition (PMQRD) based on Givens rotations, we show the PMQRD can do likewise for a frequency selective MIMO system. Two types of transmitter design, based on Horizontal and Vertical Bell Laboratories Layered Space Time (H-BLAST, V-BLAST) encoding have been implemented. Receiver processing utilizes Turbo equalization to exploit multipath delay spread and to facilitate multi-stream data feedback. Average bit error rate simulations show a considerable improvement over a benchmark orthogonal frequency division multiplexing (OFDM) technique. The proposed scheme thereby has potential applicability in MIMO communication applications, particularly for a TDMA system with frequency selective channels