Distribution of max-log metrics for QAM-based BICM in fading channels

In this letter we derive closed-form expressions for the probability density functions (PDFs) of the bits' reliability metrics (L-values) in bit-interleaved coded modulation (BICM) transmission over fully-interleaved fading channels. The expressions are valid for the relevant case of quadrature amplitude modulation (QAM) with Gray mapping when the metrics are calculated via the so-called max-log approximation. Using the developed expressions, the performance of coded BICM transmissions is efficiently evaluated, i.e., without resorting to otherwise required two-dimensional numerical integration. The BICM capacity for different fading channels and constellation sizes is also evaluated.     

A novel bit mapping scheme for high-order polar coded modulation systems

In order to improve the spectrum efficiency of the high-order polar coded modulation systems, the polar code is used as the component code of the bit-interleave coded modulation (BICM) system, a novel bit mapping scheme is proposed considering of the channel polarization and successive cancellation (SC) decoding principle of polar codes as well as the unequal protection of equivalent channels by modulator. In this scheme, the frozen bits on the unreliable split channel are allocated to the equivalent channel with the low protection of the modulator, while the equivalent channels with the high protection are used to transmit the information bits. Thus, the error-correcting performance of polar codes is improved. Compared with some bit mapping schemes, the proposed bit mapping scheme only needs to divide and choose the parameters of the split channels reliability measurement, the complexity does not increase obviously, and simulation results show that the proposed scheme has the better performance under the quadrature amplitude modulation (QAM) modulation based on the Gray mapping.     

比特交织编码调制技术分析

为了在不降低频带利用率和功率利用率的情况下以设备的复杂化来换取编码增益,提出了一种将编码和调制方式结合在一起的比特交织编码调制(Bit Interleaved Coded Modulation,BICM)技术。该技术针对网格编码调制(TrellisCoded Modulation,TCM)灵活性差和衰落信道中性能差的缺点,在理想交织时将编码器和调制器分离设计,具有高度的灵活性,并可以得到近似网格编码调制的性能,并且对衰落信道具有很好的鲁棒性。介绍了比特交织编码调制的构成模式、关键技术,包括信道编码、比特交织和调制,给出了BCIM理论分析,并对不同的交织深度、交织方法和高阶调制等进行了性能仿真分析。仿真结果表明比特交织编码调制可以取得良好的误码率性能。     

On the performance of BICM with mapping diversity in hybrid ARQ

Hybrid ARQ with packet combining for high‐order modulations (such as 16‐QAM) may be significantly enhanced if the bits‐to‐symbols mappings are appropriately changed throughout the transmissions. In this paper, we analyze the relationship between such mapping diversity and channel coding. We calculate the capacity of the popular bit‐interleaved‐coded modulation (BICM) to draw qualitative and approximate quantitative conclusions that are valid for strong codes approaching the capacity limits. We conclude that the choice/design of the appropriate mapping depends on the targeted spectral efficiency and we demonstrate that certain forms of mapping diversity may be counterproductive. We also show that iterative demapping may be successfully applied to significantly reduce (by more than 1 dB) the gap between the BICM and coded modulations (CM) capacities. The analysis is illustrated with results obtained when the mapping diversity is combined with practical turbo codes. Copyright © 2007 John Wiley & Sons, Ltd.     

Bit-interleaved coded modulation with iterative decoding

A simple iterative decoding technique using hard-decision feedback is presented for bit-interleaved coded modulation (BICM). With an 8-state, rate-2/3 convolutional code, and 8-PSK modulation, the improvement over the conventional BICM scheme exceeds 1 dB for a fully-interleaved Rayleigh flat-fading channel and exceeds 1.5 dB for a channel with additive white Gaussian noise. This robust performance makes BICM with iterative decoding suitable for both types of channels     

Adaptive Transmission with Variable-Rate Turbo Bit-Interleaved Coded Modulation

We study an adaptive transmission scheme based on variable-rate turbo bit-interleaved coded modulation (VR- Turbo-BICM). The proposed coding scheme employs punctured turbo codes. A continuously varying transmission rate can be obtained by changing the code rate through both puncturing of the coded bits and adapting of the modulation constellation size. The main results are elaborated in two parts. First, we derive a closed-form expression for a set of achievable rate bounds (called rate thresholds) for VR-Turbo-BICM by employing recent results on the parallel channel performance of turbo code ensembles and the BICM parallel channel analysis model. The derived rate threshold is expressed as a fraction of the capacity of BICM with Gray mapping, where this fraction is a turbo code weight spectrum parameter. Simulation results illustrate that introduced rate thresholds predict well the rate versus SNR performance of VR-Turbo-BICM for a wide range of codeword error probabilities and codeword lengths. Next, based on a simplified rate threshold, we derive a power, puncturing rate, and modulation constellation size assignment policy for a slow fading channel.     

Coded modulation for a coherent DS-CDMA system employing an MMSE receiver in a fading channel

Previous results have shown that high rate codes tend to yield a lower average bit-error rate than low rate codes when employing a minimum mean-square error (MMSE) receiver for a direct-sequence code-division multiple-access (CDMA) system in either an additive white Gaussian noise channel or a flat Rayleigh fading channel. we consider the use of larger signal constellations with both trellis-coded modulation and bit-interleaved coded modulation (BICM) to determine if further gains can be achieved in either the Rayleigh or Ricean fading channel. The average bit-error probability is derived for both coding schemes using the general Ricean fading channel model, based upon the common assumptions of infinite interleaving, perfect channel state information, and optimal MMSE receiver coefficients. New bounds are presented for BICM with 8-PSK and 16-QAM symbols, which take advantage of the symmetries inherent in the signal constellations with Gray code mapping. In addition, simulation results are presented which show the important effect a finite interleaving delay constraint has on the comparison of various codes. The results show that there are cases when coded modulation does yield a significant improvement in performance for a CDMA system using an MMSE receiver, compared to standard convolutional coding. However, the best coding strategy depends upon several factors, including the nature of the fading process (Rayleigh or Ricean), the operating signal-to-noise ratio, the interleaving delay constraint, the time-variability of the channel, the number of users in the system, and the severity of the near-far problem.     

Adaptive bit-interleaved coded modulation

Adaptive coded modulation is a powerful method for achieving a high spectral efficiency over fading channels. Previously proposed adaptive schemes have employed set-partitioned trellis-coded modulation (TCM) and have adapted the number of uncoded bits on a given symbol based on the corresponding channel estimate. However, these adaptive TCM schemes do not perform well in systems where channel estimates are unreliable, since uncoded bits are not protected from unexpected finding. In this paper, adaptive bit-interleaved coded modulation (BICM) is introduced. Adaptive BICM schemes remove the need for parallel branches in the trellis-even when adapting the constellation size, thus making these schemes robust to errors made in the estimation of the current channel fading value. This motivates the design of adaptive BICM schemes, which will lead to adaptive systems that can support users with higher mobility than those considered in previous work. In such systems, numerical results demonstrate that the proposed schemes achieve a moderate bandwidth efficiency gain over previously proposed adaptive schemes and conventional (nonadaptive) schemes of similar complexity     

Channel capacity of bit-interleaved coded modulation schemes using8-ary signal constellations

The object of the work described was to determine the 8-ary signal sets that maximise the coding gains achieved by power-efficient bit-interleaved coded modulation (BICM) schemes over an additive white Gaussian noise channel. To this end, the channel capacity limit of BICM for several 8-ary constellations has been evaluated. It is shown that the most suitable constellation for designing a BICM scheme depends on the desired spectral efficiency of the system     

Iterative demodulation and decoding of turbo-coded M-ary noncoherent orthogonal modulation

This paper considers bit-interleaved coded modulation (BICM) with a turbo channel code and M-ary orthogonal modulation. The BICM signal is iteratively demodulated and decoded in a noncoherent fashion. A soft demodulator suitable for noncoherent orthogonal modulation is presented, and the convergence of the iterative receiver is analyzed through extrinsic information transfer charts. The demodulator can work either with or without fading amplitude estimates. Extensive simulation results are presented for the well-known cdma-2000 turbo code, and the results are compared with the corresponding channel capacities, which are computed using a Monte Carlo technique. The results indicate gains of up to 1 dB relative to noniterative BICM can be achieved with the iterative receiver.     

Multilevel LDPC codes design for semi-BICM

In this letter, we joined the multilevel coding (MLC) and bit-interleaved coded modulation (BICM) together by using Gray mapping, which is called semi-BICM. To perform well at signal-to-noise ratio (SNR) close to the capacity of the additive white Gaussian noise (AWGN) channel, regular low density parity check (LDPC) codes are discussed with parallel independent decoding (PID). The numerical results show that the proposed structure could achieve both power and bandwidth efficiency.     

“Turbo DPSK”: iterative differential PSK demodulationand channel decoding

Multiple symbol differential detection is known to fill the gap between conventional differential detection of MPSK (M-DPSK) and coherent detection of M-PSK with differential encoding (M-DEPSK). Emphasis has been so far on soft-input/hard-output detectors applied in uncoded systems. In this paper, we investigate a receiver structure suitable for coded DPSK signals on static and time-varying channels. The kernel is an a posteriori probability (APP) DPSK demodulator. This demodulator accepts a priori information and produces reliability outputs. Due to the availability of reliability outputs, an outer soft-decision channel decoder can be applied. Due to the acceptance of a priori information, if the outer channel decoder also outputs reliability information, iterative (“turbo”) processing can be done. The proposed “APP DPSK demodulator” uses linear prediction and per-survivor processing to estimate the channel response. The overall transmission scheme represents a type of serial “turbo code,” with a differential encoder concatenated with a convolutional code, separated by interleaving. The investigated system has the potential to improve the performance of coherent PSK without differential encoding and perfect channel estimation for fading cases! Only a small number of iterations are required. The receiver under investigation can be applied to several existing standards without changing the transmission format. Results are presented for uncoded and convolutionally coded 4-DPSK modulation transmitted over the Gaussian channel and the Rayleigh flat-fading channel, respectively     

BICM在差分跳频系统中的应用

将比特交织编码调制(BICM)技术应用于差分跳频(DFH)通信系统,在加性白高斯噪声(AwGN)信道及频率非选择性瑞利慢衰落信道下,对采用无迭代译码及迭代译码的系统比特误码率(BER)上界进行了理论推导及数值仿真验证,并与传统的差分跳频系统的性能进行了比较.其数值仿真结果表明:采用BICM技术的差分跳频系统,可以在不增加跳频带宽及译码复杂度的情况下,利用最优卷积码增大了其G函数网格图的最小自由距离.同时对于可用频率数为16的无迭代译码BICM/DFH,当BER为10-1时,在瑞利信道下相对于CHESS系统而言,其性能改善可达6dB.若采用迭代译码,则当BER为10-1时,其性能相对于无迭代译码可进一步改善3,dB.     

Benchmarking Iterative Receivers for BICM Multi-Carrier Systems Against Capacity Bounds

In this paper, we analyze iterative receivers for bit-interleaved coded modulation (BICM) multi-carrier systems and compare them against theoretical capacity bounds for the channel, coded modulation, and BICM. We map the theoretical capacity bounds into bit-error rate (BER) versus average signal-to-noise ratio per bit plots to simplify the comparison between the theoretical capacity bounds and simulated BER curves. As BER simulations show, iterative receivers with code doping or spreading reach the turbo-cliff within 1 or 0.3dB of the independent Rayleigh fading channel capacity. While the iterative receiver with spreading is closer to the channel capacity than the one with code doping, the later one can eliminate the residual bit-errors after the turbo-cliff. We further present a combinatorial analysis of the distribution of the spread symbol constellation for Walsh-Hadamard spreading codes used in a BICM multi-carrier system to explain the above results.     

A coding and Modulation scheme for HDTV services in DMB-T

In this paper a channel coding and modulation scheme for providing HDTV broadcasting services is presented, which adopts BICM structure as inner code in connection with 64QAM constellation and OFDM transmission. A new mapping method is designed to maximize the minimum Euclidean distance between signal points divided by feedback bits, thus an iterative algorithm between demodulator and decoder can be performed to acquire performance improvement. Analysis, simulation and laboratory test results have proved that the proposed system has good SNR performance in both AWGN and multipath channels.     

改进交织的单层极化码高阶编码调制系统

极化码作为一种新型编码方式,被采纳为5G通信中的短码方案。本文将极化码应用到比特交织编码调制（Bit-Interleaved Coded Modulation,BICM）系统,优化交织器的设计,提出了一种新型交织算法。相比于现有的交织算法,新型交织算法的提出是基于比特信道可靠性衡量参数,将高可靠性的比特信道与低可靠性的比特信道交错设计,按照高可靠性信道对低可靠性信道辅助译码的方式,提高极化码的纠错性能。由于新型交织算法只存在于比特信道可靠度参数的简单排序,在复杂度上没有明显增加。仿真结果表明:新型交织算法具有优异的性能,当误码率为10-5,码长为256时,采用新型交织算法的极化码BICM系统与LDPC码的BICM系统相比大约有1.51 dB的增益。      

Concatenated Trellis Coded Modulation for Quasi-Static Fading Channels

In this paper, we present a novel concatenated trellis coded modulation (CTCM) scheme for limited diversity order fading channels. Examples for such channels include those encountered in indoor wireless networks like IEEE 802.11. It is first shown that when the diversity order afforded by the channel is fixed, bit interleaved coded modulation (BICM) is no longer the best way to encode. We then develop CTCM, which is superior to both BICM and conventional TCM of similar complexities. Unlike conventional TCM where convolutional codes are designed over modulated signal sets, CTCM has TCM concatenated to short length inner codes. Each trellis branch in the TCM now corresponds to a short block-code. We discuss design of good inner codes that allow for simple decoders. CTCM design incorporates useful features of both BICM and conventional TCM. Code design is explained with examples. Simulation results and information theoretic supporting the arguments are shown.     

Multidimensional Subcarrier Mapping for Bit-Interleaved Coded OFDM With Iterative Decoding

A power and bandwidth-efficient bit-interleaved coded modulation (BICM) with orthogonal frequency-division multiplexing (OFDM) and iterative decoding (BI-COFDM-ID) using combined multidimensional mapping and subcarrier grouping is proposed for broadband transmission in a frequency-selective fading environment. 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 multidimensional mapping for bit-interleaved coded modulation with iterative decoding (BICM-ID) in frequency-flat Rayleigh fading environment, whereas the optimal subcarrier grouping is the same with that of OFDM with linear constellation preceding (LCP). 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 LCP and provide significant coding gains as compared to the previously studied BI-COFDM-ID with the same power, bandwidth, and receiver complexity.     

基于LDPC的BICM系统星座映射方式分析

星座映射方式在BICM系统的设计中非常重要。将外信息传递函数(Extrinsic Information Transfer Function)曲线用于星座映射的设计,用Monte Carlo仿真给出了16QAM星座的几种星座映射方式的外信息传递函数曲线,结合EXIT曲线分析了星座映射方式对系统性能的影响。仿真结果证实了EXIT曲线在星座映射设计中的有效性。     

适用于BICM-ID系统的星座成形方法

结合几何成形与概率成形的思想,提出了一种适用于比特交织编码调制系统的星座成形映射方法。该方法基于实用信号星座,通过不使用部分能量较大的信号点并利用多对一的映射关系,使发送信号逼近最佳输入概率分布。利用解调器和译码器之间的迭代译码,该方法可方便地获得成形增益。基于容量和外信息转移图分析,给出了信号星座和信号到符号映射的优化方法。理论分析和仿真结果表明,在高斯白噪声信道和独立Rayleigh衰落信道下,该映射方法利用大信号星座在采用迭代译码的比特交织编码调制系统中均能取得优于传统Gray映射的误码性能,且随着调制阶数的增大可进一步提高成形增益。