Improving BER performance with a BICM system of 3D-turbo code and rotated mapping QAM

Experimental measurements have shown that the noise in many communication channels is non-Gaussian. Bit interleaved coded modulation (BICM) is very popular for spectrally efficient transmission. Recent results have shown that the performance of BICM using convolutional codes in non-fading channels can be significantly improved if the coded bits are not interleaved at all. This particular BICM design is called BICM trivial (BICM-T). In this paper, we analyze the performance of a generalized BICM-T design for communication over Gaussian mixture noise (GMN) channels. The results disclose that for an optimal bit error rate (BER) performance, the use of an interleaver in BICM for GMN channels depends upon the strength of the impulsive noise components in the Gaussian mixture. The results presented for 16-QAM show that the BICM-T can result in gains up to 1.5 dB for a target BER of 10 -6 if the impulsive noise in the Gaussian mixture is below a certain threshold level. The simulation results verify the tightness of developed union bound (UB) on BER performance.

A new method for adjusting positions of signal points of a traditional signal constellation used in the BICM-ID (Bit-Interleaved Coded Modulation with Iterative Decoding) system is proposed. Optimal rotation angle versus SNRs (Signal-to-Noise Power ratios) in the sense of providing the system with attainable lowest BER (Bit Error Rate) are reported.

The paper outlines an efficient approach to evaluating the performance of bit interleaved coded modulation (BICM) systems. Most existing approaches evaluate the probability of individual pairwise error events and obtain a union bound to the bit error probability. This gives very tight bounds on performance for SNRs above the BPSK modulation cutoff rate. However, for higher order modulation systems, the number of bit errors in a symbol slot depends on the two modulated symbols involved in an error event and the linearity of the code cannot be extended to include the modulator. The performance is usually approximated by a few dominant error events which are applicable to AWGN channels. Some approaches consider infinite depth interleaving to obtain a simplified linear model. We study the evaluation and convergence of union bounds for fading channels with finite code block sizes. We develop a general approach which assumes an ideal model for the modulator and enables us to extend the linearity of the considered codes to simplify the computation. This enables us to analyze the performance of concatenated codes with an interleaver of finite length. The approach also gives greater insight into the influence of modulator parameters and the block length of the code on the diversity achieved in BICM systems. The application of our analytical model is demonstrated with examples and simulations.

Probabilistic shaping for bit-interleaved coded modulation (BICM) systems at low signal-to-noise ratio (SNR) is investigated. Using known results for BICM systems with a uniform input distribution, the combinations of input alphabet, input distribution, and binary labeling that achieve the Shannon limit -1.59 dB are fully characterized. It is found that a BICM system achieves the Shannon limit at low SNR if and only if it can be represented as a zero-mean linear projection of a hypercube, which is the same condition as for uniform input distributions. Hence, probabilistic shaping offers no extra degrees of freedom to optimize the low-SNR regime of BICM systems, in addition to what is provided by geometrical shaping.

The generalized mutual information (GMI) of bit-interleaved coded modulation (BICM) systems, sometimes called the BICM capacity, is investigated at low signal-to-noise ratio (SNR). The combinations of input alphabet, input distribution, and binary labeling that achieve the Shannon limit <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">${- 1.59}\;{\rm dB}$</tex></formula> are completely characterized. The main conclusion is that a BICM system with probabilistic shaping achieves the Shannon limit at low SNR if and only if it can be represented as a zero-mean linear projection of a hypercube. Hence, probabilistic shaping offers no extra degrees of freedom to optimize the low-SNR BICM-GMI, in addition to what is provided by geometrical shaping. The analytical conclusions are confirmed by numerical results, which also show that for a fixed input alphabet, probabilistic shaping can improve the BICM-GMI in the low and medium SNR range.

SUMMARY This paper presents an improved version of multistage threshold decoding with a difference register (MTD-DR) for selforthogonal convolutional codes (SOCCs). An approximate lower bound on the bit error rate (BER) with the maximum likelihood (ML) decoding is also given. MTD-DR is shown to achieve an approximate lower bound of ML decoding performance at the higher Eb/N0. The code with larger minimum Hamming distance reduces the BER in error floor, but the BER in waterfall shifts to the higher Eb/N0. This paper gives a decoding scheme that improves the BER in both directions, waterfall and error floor. In the waterfall region, a 2-step decoding (2SD) improves the coding gain of 0.40 dB for shorter codes (code length 4200) and of 0.55 dB for longer codes (code length 80000) compared to the conventional MTD-DR. The 2-step decoding that serially concatenates the parity check (PC) decoding improves the BER in the error floor region. This paper gives an effective use of PC decoding, that further makes the BER 1/8 times compared to the ordinary use of PC decoding in the error floor region. Therefore, the 2SD with effective use of parity check decoding improves the BER in the waterfall and the error floor regions simultaneously.

In this paper, we analytically derive the bit error rate (BER) for bit-interleaved coded modulation (BICM) under the assumption of a temporally correlated flat Rayleigh fading channel. We assume the channel state information (CSI) to be unknown at receiver side and consider a linear minimum mean-squared error (LMMSE) channel estimator that relies on periodically inserted pilot symbols. We give asymptotic results for both non-iterative BICM and BICM with iterative decoding (BICM-ID). Furthermore, we show that the interpretation of the channel estimation error as an SNR degradation holds true in these cases.

Bit-interleaved coded modulation (BICM) transceivers often use equally spaced constellations and a random interleaver. In this paper, we propose a new BICM design, which considers hierarchical (nonequally spaced) constellations, a bit-level multiplexer, and multiple interleavers. It is shown that this new scheme increases the degrees of freedom that can be exploited in order to improve its performance. Analytical bounds on the bit error rate (BER) of the system in terms of the constellation parameters and the multiplexing rules are developed for the additive white Gaussian Noise (AWGN) and Nakagami-m fading channels. These bounds are then used to design the BICM transceiver. Numerical results show that, compared to conventional BICM designs, and for a target BER of 10^{-6}, gains up to 3 dB in the AWGN channel are obtained. For fading channels, the gains depend on the fading parameter, and reach 2 dB for a target BER of 10^{-7} and m=5.

In this paper, we evaluate the bit error rate (BER) of bit-interleaved coded modulation (BICM) receivers that operate with a priori information obtained from the decoder during the so-called turbo iterations. We use Bonferroni-type lower and upper bounds to tightly estimate the BER performance in the range of signal-to-noise ratio (SNR) of interest. The results are shown to be useful for the convergence analysis of the iterative demapping via the so-called extrinsic information transfer (EXIT) charts and for the evaluation of the coded performance of BICM with iterative demapping (BICM-ID).

Cooperative transmission is an efficient way to combat fading for wireless communication. In this paper, a bandwidth-efficient multi-user cooperation scheme is proposed, that is based on TPC(Turbo Product Codes)-BICM(Bit-Interleaved Coded Modulation). In the multi-user cooperation, we use distributed transmission to achieve diversity gain. The bit error rate(BER) performance is discussed and BER upper bound is deduced. Modulation order M, component codes and cooperation level α <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i</sub> are the main parameters that influence system performance. Assumed that the first two parameters are fixed, we discussed the optimal α <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i</sub> value on principle of minimum BER. An optimal transmission rule is presented. When all the uplink channels are same, uniformity distribution is optimal. Simulation results in slow fading show that the BER performance curve approach the upper bound at high SNR. In a general way, the optimal transmission outperforms uniformly transmission.

In this paper, we propose a weighting factor (WF) estimation method for peak power reduction (PPR) based on adaptive flipping of parity carriers in a turbo-coded orthogonal frequency-division multiplexing (OFDM) system. In this PPR scheme, the peak-to-average power ratio of a turbo-coded OFDM signal is reduced with adaptive flipping of the phase of the parity carriers corresponding to the WFs. At the receiver, the WFs are estimated at a turbo decoder by exploiting the redundancy of an error-correcting code using no extra side information. The proposed WF estimation method is based on an iterative decoding of the turbo code, i.e., the turbo decoder provides not only error correction capability but the WF estimation function as well. When the proposed WF estimation method is used for the system using a turbo code with constraint length <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> = 4 and a code rate of <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R</i> = 1/2, the instantaneous power of the OFDM signal at the complementary cumulative distribution function of 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-4</sup> can be reduced by about 2.1 dB through the application of the PPR scheme. When the bit error rate (BER) performance is evaluated as a function of the peak signal-to-noise power ratio (PSNR), the proposed method achieves better BER performance than the case without the PPR in an attenuated 12-path Rayleigh fading condition. The improvements in BER performance as a function of PSNR are about 1.1, 2.0, and 2.1 dB at BER = 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-4</sup> for turbo-coded OFDM signals using QPSK, 16-state quadrature amplitude modulation (QAM), and 64-state QAM schemes, respectively.

The combination of multiple-input multiple-output (MIMO) and bit-interleaved coded modulation (BICM)/BICM with iterative demapping (BICM-ID) is one of the key technologies to meet the high-transmission-rate requirement of the next generation broadcasting systems. However, conventional low-density parity check (LDPC) coded MIMO BICM schemes always show poor performance with iterative demapping, and vice versa. In this paper, a subset of spatially coupled codes, finite-length spatially coupled (SC-) quasi-cyclic (QC-) LDPC code, is proposed and the universality of spatially coupled codes is utilized to achieve a good tradeoff between MIMO BICM and BICM-ID schemes. Due to the specific code structure of SC-QC-LDPC, the tool of multi-edge type density evolution (MET-DE) is employed for the performance analysis and code optimization. As an example, a finite-length SC-QC-LDPC code is optimized in binary-input additive white Gaussian noise channel, and then bit error rate simulations are carried out to verify the universality of the designed code in MIMO BICM and BICM-ID schemes.

Bit-Interleaved Coded Modulation using Iterative Decoding (BICM-ID) is amalgamated with Luby Transform (LT) coding. The resultant joint design of the physical and data link layer substantially improves the attainable Bit Error Rate (BER) performance. A Cyclic Redundancy Check (CRC) combined with a novel Log-Likelihood Ratio (LLR) based packet reliability estimation method is proposed for the sake of detecting and disposing of erroneous packets. Subsequently, bit-by-bit LT decoding is proposed, which facilitates a further BER improvement at a lower number of BICM-ID iterations. Finally, we revisit the pseudo random generator function used for designing the LT generator matrix.

This letter presents a novel bit metric generation approach for phase shift keying (PSK) with Gray labeling. This approach generates bit metrics recursively based on a simplified function which can reduce the computational complexity greatly at a very small bit error rate (BER) performance loss. At last, the generalized mutual information (GMI) is used to demonstrate the good performance of this method in bit-interleaved coded modulation (BICM) systems.

Recent results have shown that the performance of bit-interleaved coded modulation (BICM) using convolutional codes in nonfading channels can be greatly improved if the bit-level interleaver takes a trivial form (BICM-T), i.e., if it does not interleave the bits at all. The reported gains reach a few decibels and are obtained using a less complex BICM system. In this paper, we give a formal explanation for these results and show that BICM-T is in fact the combination of a TCM transmitter and a BICM receiver. Analytical bounds that predict the performance of BICM-T are developed and a new type of distance spectrum for the convolutional code is introduced.