Low‐complexity soft‐interference cancellation turbo equalisation for multi‐input–multi‐output systems with multilevel modulations

This paper proposes an extrinsic information transfer (EXIT) chart analysis and an asymptotic bit error rate (BER) prediction method to speed up the design of high rate RCM-LDGM hybrid codes over AWGN and fast Rayleigh channels. These codes are based on a parallel concatenation of a rate compatible modulation (RCM) code with a low-density generator matrix (LDGM) code. The decoder uses the iterative sum-product algorithm to exchange information between the variable nodes (VNs) and the two types of constituent check nodes: RCM-CN and LDGM-CN. The novelty of the proposed EXIT chart procedure lies on the fact that it mixes together the analog RCM check nodes with the digital LDGM check nodes, something not possible in previous multi-edge EXIT charts proposed in the literature.

In this paper, we analyze an orthogonal frequency division multiplexing (OFDM) system employing combined space- time-frequency (STF) codes and an iterative receiver with extrinsic information transfer (EXIT) charts and bit-error rate plots. As STF codes, we examine orthogonal space-time block codes (OSTBCs), cyclic delay diversity, and discontinuous Doppler diversity. We present a combined STF code for eight transmit antennas with rate one. Another contribution of this work is the EXIT chart analysis demonstrating that EXIT charts are not always a suitable tool to analyze the performance of iterative receivers for STF coded OFDM systems. Further, error floors due to the mapping can be removed even for correlated channels by differential encoding and code doping the bits before the modulator.

Low Power Wide Area (LPWA) networks aim at connecting low cost devices with high constraints on the link budget. Focusing on the physical layer, the combination of Frequency Shift Keying (FSK) modulation and coding in the same process has been shown efficient when associated to a turbo receiver. This paper considers the optimization of Turbo-FSK parameters for the LPWA context using the EXtrinsic Information Transfer (EXIT) Chart analysis. After adapting the metric to the FSK waveforms, EXIT chart performance results are extended and compared to short packet lengths using extensive Bit Error Rate (BER) computations.

In minimum mean squared error (MMSE) based turbo equalization, the decoder's extrinsic information is used as the MMSE equalizer's prior information. In order to improve the performance, the combined prior information which consists of the whole decoder's extrinsic information and the partial decoder's full information in the last iteration, is used by the MMSE equalizer. Meanwhile, the MMSE equalizer is lead by matched filter as a preprocessor to reduce the complexity. The extrinsic information transfer (EXIT) chart analysis and simulation results show that the performance of the proposed scheme is much better than that of the conventional turbo equalizer.

In this paper we derive a novel extrinsic information transfer (EXIT) function for a channel estimator that uses both pilot symbols and soft decoding information. We consider a CDMA system with forward error correction that employs iterative multiuser detection based on soft interference cancellation and single user decoding. The J function is useful in convergence analysis as it provides a mapping between mutual information and variance. J functions are derived for both the flat-fading Rayleigh channel and channel estimate, allowing the a priori inputs to the channel estimator, interference canceller and decoder to be modeled. Algorithms for obtaining the EXIT functions for the three receiver blocks are proposed. We then combine the EXIT functions to create an EXIT chart that can be used to predict the behaviour of the overall receiver. Simulations are run for a 3GPP-like receiver in a mobile environment with a vehicle speed of 100 km/h. It is found that under these conditions, the detector trajectory closely matches our proposed EXIT chart.

EXtrinsic Information Transfer (EXIT) chart is a graphical tool for analysis of low density parity check (LDPC) and other codes with iterative decoding. In this paper, we propose the design of LDPC codes for coded modulation schemes by application of linear programming with conditions derived from EXIT charts. Points on the EXIT curve for bit and check node operations are first computed either using analysis or by simulation. The entire EXIT curve is then obtained by linear interpolation. Finally, the EXIT curves are optimized to obtain the maximum possible rate for the code under a given threshold condition. To demonstrate the design procedure, we consider the cases of M-PAM and 8-PSK over the additive white Gaussian noise (AWGN) channel. The optimization method presented is versatile, and can be extended to other constellations and situations easily.

In this letter, the concept of multiple serially-concatenated codes is invoked in the context of stochastic resonance (SR), where the achievable performance is improved by increasing noise power. More specifically, the receiver's iterative decoding process is characterized with the aid of extrinsic information transfer (EXIT) charts, such that the SR effect induced by a non-linear component is taken into account. Our simulation results demonstrate that although the SR demodulator's log-likelihood ratio (LLR) outputs are not Gaussian distributed, the corresponding EXIT trajectory matches the prediction from the associated inner- and outer-codes' EXIT curves, while reaching the perfect convergence point in terms of mutual information. Therefore, an infinitesimally low bit-error ratio (BER) is attained by appropriately designing the channel code's parameters based on EXIT charts.

This paper focuses on the signal constellation shaping in LDPC coded modulation system. A novel constellation is presented by combining geometric shaping with probabilistic shaping based on quadrature amplitude modulation (QAM)constellation. With the shaped signal constellation, the signal mapping is optimized by using the extrinsic information transfer (EXIT) chart analysis. We further consider the nonbinary LDPC coded-modulation by combining with the proposed constellation shaping. Numerical results reveal that the proposed constellation can get the shaping gain without increasing the complexity of detection.

A self-iterating soft equalizer (SISE) consisting of a few relatively weak constituent equalizers is shown to provide robust performance even in severe intersymbol interference (ISI) channels that exhibit deep nulls and valleys within the signal band. Constituent equalizers are allowed to exchange soft information in the absence of interleavers based on the method that are designed to handle significant correlation among their soft outputs. The resulting SISE works well as a stand-alone equalizer or as the equalizer component of a turbo equalization system. The performance advantages over existing methods are validated with bit-error-rate (BER) simulations and extrinsic information transfer (EXIT) chart analysis. It is shown that in turbo equalizer setting the SISE achieves performance closer to the maximum a posteriori probability equalizer than any other known schemes in very severe ISI channels.

In this paper, we consider the half-duplex relay channel. We seek to design multiple turbo codes to minimize the information outage in the block fading channel. An analysis on the diversity order of the relay channel, which depends on the time sharing variable and the rate of the code, is given for practical modulations. We also give a code structure for the multiple turbo codes to achieve the full diversity when it is achievable. The codes are optimized using the extrinsic information transfer (EXIT) chart analysis, based on the convergence thresholds of the iterative decoding tailored for relay channel. Numerical examples shows that with our design technique, the achieved frame error rate is within 0.7dB of the information outage. To reduce complexity, a suboptimum code search approach is proposed, resulting codes which perform 1dB away from the information outage.

Bit-interleaved coded modulation with iterative decoding (BICM-ID) is investigated for bandwidth efficient transmissions, where the error performance can be improved by employing a suitable symbol mapping. This paper first introduces a low-complexity regular mapping optimization for BICM-ID and 8PSK, for the purpose of finding the optimal mapping. Furthermore, the irregular mapping optimization is proposed for a closer approach to the channel capacity. The extrinsic information transfer (EXIT) chart analysis is aided for the proposed optimization algorithms to provide design guidelines of mappings. The bit error rate (BER) results demonstrate that the BICM-ID system with the proposed optimal irregular mapping outperforms the other mappings used for comparison, and yields about 0.5dB away from the channel capacity over the additive white Gaussian noise (AWGN) channel.

A novel concept of space-time diversity is developed. It is similar to 2×2 bit-interleaved space-time coded modulation with iterative decoding (BI-STCM-ID), except for labelling maps, which are different for the signals transmitted through particular antenna. In such an approach the so-called waterfall region of BER curves is observed at lower SNRs than for BI-STCM-ID systems. At the same time the proposed ‘boosted’ scheme is characterised by good BER against SNR asymptotic performance, which is proved by the results of Extrinsic Information Transfer (EXIT) Chart analysis, error-free feedback (EF) bounds, and results of the overall system simulation. It is shown that numerous labelling maps can be combined with a Gray one to meet specific requirements.

In previous works, density evolution schemes have been used to design an irregular low-density parity-check (LDPC) code for the multi-input multi-output (MIMO) systems. However the code design based on the density evolution can be used only for simple code structure like LDPC codes and repeat-accumulate (RA) codes. Recently simple and accurate irregular LDPC code design method based on the extrinsic information transfer (EXIT) chart was introduced for an AWGN channel. This code design scheme is much flexible, therefore it can be used for any kind of code structure like turbo codes. In this paper we design an irregular LDPC code for a MIMO system using the EXIT chart based scheme. The EXIT charts are used to obtain the optimal edge degree distribution of the irregular LDPC code combined with the MMSE-SIC MIMO detector. This scheme can be generalized for designing the optimal iterative MIMO detector combined with any kind of channel codes including turbo codes.

This paper presents an Irregular Distributed SpaceTime (Ir-DST) coding scheme designed for near-capacity cooperative communications. A serial concatenated scheme comprising an IRregular Convolutional Code (IRCC), a recursive Unity-Rate Code (URC) and a Space-Time Block Code (STBC) was designed for the sake of approaching the corresponding source-to-relay link capacity, where the IRCC was optimized with the aid of Extrinsic Information Transfer (EXIT) charts which was used at the source node. At the relay node, another IRCC is concatenated serially with an identical STBC. The relay's IRCC is re-optimized based on EXIT chart analysis for the sake of approaching the relay network's capacity, before transmitting the relayed information. We will demonstrate that the topology of the Ir-DST system coincides with that of a Distributed Turbo Code (DTC). At the destination node, a novel three-stage iterative decoding scheme is constructed in order to achieve decoding convergence to an infinitesimally low Bit Error Ratio (BER). Finally, it is shown that our joint source-and-relay mode design based on EXIT chart analysis is capable of near-capacity cooperative communications.

The joint Viterbi detector/decoder (JVDD) has been proposed as an alternative to the powerful and ubiquitous low-density parity check (LDPC) coding schemes, that are used in the majority of channel coding applications today. At shorter block lengths, the JVDD is able to outperform the state-of-the-art LDPC decoder that can be found in many of today’s systems, from deep-space communications to the digital video broadcasting standard, to the advanced television standard committee 3.0. Researchers have developed the tools to analyze the performance of the LDPC decoder, which is known as the sum-product algorithm or message passing algorithm. These tools include density evolution (DE) and extrinsic information transfer (EXIT) charts. To date, no similar such analysis exists for the JVDD. In the current paper we perform a similar preliminary analysis on the JVDD algorithm akin to what DE and EXIT charts are for the LDPC decoder. The current new analysis of the JVDD allows prediction of its probability of error based on the probability distribution functions of the metrics used within the algorithm. Our analysis plays a similar role to the abovementioned tools developed for the LDPC decoder: it allows us to predict the performance of the JVDD under various conditions (such as varying SNR’s, thresholds, and block lengths), it improves our understanding of the JVDD algorithm and the match against Monte-Carlo simulations verifies our assumptions on the main error-causing mechanisms within the JVDD.