一种高效的联合编码调制分集——迭代接收方案

本文研究了加入迭代解调译码的比特交织编码调制方案,并通过联合编码调制分集扩展此方案。BICM-ID通过信号空间分集增加分集数,并选择最优旋转角度使性能上进一步取得了明显增益。     

Improved decoding of LDPC coded modulations

A coded modulation belief propagation (CMBP) decoder is proposed for decoding LDPC codes with multilevel modulations. The decoder takes into account statistical dependencies among bits originating in the same symbol, providing better performance than the marginal BP (MBP) decoder. Asymptotically it converges to MAP decoding. The CMBP decoder is based on a single-level coding (SLC) scheme and does not suffer from practical disadvantages of multi-level coding (MLC) schemes. Furthermore, the CMBP decoder can close the capacity gap of the bit interleaved coded modulation (BICM) SLC scheme. The BICM capacity gap increases when the modulation size increases and in scenarios where gray mapping is not possible.     

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.     

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

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

Bandwidth‐efficient turbo coding over Rayleigh fading channels

Introduced in 1993, turbo codes can achieve high coding gains close to the Shannon limit. In order to design power and bandwidth‐efficient coding schemes, several approaches have been introduced to combine high coding rate turbo codes with multilevel modulations. The coding systems thus obtained have been shown to display near‐capacity performance over additive white Gaussian noise (AWGN) channels. For communications over fading channels requiring large coding gain and high bandwidth efficiency, it is also interesting to study bit error rate (BER) performance of turbo codes combined with high order rectangular QAM modulations. To this end, we investigate, in this paper, error performance of several bandwidth‐efficient schemes designed using the bit‐interleaved coded modulation approach that has proven potentially very attractive when powerful codes, such as turbo codes, are employed. The structure of these coding schemes, termed ‘bit‐interleaved turbo‐coded modulations’ (BITCMs), is presented in a detailed manner and their BER performance is investigated for spectral efficiencies ranging from 2 to 7 bit/s/Hz. Computer simulation results indicate that BITCMs can achieve near‐capacity performance over Rayleigh fading channels, for all spectral efficiencies considered throughout the paper. It is also shown that the combination of turbo coding and rectangular QAM modulation with Gray mapping constitutes inherently a very powerful association, since coding and modulation functions are both optimized for operation in the same signal‐to‐noise ratio region. This means that no BER improvement is obtainable by employing any other signal constellation in place of the rectangular ones. Finally, the actual influence of the interleaving and mapping functions on error performance of BITCM schemes is discussed. Copyright © 2002 John Wiley & Sons, Ltd.     

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

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

SCLDGM coded modulation for MIMO systems with spatial multiplexing and space‐time block codes

We analyze Multiple‐Input Multiple‐Output (MIMO) coded modulation systems where either Bit‐Interleaved Coded Modulation (BICM) with spatial multiplexing or concatenation of channel coding and Space‐Time Block Codes (STBCs) is used at transmission, assuming iterative Turbo‐like decoding at reception. We optimize Serially‐Concatenated Low‐Density Generator Matrix (SCLDGM) codes (a subclass of LDPC codes) for each system configuration, with the goal of assessing its ability to approach the capacity limits in either ergodic or quasi‐static channels. Our focus is on three relevant STBCs: the Orthogonal Space‐Time Block Codes (OSTBCs) for two transmit antennas (i.e., the Alamouti code), which enables optimum detection with low complexity; the Golden code, which provides a capacity increase with respect to the input constellation; and Linear Dispersion (LD) codes, which enable practical detection in asymmetrical antenna configurations (i.e., more transmit than receive antennas) for cases in which optimum detection is infeasible. We conclude that BICM without concatenation with STBCs is in general the best option, except for Alamouti‐coded 2×1 and Golden‐coded 2×2 MIMO systems. Copyright © 2009 John Wiley & Sons, Ltd.     

中短波信道中基于LDPC码的迭代解调译码方案

针对数字调幅广播系统,首次提出了基于迭代解调的低密度奇偶校验(LDPC)编码的比特交织编码调制(BICM)方案.首先研究了LDPC码的映射方式,然后基于复杂度分析,考察了LDPC码、Turbo码及国际标准中码率匹配的删除卷积码(RCPC)方案在中、短波广播信道中的性能.研究结果可为我国调幅波段的数字广播系统提供参考.     

基于LDPC码的BICM系统性能分析和改进

将低密度奇偶校验码(LDPC)与比特交织编码调制(BICM)技术相结合,分别给出了不同码长LDPC码在16QAM调制方式下AWGN信道中的性能,并针对不同星座点对比特保护能力的差异,提出了一种有效的内置交织编码算法,即首先对LDPC编码后的码字进行相应的内置交织变换,然后将LDPC码中的信息位调制到星座点中保护能力强的比特位上,在译码端进行相应的矩阵变换译码,计算机仿真结果表明,新方案在信噪比较低时优于传统的16QAM调制方案。     

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.     

Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes

We design multilevel coding (MLC) and bit-interleaved coded modulation (BICM) schemes based on low-density parity-check (LDPC) codes. The analysis and optimization of the LDPC component codes for the MLC and BICM schemes are complicated because, in general, the equivalent binary-input component channels are not necessarily symmetric. To overcome this obstacle, we deploy two different approaches: one based on independent and identically distributed (i.i.d.) channel adapters and the other based on coset codes. By incorporating i.i.d. channel adapters, we can force the symmetry of each binary-input component channel. By considering coset codes, we extend the concentration theorem based on previous work by Richardson et al. ( see ibid., vol.47, p.599-618, Feb. 2001) and Kavc/spl caron/ic/spl acute/ et al.(see ibid., vol.49, p.1636-52, July 2003) We also discuss the relation between the systems based on the two approaches and show that they indeed have the same expected decoder behavior. Next, we jointly optimize the code rates and degree distribution pairs of the LDPC component codes for the MLC scheme. The optimized irregular LDPC codes at each level of MLC with multistage decoding (MSD) are able to perform well at signal-to-noise ratios (SNR) very close to the capacity of the additive white Gaussian noise (AWGN) channel. We also show that the optimized BICM scheme can approach the parallel independent decoding (PID) capacity as closely as does the MLC/PID scheme. Simulations with very large codeword length verify the accuracy of the analytical results. Finally, we compare the simulated performance of these coded modulation schemes at finite codeword lengths, and consider the results from the perspective of a random coding exponent analysis.     

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.     

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.     

Bit-interleaved space-time coded modulation with iterative decoding

Bit-interleaved space-time coded modulation (BI-STC), which combines serial concatenation of bit-interleaved coded modulation (BICM) with space-time block codes, can effectively exploit the available diversity in space and time under various fading conditions. In this letter, we propose to use iterative decoding to further improve the performance of BI-STC by exploiting the concatenating structure of the codes. The decoding metric is therefore modified to fit for the iterative process, and the derived error bounds suggest that set-partition labeling instead of gray labeling should be used when considering iterative decoding.     

Turbo‐coded APSK modulations design for satellite broadband communications

This paper investigates the design of power and spectrally efficient coded modulations based on amplitude phase shift keying (APSK) modulation with application to satellite broadband communications. APSK represents an attractive modulation format for digital transmission over nonlinear satellite channels due to its power and spectral efficiency combined with its inherent robustness against nonlinear distortion. For these reasons APSK has been very recently introduced in the new standard for satellite Digital Video Broadcasting named DVB‐S2. Assuming an ideal rectangular transmission pulse, for which no nonlinear inter‐symbol interference is present and perfect pre‐compensation of the nonlinearity, we optimize the APSK constellation. In addition to the minimum distance criterion, we introduce a new optimization based on the mutual information; this new method generates an optimum constellation for each spectral efficiency. To achieve power efficiency jointly with low bit error rate (BER) floor we adopt a powerful binary serially concatenated turbo‐code coupled with optimal APSK modulations through bit‐interleaved coded modulation. We derive tight approximations on the maximum‐likelihood decoding error probability, and results are compared with computer simulations. The proposed coded modulation scheme is shown to provide a considerable performance advantage compared to current standards for satellite multimedia and broadcasting systems. Copyright © 2006 John Wiley & Sons, Ltd.     

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.     

The Performance of BICM With a Single Decision Feedback for the AWGN Channel

This paper studies the performance of bit interleaved coded modulation (BICM) with a single decision feedback. The separation of demodulation and decoding in BICM inevitably reduces the channel's capacity. Altering the conventional bit mapping in BICM and allowing a single decision feedback greatly reduces the capacity loss. The extra complexity introduced by the single decision feedback appears well justified for dense constellations.     

Reliability-based coded modulation with low-density parity-check codes

In this letter, we consider the interleaver design in bit-interleaved coded modulation (BICM) with low-density parity-check (LDPC) codes. The design paradigm is to provide more coding protection through iterative decoding to bits that are less protected by modulation (and are thus less reliable at the output of the demodulator). The design is carried out by an ad hoc search algorithm over the column permutations of the parity-check matrix. Our simulations show that the proposed reliability-based coded modulation scheme can improve the error-rate performance of conventional BICM schemes based on regular LDPC codes by a few tenths of a decibel, with no added complexity.     

Performance analysis of coded modulation with generalized selection combining in Rayleigh fading

We consider coded modulation with generalized selection combining (GSC) for bandwidth-efficient-coded modulation over Rayleigh fading channels. Our results show that reception diversity with generalized selection combining can conveniently trade off system complexity versus performance. We provide a number of new results by calculating the cutoff rate, and by deriving analytical upper bounds on symbol-interleaved trellis-coded modulation (TCM) and bit-interleaved-coded modulation (BICM) with GSC. All are verified by simulation. We show that our new bounds on TCM with GSC, which includes maximum ratio combining and selection combining as special cases, are tighter than the previously derived bounds. A new asymptotic analysis on the pairwise error probability, which can be used as a guideline for designing coded modulation over GSC channels, is also given. Finally, we show that BICM with iterative decoding (BICM-ID) can achieve significant coding gain over conventional coded modulation in a multiple-receiving-antenna channel.     

Trellis-coded modulation with bit interleaving and iterativedecoding

This paper considers bit-interleaved coded modulation (BICM) for bandwidth-efficient transmission using software radios. A simple iterative decoding (ID) method with hard-decision feedback is suggested to achieve better performance. The paper shows that convolutional codes with good Hamming-distance property can provide both high diversity order and large free Euclidean distance for BICM-ID. The method offers a common framework for coded modulation over channels with a variety of fading statistics. In addition, BICM-ID allows an efficient combination of punctured convolutional codes and multiphase/level modulation, and therefore provides a simple mechanism for variable-rate transmission