Signal mapping designs for bit-interleaved coded modulation with iterative decoding (BICM-ID)

Bit-interleaved coded modulation with iterative decoding (BICM-ID)is a spectral efficient coded modulation technique to improve the performance of digital communication systems. It has been widely known that for fixed signal constellation, interleaver and error control code, signal mapping plays an important role in determining the error performance of a BICM-ID system. This thesis concentrates on signal mapping designs for BICM-ID systems. To this end, the distance criteria to find the best mapping in terms of the asymptotic performance are first analytically derived for different channel models. Such criteria are then used to find good mappings for various two-dimensional 8-ary constellations. The usefulness of the proposed mappings of 8-ary constellations is verified by both the error floor bound and simulation results. Moreover, new mappings are also proposed for BICM-ID systems employing the quadrature phase shift keying (QPSK) constellation. The new mappings are obtained by considering many QPSK symbols over a multiple symbol interval, which essentially creates hypercube constellations. Analytical and simulation results show that the use of the proposed mappings together with very simple convolutional codes can offer significant coding gains over the conventional BICM-ID systems for all the channel models considered. Such coding gains are achieved without any bandwidth nor power expansion and with a very small increase in the system complexity

Power allocation and signal labelling on physical layer security

PhD ThesisSecure communications between legitimate users have received considerable attention recently. Transmission cryptography, which introduces secrecy on the network layer, is heavily relied on conventionally to secure communications. However, it is theoretically possible to break the encryption if unlimited computational resource is provided. As a result, physical layer security becomes a hot topic as it provides perfect secrecy from an information theory perspective. The study of physical layer security on real communication system model is challenging and important, as the previous researches are mainly focusing on the Gaussian input model which is not practically implementable. In this thesis, the physical layer security of wireless networks employing finite-alphabet input schemes are studied. In particular, firstly, the secrecy capacity of the single-input single-output (SISO) wiretap channel model with coded modulation (CM) and bit-interleaved coded modulation (BICM) is derived in closed-form, while a fast, sub-optimal power control policy (PCP) is presented to maximize the secrecy capacity performance. Since finite-alphabet input schemes achieve maximum secrecy capacity at medium SNR range, the maximum amount of energy that the destination can harvest from the transmission while satisfying the secrecy rate constraint is computed. Secondly, the effects of mapping techniques on secrecy capacity of BICM scheme are investigated, the secrecy capacity performances of various known mappings are compared on 8PSK, 16QAM and (1,5,10) constellations, showing that Gray mapping obtains lowest secrecy capacity value at high SNRs. We propose a new mapping algorithm, called maximum error event (MEE), to optimize the secrecy capacity over a wide range of SNRs. At low SNR, MEE mapping achieves a lower secrecy rate than other well-known mappings, but at medium-to-high SNRs MEE mapping achieves a significantly higher secrecy rate over a wide range of SNRs. Finally, the secrecy capacity and power allocation algorithm (PA) of finite-alphabet input wiretap channels with decode-and-forward (DF) relays are proposed, the simulation results are compared with the equal power allocation algorithm

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

Coded modulation techniques with bit interleaving and iterative processing for impulsive noise channels

Power line communications (PLC) surfers performance degradation due mainly to impulsive noise interference generated by electrical appliances. This thesis studies coded modulation techniques to improve the spectral efficiency and error performance of PLC. Considered in the first part is the application of bit-interleaved coded modulation with iterative decoding (BICM-ID) in class-A impulsive noise environment. In particular, the optimal soft-output demodulator and its suboptimal version are presented for an additive class-A noise (AWAN) channel so that iterative demodulation and decoding can be performed at the receiver. The effect of signal mapping on the error performance of BICM-ID systems in impulsive noise is then investigated, with both computer simulations and a tight error bound on the asymptotic performance. Extrinsic information transfer (EXIT) chart analysis is performed to illustrate the convergence properties of different mappings. The superior performance of BICMID compared to orthogonal frequency-division multiplexing (OFDM) is also clearly demonstrated.Motivated by the successes of both BICM-ID and OFDM in improving the error performance of communications systems in impulsive noise environment, the second part of this thesis introduces a novel scheme of bit-interleaved coded OFDM with iterative decoding (BI-COFDM-ID) over the class-A impulsive noise channel. Here, an iterative receiver composed of outer and inner iteration loops is first described in detail. Error performance improvements of the proposed iterative receiver with different iteration strategies are presented and discussed. Performance comparisons of BI-COFDM-ID, BICM-ID and iteratively decoded OFDM are made to illustrate the superiority of BI-COFDM-ID. The effect of signal mapping on the error performance of BI-COFDM-ID is also studied

EXIT chart analysis of iteratively detected and SVD-assisted broadband MIMO-BICM schemes

In this contribution the number of activated MIMO layers and the number of bits per symbol are jointly optimized under the constraint of a given fixed data throughput and integrity. In general, non-frequency selective MIMO links have attracted a lot of research and have reached a state of maturity. By contrast, frequency selective MIMO links require substantial further research, where spatio-temporal vector coding (STVC) introduced by Raleigh seems to be an appropriate candidate for broadband transmission channels. In analogy to bit-interleaved coded irregular modulation, a broadband MIMO-BICM scheme is introduced, where different signal constellations and mappings are 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 MIMO layers have to be activated

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