浅海水声信道中原模图LDPC码的设计及性能分析

原模图低密度奇偶校验码相较于传统LDPC码,具有结构简单、迭代译码门限低、易于扩展及线性编译码复杂度等优点。针对强多途、长时延、窄带宽的浅海水声信道,该文研究了PG-LDPC码的设计及性能特征,提出一种码型设计方案,并采用基于原模图度分布的外部信息转移图算法,对所设计PG-LDPC码的纠错性能进行分析及预测。仿真与实验结果表明,与(3,6)随机规则LDPC码相比,所提的PG-LDPC码在低、高信噪比区域均有良好的纠错性能。     

GF(2p)LDPC编码的相位调制OFDM系统在瑞利衰落信道的性能

OFDM是一项能有效对抗高速无线通信中多径衰落的关键技术，为了进一步提高OFDM系统的误码性能，许多信道编码技术已被应用于OFDM系统中，二元域LDPC码以其近香农限的误码性能和较低的译码复杂度成为研究的热点。在AWGN信道下，多元域LDPC码比等效码长的二元域LDPC码有更好的纠错性能。本文提出了一种将多元域LDPC码经过MPSK调制后用于OFDM系统的新方法。仿真结果表明，在多径衰落信道下，通过合理选择多元LDPC码域的阶数和调制的方法，多元域LDPC编码的高阶调制OFDM系统比等效码长的二元域LDPC编码OFDM系统具有更好的性能，并且由于采用了多元域LDPC的快速BP译码，译码复杂度只是稍有增加。     

LT码和q-LDPC码级联方案在深空通信中的应用

该文针对深空通信对长纠删码的需求,提出了LT (Luby Transform)码和q-LDPC码的级联方案。在综合考虑性能和复杂度的情况下,选取8-LDPC码和8PSK的级联作为等效的删除信道,长度选择灵活、编译码简单的LT码实现纠删功能。文中设计了两种短8-LDPC码,并对整个级联系统的纠错性能进行了仿真。仿真结果表明8-LDPC码的性能优于信源信息速率和码率相同的二进制LDPC码,级联系统在等效包删除概率不超过0.1时,系统误比特率以概率1趋于0。     

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

低密度校验码(LDPC)由于其编码增益高、译码速度快、性能接近香农限的优点,目前得到学术界的广泛关注.文中简单介绍了LDPC码及其译码算法,在此基础上结合比特交织编码调制(BICM)系统,并在算法上作出了相应改进.仿真结果表明,在高斯信道、充分交织瑞利信道、相关瑞利衰落信道下,此算法正确有效.     

Construction of quasi‐cyclic low‐density parity‐check codes with low encoding complexity

Low encoding complexity is very important for quasi‐cyclic low‐density parity‐check (QC‐LDPC) codes used in wireless communication systems. In this paper, a new scheme is presented to construct QC‐LDPC codes with low encoding complexity. This scheme is called two‐stage particle swarm optimization (TS‐PSO) algorithm, in which both the threshold and girth distribution of QC‐LDPC codes are considered. The proposed scheme is composed of two stages. In the first stage, we construct a binary base matrix of QC‐LDPC code with the best threshold. The matrix is constructed by combining a binary PSO algorithm and the protograph extrinsic information transfer (PEXIT) method. In the second stage, we search an exponent matrix of the QC‐LDPC code with the best girth distribution. This exponent matrix is based on the base matrix obtained in the first stage. Consequently, the parity‐check matrix of the QC‐LDPC code with the best threshold and best girth distribution are constructed. Furthermore, bit error rate performances are compared for the QC‐LDPC codes constructed by proposed scheme, the QC‐LDPC code in 802.16e standard, and the QC‐LDPC code in Tam's study. Simulation results show that the QC‐LDPC codes proposed in this study are superior to both the 802.16e code and the Tam code on the additive white Gaussian noise (AWGN) and Rayleigh channels. Moreover, proposed scheme is easily implemented, and is flexible and effective for constructing QC‐LDPC codes with low encoding complexity. Copyright © 2012 John Wiley & Sons, Ltd.     

On unequal error protection LDPC codes based on plotkin-type constructions

We introduce a new family of unequal error protection (UEP) codes, based on low-density parity-check (LDPC) component codes and Plotkin-type constructions. The codes are decoded iteratively in multiple stages, and the order of decoding determines the level of error protection. The level of UEP among the code bits is also influenced by the choice of the LDPC component codes and by some new reliability features incorporated into the decoding process. The proposed scheme offers a very good tradeoff between code performance on one side and encoding/decoding and storage complexity on the other side. The novel approach to UEP also allows for finding simple approximations for the achievable degrees of UEP, which can be used to govern practical code design implementations.     

一种低码率的LDPC码在LTE-A中的性能研究

本文通过分析LTE-Advanced系统中准循环LDPC码校验矩阵的构造方法,在不改变母码矩阵的基础上,采用一种灵活的扩展方法,构造了一种低码率的LDPC码。采用一种很实用的编码算法和差分译码算法,在MATLAB仿真平台下,比较了这种LDPC码和Turbo码的性能。结果表明：在短码情况下,这种LDPC码在低信噪比下性能略低于Turbo码,但随着信噪比的增加,LDPC码性能优于Turbo码;在长码情况下,LDPC码的性能明显优于Turbo码。为LTE-Advanced系统的信道编解码器的硬件设计提供了一套有效的编译码算法方案,具有较好的实用价值。     

Design and performance of turbo Gallager codes

The most powerful channel-coding schemes, namely, those based on turbo codes and low-density parity-check (LDPC) Gallager codes, have in common the principle of iterative decoding. However, the relative coding structures and decoding algorithms are substantially different. This paper shows that recently proposed novel coding structures bridge the gap between these two schemes. In fact, with properly chosen component convolutional codes, a turbo code can be successfully decoded by means of the decoding algorithm used for LDPC codes, i.e., the belief-propagation algorithm working on the code Tanner graph. These new turbo codes are here nicknamed "turbo Gallager codes." Besides being interesting from a conceptual viewpoint, these schemes are important on the practical side because they can be decoded in a fully parallel manner. In addition to the encoding complexity advantage of turbo codes, the low decoding complexity allows the design of very efficient channel-coding schemes.     

Low-complexity LDPC coded BICM-ID with orthogonal modulations

A low-complexity low density parity check (LDPC) coded bit-interleaved coded modulation with iterative decoding (BICM-ID) scheme with orthogonal modulations is proposed. With a novel mapping strategy of coded bits to symbols, the proposed scheme is equivalent to a generalised LDPC code with Hadamard constraints and thus orthogonal demodulation can be merged into the iterative LDPC decoding process, resulting in a simpler implementation and a lower computational complexity.     

低密度校验码及其在图像传输中的应用

低密度校验(Low-Density Parity-Check,LDPC)码是一种基于图和迭代译码的信道编码方案,性能非常接近Shannon极限且实现复杂度低,具有很强的纠错抗干扰能力。该文深入研究了LDPC码的编码和译码基本原理,并将其应用于移动衰落信道图像的传输中,仿真结果表明LDPC码能为图像传输带来显著的性能提高,且系统复杂度低,译码时延短。     

Low Complexity Decoder Architecture for Low-Density Parity-Check Codes

In this paper, we propose a low complexity decoder architecture for low-density parity-check (LDPC) codes using a variable quantization scheme as well as an efficient highly-parallel decoding scheme. In the sum-product algorithm for decoding LDPC codes, the finite precision implementations have an important tradeoff between decoding performance and hardware complexity caused by two dominant area-consuming factors: one is the memory for updated messages storage and the other is the look-up table (LUT) for implementation of the nonlinear function Ψ(x). The proposed variable quantization schemes offer a large reduction in the hardware complexities for LUT and memory. Also, an efficient highly-parallel decoder architecture for quasi-cyclic (QC) LDPC codes can be implemented with the reduced hardware complexity by using the partially block overlapped decoding scheme and the minimized power consumption by reducing the total number of memory accesses for updated messages. For (3, 6) QC LDPC codes, our proposed schemes in implementing the highly-parallel decoder architecture offer a great reduction of implementation area by 33% for memory area and approximately by 28% for the check node unit and variable node unit computation units without significant performance degradation. Also, the memory accesses are reduced by 20%.     

GB20600标准的LDPC码的改进

尽管LDPC码已经被GB20600标准采纳作为信道编码,与其它LDPC码相比,在同样码长和码率的情况下,GB20600 LDPC码误码率性能并非最佳;GB20600标准的LDPC码的码长达7493,存在编码复杂性问题,但是GB20600 LDPC码未采用基于校验矩阵的快速算法,这给GB20600 LDPC编解码器的硬件实现带来较大的困难。本文在现有GB20600 LDPC码的设计框架下,对GB20600中LDPC码的校验矩阵进行了修改,在此基础上提出一种有效的LDPC码的快速迭代算法,使编解码器的硬件易于实现。改进后的LDPC码的编码算法具有较低的实现复杂度。仿真结果表明,改进后的LDPC码的误包率性能优于现GB20600中LDPC码的误包率性能。      

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.     

高性能时不变LDPC卷积码构造算法研究

该文基于由QC-LDPC码获得时不变LDPC卷积码的环同构方法,设计了用有限域上元素直接获得时不变LDPC卷积码多项式矩阵的新算法。以MDS卷积码为例,给出了一个具体的构造过程。所提构造算法可确保所获得的时不变LDPC卷积码具有快速编码特性、最大可达编码记忆以及设计码率。基于滑动窗口的BP译码算法在AWGN信道上的仿真结果表明,该码具有较低的误码平台和较好的纠错性能。     

Two Bit-Flipping Decoding Algorithms for Low-Density Parity-Check Codes

In this letter, a low complexity decoding algorithm for binary linear block codes is applied to low-density paritycheck (LDPC) codes and improvements are described, namely an extension to soft-decision decoding and a loop detection mechanism. For soft decoding, only one real-valued addition per code symbol is needed, while the remaining operations are only binary as in the hard decision case. The decoding performance is considerably increased by the loop detection. Simulation results are used to compare the performance with other known decoding strategies for LDPC codes, with the result that the presented algorithms offer excellent performances at smaller complexity.     

基于Polar码的速率兼容调制方案设计

提出了一种基于Polar码的速率兼容调制（rate compatible modulation,RCM）联合设计方案,用于提高无线通信频谱利用率.相应地设计了基于置信度传播（belief propagation,BP）和软抵消（soft cancellation,SCAN）的接收端高效联合迭代译码算法.根据该算法可通过优化变量节点对数似然比（log-likelihood ratio,LLR）信息迭代方式以及采用限制译码符号上限的改进措施,提高译码过程的稳定性与时效性.与距离优化的级联低密度奇偶校验（low-density parity-check codes,LDPC）码RCM方案对比结果表明,提出的高效联合迭代译码算法在低信噪比（signal noise ratio,SNR）下有更低的译码复杂度,并且具有更优的吞吐量和误码率性能.因此,本文所提方案适合在恶劣信道条件下的无线传输.     

基于相对残余度的LDPC码置信传播译码调度算法(英文)

Two Relative-Residual-based Dynamic Schedules(RRDS) for Belief Propagation(BP) decoding of Low-Density Parity-Check(LDPC) codes are proposed,in which the Variable code-RRDS(VN-RRDS) is a greediness-reduced version of the Check code-RRDS(CN-RRDS).The RRDS only processes the variable(or check) node,which has the maximum relative residual among all the variable(or check) nodes in each decoding iteration,thus keeping less greediness and decreased complexity in comparison with the edge-based Variable-to-Check Re...     

光通信系统中LDPC码的构造及其编译码算法分析

针对低密度奇偶校验（LDPC）码的相关理论和LDPC码自身特性以及光通信系统具有低噪声、高信噪比的传输特点进行分析后,提出了光通信系统中LDPC码型的构造方法,这为光通信系统中LDPC码型的构造和仿真分析奠定了基础。并对光通信系统中LDPC码的编译码算法进行了深入分析与研究,得到一些有利于降低其编译码算法复杂度的重要结论,这有助于降低其编译码器的设计与实现复杂度。     

LDPC码及其在Rayleigh信道上的性能

本文介绍低密度奇偶校验码（LDPC）的基本原理。包括它的基本特性、编码方式、译码算法原理。详细介绍了LOG域的和积译码算法在平坦瑞利衰落信道上的具体步骤，并仿真出1／2码率、不同信息序列长度的规则LDPC码在平坦瑞利衰落信道上的性能。     

光通信中一种基于有限域循环子群的QC-LDPC码构造方法

基于有限域循环子群方法提出了一种结构简单,可以灵活选择码长、码率,并且编译码复杂度低的准循环低密度奇偶校验(QC-LDPC)码构造方法。利用此方法构造出适合光通信系统传输的规则QC-LDPC(5334,4955)码。仿真结果表明该码型利用和积迭代译码算法在加性高斯白噪声信道中取得了很好的性能,比已广泛应用于光通信中的经典RS(255,239)码具有更好的纠错性能。因此所构造的QC-LDPC(5334,4955)码能较好地适用于高速长距离光通信系统。