Low-Complexity Iterative Receivers for Multiuser Space-Time Block Coding Systems

by Yang, Yajun

Iterative processing has been shown to be very effective in multiuser space-time block coding (STBC) systems. The complexity and efficiency of an iterative receiver depend heavily on how the log-likelihood ratios (LLRs) of the coded bits are computed and exchanged at the receiver among its three major components, namely the multiuser detector, the maximum a posterior probability (MAP) demodulators and the MAP channel decoders. This thesis first presents a method to quantitatively measure the system complexities with floating-point operations (FLOPS) and a technique to evaluate the iterative receiver's convergence property based on mutual information and extrinsic information transfer (EXIT) charts.

Then, an integrated iterative receiver is developed by applying the sigma mappings for M-ary quadrature amplitude modulation (M-QAM) constellations. Due to the linear relationship between the coded bits and the transmitted channel symbol, the multiuser detector can work on the bit-level and hence improves the convergence property of the iterative receiver. It is shown that the integrated iterative receiver is an attractive candidate to replace the conventional receiver when a few receive antennas and a high-order M-QAM constellation are employed.

Finally, a more general two-loop iterative receiver is proposed by introducing an inner iteration loop between the MAP demodulators and the MAP convolutional decoders besides the outer iteration loop that involves the multiuser detection (MUD) as in the conventional iterative receiver. The proposed two-loop iterative receiver greatly improves the iteration efficiency. It is demonstrated that the proposed two-loop iterative receiver can achieve the same asymptotic performance as that of the conventional iterative receiver, but with much less outer-loop iterations.