带宽有效传输下多进制LDPC码的不等错误保护

针对频谱有效的多进制低密度奇偶校验（Low-Density Parity-Check,LDPC）码编码调制系统,本文提出了一种在带宽有效传输下的两级不等保护方案,两级不等错误保护分别来自码字特性和高阶调制,充分利用了码字变量节点的度和高阶调制中比特的不等可靠性。编码调制系统采用多进制LDPC码与高阶调制匹配结合,无需信息转换,针对不同误符号率和误比特率的需求,可在符号级和比特级提供不同可靠性达到不等错误保护的目的。仿真结果表明,在AWGN信道下,采用16QAM调制方式的性能优于16PSK调制方式,利用变量节点的度和高阶调制提供的信息,码字的误符号率和误比特率具有明显的不等错误保护区分度,对于重要的比特给予了较强的保护。      

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

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

移动通信中用于高阶调制LDPC码译码器的一种低复杂度盲信噪比估计器

在LDPC（Low Density Parity Check,低密度校验）码软迭代译码器中,需要信道信噪比以生成接收比特先验信息.同时,为了提高频谱利用率,传输符号通常采用高阶调制.本文研究的即是如何从高阶调制符号中估计出信噪比以用于LDPC译码器.本文在只适用于BPSK调制的在线信噪比估计器的基础上,推导得到一种适用于8PSK调制的低复杂度盲信噪比估计算法-8PSKM-BSNRE,这种算法的思路还可被扩展应用于其他高阶调制符号.计算机仿真结果证明,8PSKM-BSNRE在应用于LDPC码译码器时具有较好的性能.     

软切换链路下的混合编码与副载波调制方案

为了提高自由空间光/射频（FSO/RF）混合通信链路的性能，采用混合低密度奇偶校验（LDPC）编码与副载波相移键控/正交振幅调制（PSK/QAM）联合调制的方法，对不同传输比例下混合系统的误比特率性能进行了仿真分析，取得了不同信道条件下单链路和混合链路传输方案的误比特率数据。结果表明，在弱中强湍流条件下采用副载波二进制相移键控（BPSK）调制，相比开关键控（OOK）调制可获得大约4.4dB~5.2dB的增益。采用软切换的混合LDPC编码与副载波BPSK/16QAM调制方案，依据链路状态调整比例为1:1和3:1时，不同湍流强度下可获得大约0.3dB~7.4dB的性能增益。这一研究结果对于提高FSO/RF混合通信系统的全天候高效可靠传输性能具有重要的参考价值。     

基于LDPC码的编码调制系统的性能分析

以接近香农限性能的LDPC码作为分量码,研究了将编码和调制相结合的多层编码(MLC)——多级译码(MSD)编码调制技术。选用不同码长的LDPC码为各级分量码,以8PSK为调制方式,通过计算机仿真,比较了不同的集分割方案在AWGN信道中的性能。     

比特交织Turbo编码调制的8PSK符号映射

基于对Turbo编码器输出的系统比特和校验比特的不等错误保护(UEP),提出了一种新的比特交织Turbo编码调制(BITCM)的8PSK符号映射方案,即对于码率为1/3的Turbo码,校验比特映射到8PSK星座点中具有较好传输性能的比特位置上,而系统比特映射到较差传输性能的比特位置上。实现新映射方案的关键是比特交织器的设计。仿真结果表明,新的映射方案在AWGN信道下,误码率为10-3时,可获得大于0.2dB的信噪比增益,而这一增益的获得并没有牺牲频谱效率和增加系统的复杂性。     

结合6-QAM和双层LDPC码的编码调制研究

针对阶数为3×2p的非标准调制与纠错编码难以匹配的问题,提出了一种面向6阶正交幅度调制（QAM）的双层编码调制传输方案。在发送端,采用有限域GF(2)低密度奇偶校验（LDPC）码与GF(3) LDPC码进行分层编码,并将两种编码码字映射为6进制码字后进行6-QAM调制;在接收端,根据GF(2) LDPC码和GF(3) LDPC码的译码顺序,设计了两种双层迭代译码方法。仿真结果表明,在加性高斯白噪声（AWGN）信道下,执行一次整体迭代译码时,先执行GF(3) LDPC码译码的6-QAM分层编码调制方案比先执行GF(2) LDPC码译码的方案获得了更优的误符号率（SER）性能;随着迭代次数增加,纠错性能可获得进一步改善。比较6-QAM与6阶相移键控（6-PSK）调制,若先执行GF(3) LDPC码译码,当SER为10-5时,6-QAM结合双层LDPC码的传输方案在AWGN信道下可获得约1.3dB的增益。      

高阶调制系统下LDPC码优化设计

为了提高编码调制系统的整体编码增益,提出一种高阶调制系统下LDPC码的度分布优化方法.根据高阶调制符号中不同比特的误比特特性,将调制符号所经历信道建模为一组对称二进制输入加性高斯信道.在此基础上,推导了高阶调制系统下LDPC码高斯近似密度进化分析方法,并得到译码收敛条件.结合度分布约束关系及译码收敛条件,提出高阶调制系统下LDPC码的度分布优化问题及差分进化实现方法.仿真结果表明,设计的LDPC码在高阶调制系统中的渐进性能和误码性能优于基于比特优化映射的编码调制方案.     

BICM-ID光通信系统中一种新颖星座映射方案的优化分析

针对传统Gray映射在中高信噪比区域内对迭代译码的比特交织编码调制(BICM-ID)光通信系统改善信道容量性能有限的问题,基于互信息准则和比特的不等保护度提出了一种新颖的16QAM星座映射方案.仿真分析表明:在中高信噪比下,所提出的新映射方案比传统Gray映射方案的信道容量最大改善值可达1.18 bit/channel.结合低密度奇偶校验(LDPC)码并借助外部信息传递(EXIT)图,该方案在光通信系统中具有很好的性能优势与应用前景.     

LDPC-CM-UEP在数字图像水印技术的应用

数字图像水印技术是一种信息隐藏技术。针对信息隐藏对于秘密信息隐匿性和可靠性传输的高要求,采用LDPC编码调制的不等差错保护（LDPC-CM-UEP）方案应用于数字图像水印技术中,将水印信息经过LDPC编码后的码字分为两部分,分别利用两种QAM高效调制方式,使水印信息作为重要比特得到很好的保护。仿真结果表明该方案在保证水印鲁棒性和隐匿性的前提下,提高了系统的频带利用率,从而改善了数字图像水印系统的传输质量。     

非规则LDPC码的不等错误保护性能研究

提出了一种具有不等错误保护性能的非规则低密度校验(LDPC,low-density parity-check)码信道编码方案, 构造了重量递增校验(weight-increasing parity-check)矩阵,系统编码时,重要信息比特映射到LDPC码的“精华”比特上。AWGN和Rayliegh衰落信道的仿真结果表明,与随机构造的非规则LDPC码相比,WICP-LDPC码具有好的UEP性能。     

Near-capacity coding in multicarrier modulation systems

We apply irregular low-density parity-check (LDPC) codes to the design of multilevel coded quadrature amplitude modulation (QAM) schemes for application in discrete multitone systems in frequency-selective channels. A combined Gray/Ungerboeck scheme is used to label each QAM constellation. The Gray-labeled bits are protected using an irregular LDPC code with iterative soft-decision decoding, while other bits are protected using a high-rate Reed-Solomon code with hard-decision decoding (or are left uncoded). The rate of the LDPC code is selected by analyzing the capacity of the channel seen by the Gray-labeled bits and is made adaptive by selective concatenation with an inner repetition code. Using a practical bit-loading algorithm, we apply this coding scheme to an ensemble of frequency-selective channels with Gaussian noise. Over a large number of channel realizations, this coding scheme provides an average effective coding gain of more than 7.5 dB at a bit-error rate of 10/sup -7/ and a block length of approximately 10/sup 5/ b. This represents a gap of approximately 2.3 dB from the Shannon limit of the additive white Gaussian noise channel, which could be closed to within 0.8-1.2 dB using constellation shaping.     

Early detection of successful decoding for dual-diagonal block-based LDPC codes

Low-density parity-check (LDPC) codes [1] have attracted much attention in the last decade owing to their capacityapproaching performance. LDPC codes with a dual-diagonal blockbased structure can be encoded in linear time with lower encoder hardware complexity [2]. This class of LDPC codes is adopted by a number of standards such as wireless LAN (IEEE 802.11n) [3], wireless MAN (IEEE 802.16e, WiMAX) [4] and satellite TV (DVB-S2) [5]. LDPC codes are commonly decoded by the iterative belief-propagation (BP) algorithm. The decoder checks the parity-check equations to detect successful decoding at the end of the iteration. The Tanner graph of an irregular LDPC code consists of nodes with different degrees such that coded bits have unequal error protection [6]. Coded bits associated with higher degree nodes tend to converge to the correct answer more quickly. Hence, in order to give better protection to the transmitted data, data bits are always mapped to higher degree nodes whereas parity bits are mapped to lower degree nodes in the encoding process. The commonly used parity-check equations Hc t ? 0t will be satisfied after all the coded bits are correctly decoded. However, as discussed above, data bits converge to the correct answer much more quickly than parity bits, so some unnecessary iterations are wasted waiting for the parity bits to be decoded. In this Letter, a new set of low-complexity check equations are derived for dual-diagonal block-based LDPC codes. Early detection of successfully decoded data can be achieved by exploiting the structure and degree of distribution of the dual-diagonal parity check matrix. The decoder power, speed and complexity can be improved by adopting these equations. Simulation shows that the coding gain performance is little changed.     

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.     

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.     

Bandwidth-Efficient Modulation Codes Based on Nonbinary Irregular Repeat–Accumulate Codes

Using nonbinary low-density parity-check (LDPC) codes with random-coset mapping, Bennatan and Burshtein constructed bandwidth-efficient modulation codes with remarkable performance under belief propagation (BP) decoding. However, due to the random nature of LDPC codes, most of the good LDPC codes found in the literature do not have a simple encoding structure. Thus, the encoding complexity of those LDPC codes can be as high as O(N ²), where N is the codeword length. To reduce the encoding complexity, in this paper, nonbinary irregular repeat-accumulate (IRA) codes with time-varying characteristic and random-coset mapping are proposed for bandwidth-efficient modulation schemes. The time-varying characteristic and random-coset mapping result in both permutation-invariance and symmetry properties, respectively, in the densities of decoder messages. The permutation-invariance and symmetry properties of the proposed codes enable the approximations of densities of decoder messages using Gaussian distributions. Under the Gaussian approximation, extrinsic information transfer (EXIT) charts for nonbinary IRA codes are developed and several codes of different spectral efficiencies are designed based on EXIT charts. In addition, by proper selection of nonuniform signal constellations, the constructed codes are inherently capable of obtaining shaping gains, even without separate shaping codes. Simulation results indicate that the proposed codes not only have simple encoding schemes, but also have remarkable performance that is even better than that constructed using nonbinary LDPC codes.     

Serially-Concatenated Low-Density Generator Matrix (SCLDGM) Codes for Transmission Over AWGN and Rayleigh Fading Channels

Low density generator matrix (LDGM) codes are a particular class of low density parity check (LDPC) codes with very low encoding complexity. Single LDGM codes present high error-floors, which can be substantially reduced with the serial concatenation of two LDGM (SCLDGM) codes. We propose a technique to obtain good SCLDGM codes using extrinsic information transfer (EXIT) functions in a novel way. Although the optimization is performed for AWGN channels with binary signaling, the resulting codes are also optimal for AWGN and perfectly-interleaved Rayleigh fading channels with non-binary signaling and perfect CSI at reception, provided that Gray mapping is utilized. Optimized regular and irregular SCLDGM codes outperform heuristically-designed LDGM codes existing in the literature, and have a performance similar to or better than that of irregular repeat accumulate (IRA) codes.     

HIGH-PERFORMANCE SIMPLE-ENCODING GENERATOR-BASED SYSTEMATIC IRREGULAR LDPC CODES AND RESULTED PRODUCT CODES

Low-Density Parity-Check (LDPC) code is one of the most exciting topics among the coding theory community.It is of great importance in both theory and practical communications over noisy channels.The most advantage of LDPC codes is their relatively lower decoding complexity compared with turbo codes,while the disadvantage is its higher encoding complexity.In this paper,a new ap- proach is first proposed to construct high performance irregular systematic LDPC codes based on sparse generator matrix,which can significantly reduce the encoding complexity under the same de- coding complexity as that of regular or irregular LDPC codes defined by traditional sparse parity-check matrix.Then,the proposed generator-based systematic irregular LDPC codes are adopted as con- stituent block codes in rows and columns to design a new kind of product codes family,which also can be interpreted as irregular LDPC codes characterized by graph and thus decoded iteratively.Finally, the performance of the generator-based LDPC codes and the resultant product codes is investigated over an Additive White Gaussian Noise (AWGN) and also compared with the conventional LDPC codes under the same conditions of decoding complexity and channel noise.