Modulation-mode assignment for SVD-assisted and iteratively detected downlink multiuser MIMO transmission schemes

In this contribution we jointly optimize the number of multiple-input multiple-output (MIMO) layers and the number of bits per symbol within an iteratively-detected multiuser MIMO downlink (DL) transmission scheme under the constraint of a given fixed data throughput and integrity. Instead of treating all the users jointly as in zero-forcing (ZF) multiuser transmission techniques, the investigated singular value decomposition (SVD) assisted DL multiuser MIMO system takes the individual user's channel characteristics into account. In analogy to bit-interleaved coded irregular modulation, we introduce a MIMO-BICM scheme, where different user-specific signal constellations and mapping arrangement were used within a single codeword. Extrinsic information transfer (EXIT) charts are used for analyzing and optimizing the convergence behaviour of the iterative demapping and decoding. Our results show that in order to achieve the best bit-error rate, not necessarily all user-specific MIMO layers have to be activate

Near-Capacity Turbo Coded Soft-decision Aided DAPSK/Star-QAM

Low-complexity non-coherently detected Differential Amplitude and Phase-Shift Keying (DAPSK) schemes constitute an ideal candidate for wireless communications. In this paper, we derive the soft-output probability formulas required for the soft-decision based demodulation of DAPSK, which are then invoked for Turbo Coded (TC) transmissions. Furthermore, the achievable throughput characteristics of the family of M-ary DAPSK schemes are provided. It is shown that the proposed 4-ring based TC assisted 64-ary DAPSK scheme achieves a coding gain of about 4.2 dBs in comparison to the identical-throughput TC assisted 64-ary Differential Phase-Shift Keying (64-DPSK) scheme at a bit error ratio of 10?5

Single-RF spatial modulation requires single-carrier transmission: frequency-domain turbo equalization for dispersive channels

In this paper, we propose a broadband single-carrier (SC) spatial-modulation (SM) based multiple-input multipleoutput (MIMO) architecture relying on a soft-decision (SoD) frequency-domain equalization (FDE) receiver. We demonstrate that conventional orthogonal frequency-division multiplexing (OFDM)-based broadband transmissions are not readily suitable for the single–radio frequency (RF) assisted SM-MIMO schemes, since this scheme does not exhibit any substantial performance advantage over single-antenna transmissions. To circumvent this limitation, a low-complexity soft-decision (SoD) FDE algorithm based on the minimum mean-square error (MMSE) criterion is invoked for our broadband SC-based SM-MIMO scheme, which is capable of operating in a strongly dispersive channel having a long channel impulse response (CIR) at a moderate decoding complexity. Furthermore, our SoD FDE attains a near-capacity performance with the aid of a three-stage concatenated SC-based SM architecture

On the BICM Capacity

Optimal binary labelings, input distributions, and input alphabets are analyzed for the so-called bit-interleaved coded modulation (BICM) capacity, paying special attention to the low signal-to-noise ratio (SNR) regime. For 8-ary pulse amplitude modulation (PAM) and for 0.75 bit/symbol, the folded binary code results in a higher capacity than the binary reflected gray code (BRGC) and the natural binary code (NBC). The 1 dB gap between the additive white Gaussian noise (AWGN) capacity and the BICM capacity with the BRGC can be almost completely removed if the input symbol distribution is properly selected. First-order asymptotics of the BICM capacity for arbitrary input alphabets and distributions, dimensions, mean, variance, and binary labeling are developed. These asymptotics are used to define first-order optimal (FOO) constellations for BICM, i.e. constellations that make BICM achieve the Shannon limit -1.59 \tr{dB}. It is shown that the \Eb/N_0 required for reliable transmission at asymptotically low rates in BICM can be as high as infinity, that for uniform input distributions and 8-PAM there are only 72 classes of binary labelings with a different first-order asymptotic behavior, and that this number is reduced to only 26 for 8-ary phase shift keying (PSK). A general answer to the question of FOO constellations for BICM is also given: using the Hadamard transform, it is found that for uniform input distributions, a constellation for BICM is FOO if and only if it is a linear projection of a hypercube. A constellation based on PAM or quadrature amplitude modulation input alphabets is FOO if and only if they are labeled by the NBC; if the constellation is based on PSK input alphabets instead, it can never be FOO if the input alphabet has more than four points, regardless of the labeling.Comment: Submitted to the IEEE Transactions on Information Theor

Jointly optimised iterative source-coding, channel-coding and modulation for transmission over wireless channels

Joint source-coding, channel-coding and modulation schemes based on Variable Length Codes (VLCs), Trellis Coded Modulation (TCM), Turbo TCM (TTCM), Bit-Interleaved Coded Modulation (BICM) and iteratively decoded BICM (BICM-ID) schemes are proposed. A significant coding gain is achieved without bandwidth expansion, when exchanging information between the VLC and the coded modulation decoders with the advent of iterative decoding. With the aid of using independent interleavers for the In-phase and Quadrature phase components of the complex-valued constellation, further diversity gain may be achieved. The performance of the proposed schemes is evaluated over both AWGN and Rayleigh fading channels. Explicitly, at BER = 10-5 most of the proposed schemes have BER curves less than one-dB away from the channel capacity limit

Exploiting diversity in wireless channels with bit-interleaved coded modulation and iterative decoding (BICM-ID)

This dissertation studies a state-of-the-art bandwidth-efficient coded modulation technique, known as bit interleaved coded modulation with iterative decoding (BICM-ID), together with various diversity techniques to dramatically improve the performance of digital communication systems over wireless channels. For BICM-ID over a single-antenna frequency non-selective fading channel, the problem of mapping over multiple symbols, i.e., multi-dimensional (multi-D) mapping, with 8-PSK constellation is investigated. An explicit algorithm to construct a good multi-D mapping of 8-PSK to improve the asymptotic performance of BICM-ID systems is introduced. By comparing the performance of the proposed mapping with an unachievable lower bound, it is conjectured that the proposed mapping is the global optimal mapping. The superiority of the proposed mapping over the best conventional (1-dimensional complex) mapping and the multi-D mapping found previously by computer search is thoroughly demonstrated. In addition to the mapping issue in single-antenna BICM-ID systems, the use of signal space diversity (SSD), also known as linear constellation precoding (LCP), is considered in BICM-ID over frequency non-selective fading channels. The performance analysis of BICM-ID and complex N-dimensional signal space diversity is carried out to study its performance limitation, the choice of the rotation matrix and the design of a low-complexity receiver. Based on the design criterion obtained from a tight error bound, the optimality of the rotation matrix is established. It is shown that using the class of optimal rotation matrices, the performance of BICM-ID systems over a frequency non-selective Rayleigh fading channel approaches that of the BICM-ID systems over an additive white Gaussian noise (AWGN) channel when the dimension of the signal constellation increases. Furthermore, by exploiting the sigma mapping for any M-ary quadrature amplitude modulation (QAM) constellation, a very simple sub-optimal, yet effective iterative receiver structure suitable for signal constellations with large dimensions is proposed. Simulation results in various cases and conditions indicate that the proposed receiver can achieve the analytical performance bounds with low complexity. The application of BICM-ID with SSD is then extended to the case of cascaded Rayleigh fading, which is more suitable to model mobile-to-mobile communication channels. By deriving the error bound on the asymptotic performance, it is first illustrated that for a small modulation constellation, a cascaded Rayleigh fading causes a much more severe performance degradation than a conventional Rayleigh fading. However, BICM-ID employing SSD with a sufficiently large constellation can close the performance gap between the Rayleigh and cascaded Rayleigh fading channels, and their performance can closely approach that over an AWGN channel. In the next step, the use of SSD in BICM-ID over frequency selective Rayleigh fading channels employing a multi-carrier modulation technique known as orthogonal frequency division multiplexing (OFDM) is studied. Under the assumption of correlated fading over subcarriers, a tight bound on the asymptotic error performance for the general case of applying SSD over all N subcarriers is derived and used to establish the best achievable asymptotic performance by SSD. It is then shown that precoding over subgroups of at least L subcarriers per group, where L is the number of channel taps, is sufficient to obtain this best asymptotic error performance, while significantly reducing the receiver complexity. The optimal joint subcarrier grouping and rotation matrix design is subsequently determined by solving the Vandermonde linear system. Illustrative examples show a good agreement between various analytical and simulation results. Further, by combining the ideas of multi-D mapping and subcarrier grouping, a novel power and bandwidth-efficient bit-interleaved coded modulation with OFDM and iterative decoding (BI-COFDM-ID) in which multi-D mapping is performed over a group of subcarriers for broadband transmission in a frequency selective fading environment is proposed. A tight bound on the asymptotic error performance is developed, which shows that subcarrier mapping and grouping have independent impacts on the overall error performance, and hence they can be independently optimized. Specifically, it is demonstrated that the optimal subcarrier mapping is similar to the optimal multi-D mapping for BICM-ID in frequency non-selective Rayleigh fading environment, whereas the optimal subcarrier grouping is the same with that of OFDM with SSD. Furthermore, analytical and simulation results show that the proposed system with the combined optimal subcarrier mapping and grouping can achieve the full channel diversity without using SSD and provide significant coding gains as compared to the previously studied BI-COFDM-ID with the same power, bandwidth and receiver complexity. Finally, the investigation is extended to the application of BICM-ID over a multiple-input multiple-output (MIMO) system equipped with multiple antennas at both the transmitter and the receiver to exploit both time and spatial diversities, where neither the transmitter nor the receiver knows the channel fading coefficients. The concentration is on the class of unitary constellation, due to its advantages in terms of both information-theoretic capacity and error probability. The tight error bound with respect to the asymptotic performance is also derived for any given unitary constellation and mapping rule. Design criteria regarding the choice of unitary constellation and mapping are then established. Furthermore, by using the unitary constellation obtained from orthogonal design with quadrature phase-shift keying (QPSK or 4-PSK) and 8-PSK, two different mapping rules are proposed. The first mapping rule gives the most suitable mapping for systems that do not implement iterative processing, which is similar to a Gray mapping in coherent channels. The second mapping rule yields the best mapping for systems with iterative decoding. Analytical and simulation results show that with the proposed mappings of the unitary constellations obtained from orthogonal designs, the asymptotic error performance of the iterative systems can closely approach a lower bound which is applicable to any unitary constellation and mapping

OFDMA/SC-FDMA aided space-time shift keying for dispersive multi-user scenarios

Motivated by the recent concept of Space-Time Shift Keying (STSK) developed for achieving a flexible diversity versus multiplexing gain trade-off, we propose a novel Orthogonal Frequency Division Multiple Access (OFDMA)/Single Carrier Frequency Division Multiple Access (SC-FDMA) aided multi-user STSK scheme for frequency-selective channels. The proposed OFDMA/SC-FDMA STSK scheme is capable of providing an improved performance in dispersive channels, while supporting multiple users in a multiple antenna aided wireless system. Furthermore, the scheme has the inherent potential of benefitting from the low-complexity single-stream Maximum-likelihood (ML) detector. Both an uncoded and a sophisticated near-capacity coded OFDMA/SC-FDMA STSK scheme were studied and their performances were compared in multiuser wideband Multiple-Input Multiple-Output (MIMO) scenarios. Explicitly, OFDMA/SC-FDMA aided STSK exhibits an excellent performance even in the presence of channel impairments due to the frequency-selectivity of wideband channels and proves to be a beneficial choice for high capacity multi-user MIMO systems

Optimization of bit interleaved coded modulation using genetic algorithms

Modern wireless communication systems must be optimized with respect to both bandwidth efficiency and energy efficiency. A common approach to achieve these goals is to use multi-level modulation such as quadrature-amplitude modulation (QAM) for bandwidth efficiency and an error-control code for energy efficiency. In benign additive white Gaussian noise (AWGN) channels, Ungerboeck proposed trellis-coded modulation (TCM), which combines modulation and coding into a joint operation. However, in fading channels, it is important to maximize diversity. As shown by Zehavi, diversity is maximized by performing coding and modulation separately and interleaving bits that are passed from the encoder to the modulator. Such systems are termed BICM for bit-interleaved coded modulation. Later, Li and Ritcey proposed a method for improving the performance of BICM systems by iteratively passing information between the demodulator and decoder. Such systems are termed BICM-ID , for BICM with Iterative Decoding. The bit error rate (BER) curve of a typical BICM-ID system is characterized by a steeply sloping waterfall region followed by an error floor with a gradual slope.;This thesis is focused on optimizing BICM-ID systems in the error floor region. The problem of minimizing the error bound is formulated as an instance of the Quadratic Assignment Problem (QAP) and solved using a genetic algorithm. First, an optimization is performed by fixing the modulation and varying the bit-to-symbol mapping. This approach provides the lowest possible error floor for a BICM-ID system using standard QAM and phase-shift keying (PSK) modulations. Next, the optimization is performed by varying not only the bit-to-symbol mapping, but also the location of the signal points within the two-dimensional constellation. This provides an error floor that is lower than that achieved with the best QAM and PSK systems, although at the cost of a delayed waterfall region