截断式原模图低密度奇偶校验卷积码边扩展优化

截断式原模图低密度奇偶校验(LDPC)卷积码(P-LDPC-CCs)结合了原模图LDPC(P-LDPC)码和卷积码的特点,具有多变的编码构造方式和优异的纠错性能,实现了编译码低时延特性.边扩展作为构造截断式原模图LDPC卷积码基础矩阵关键步骤,是影响其性能的重要因素.该文提出了一种边扩展优化方法.该方法利用原模图外信息转移(P-EXIT)算法理论分析基础矩阵的译码门限,引入差分进化思想搜索一定条件下最优的边扩展方式.理论分析与系统仿真结果均表明所提边扩展优化方法比现有的方法具有更好的性能.     

截断式原模图低密度奇偶校验卷积码边扩展优化

截断式原模图低密度奇偶校验(LDPC)卷积码(P-LDPC-CCs)结合了原模图LDPC (P-LDPC)码和卷积码的特点,具有多变的编码构造方式和优异的纠错性能,实现了编译码低时延特性。边扩展作为构造截断式原模图LDPC卷积码基础矩阵关键步骤,是影响其性能的重要因素。该文提出了一种边扩展优化方法。该方法利用原模图外信息转移(P-EXIT)算法理论分析基础矩阵的译码门限,引入差分进化思想搜索一定条件下最优的边扩展方式。理论分析与系统仿真结果均表明所提边扩展优化方法比现有的方法具有更好的性能。     

空间激光通信中基于原模图的LDPC码构造方法

研究了空间激光通信系统中的信道编码算法,基于原模图和准循环扩展,提出了一种性能优异的低密度奇偶校验(LDPC)码构造方法,可以满足光通信系统中的高速编译码需求。仿真结果表明,构造的LDPC码纠错性能强,在误码率(BER)为10-9数量级处仍未出现误码平底,适合长距离空间激光通信系统。     

移动数字多媒体的原模图LDPC码设计

提出一种用于移动数字多媒体的原模图LDPC码,提出的LDPC码的编码算法可以简化编码器的硬件.在AWGN信道仿真结果表明,提出的LDPC码的性能要优于GB20600 LDPC码.     

一种快速编码的半随机LDPC码构造研究

低密度奇偶校验码(LDPC码)具有逼近Shannon限的优异纠错性能,在信道编码领域的应用越来越广泛,但是LDPC码的编码复杂性一直是制约其普遍应用的突出问题。奇偶校验矩阵的结构则直接决定着LDPC码的编码复杂度和译码性能。提出一种准双对角线结构的半随机LDPC码奇偶校验矩阵的构造方法,它具有IEEE 802.16e标准LDPC码的优异纠错性能和低编码复杂度,同时在码率、码长、基础校验矩阵和扩展因子等设计方面更具灵活性,能更好地适应工程实践的需要。采用这种构造方法,以(16 384,8 192)LDPC码为例进行快速迭代编码,能够获得优异的译码性能,可以用于实现高速率低复杂度的LDPC译码器设计。     

一种估测LDPC码最小距离的方法

由于LDPC码具有译码复杂度低,纠错性能好等众多优点,WiMAX 802.16e标准已将 LDPC 码作为OFDMA物理层的一种信道编码方案.本文采用从最小距离和码重分布的角度来研究LDPC码的纠错性能,深入研究了估计LDPC码距离特性的ANC算法,并利用此算法估测出几组LDPC码的最小距离.结果验证了ANC算法的正确...     

高码率短码长两边类型LDPC码的设计

高码率LDPC（10w．densityparity-check）码的设计一直是当前纠错编码领域的难点,尤其在短码长情况下。近年被提出的两边类型LDPC（tow—edgetypeLDPC,TET-LDPC）码在高码率情况下具有比传统LDPC码更加优秀的纠错性能。基于对TET—LDPC码结构优势的分析,文中提出一种优化设计方法,该方法通过合理选取TET．LDPC码中删余变量节点的度以及优化校验节点和变量节点的连接关系,进一步提高了该码型的性能。仿真结果显示,在AWGN信道下,文中设计的高码率短码长TET—LDPC码,不仅好于传统LDPC码,而且也好于传统的TET-LDPC码,具有更低的误码平台。     

卫星激光通信中基于Zig-Zag结构的原模图QC-LDPC码构造方法

为应对卫星激光通信信道的时变性、改善传输的可靠性,提出一种基于Zig-Zag结构的原模图QC-LDPC码构造方法.该方法将原模图与Zig-Zag结构的移位系数设计方法相结合,构造校验矩阵围长至少为8且码长码率可灵活选择的ZZ-QC-LDPC码.仿真结果表明:该方法所构造的ZZ-QC-LDPC码在误码率为10-6时,与同码率下基于等差数列和原模图构造的QC-LDPC码和基于最大公约数构造的QC-LDPC码以及具有大围长快速编码特性的QC-LDPC码相比,其净编码增益分别提高了约0.2,0.1和0.64 dB,且在较大码率范围内均具有良好的纠错性能.     

低密度奇偶校验码的girth集及其性能分析

girth性质研究已经成为当前LDPC码的研究重点之一,本文在找到一种基于递归的LDPC码girth搜索方法的基础上,提出LDPC码的girth长度与纠错性能之间没有必然关系,并通过IEEE Std 802.16e格式的LDPC码进行了仿真验证;此外.本文指出,girth集影响LDPC码的纠错性能,在girth长度、码长等其他参数相同的情况下,纠错能力随girth集的变小而增强。     

高码率短码长两边类型LDPC码的设计

高码率LDPC(low-density parity-check)码的设计一直是当前纠错编码领域的难点,尤其在短码长情况下。近年被提出的两边类型LDPC(tow-edge type LDPC,TET-LDPC)码在高码率情况下具有比传统LDPC码更加优秀的纠错性能。基于对TET-LDPC码结构优势的分析,文中提出一种优化设计方法,该方法通过合理选取TET-LDPC码中删余变量节点的度以及优化校验节点和变量节点的连接关系,进一步提高了该码型的性能。仿真结果显示,在AWGN信道下,文中设计的高码率短码长TET-LDPC码,不仅好于传统LDPC码,而且也好于传统的TET-LDPC码,具有更低的误码平台。     

A new high rate code scheme with highly parallel and low complexity decoding algorithm

A new high rate code scheme is proposed in this paper. It consists of serial concatenated recursive systematic ordinary (nonpunctured) convolutional codes with only 8 states in the trellis of the corresponding reciprocal dual codes. With a low complexity and highly parallel decoding algorithm, over additive white Gaussian noise channels, the proposed codes can achieve good bit error rate (BER) performance comparable to that of turbo codes and low density parity check (LDPC) codes. At code rate R=16/17, the overall decoding complexity of the proposed code scheme is almost half that of the LDPC codes.     

Iterative decoding for partial response (PR), equalized,magneto-optical (MO) data storage channels

Turbo codes and low-density parity check (LDPC) codes with iterative decoding have received significant research attention because of their remarkable near-capacity performance for additive white Gaussian noise (AWGN) channels. Previously, turbo code and LDPC code variants are being investigated as potential candidates for high-density magnetic recording channels suffering from low signal-to-noise ratios (SNR). We address the application of turbo codes and LDPC codes to magneto-optical (MO) recording channels. Our results focus on a variety of practical MO storage channel aspects, including storage density, partial response targets, the type of precoder used, and mark edge jitter. Instead of focusing just on bit error rates (BER), we also study the block error statistics. Our results for MO storage channels indicate that turbo codes of rate 16/17 can achieve coding gains of 3-5 dB over partial response maximum likelihood (PRML) methods for a 10^-4 target BER. Simulations also show that the performance of LDPC codes for MO channels is comparable to that of turbo codes, while requiring less computational complexity. Both LDPC codes and turbo codes with iterative decoding are seen to be robust to mark edge jitter     

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

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

On the application of LDPC codes to arbitrary discrete-memoryless channels

We discuss three structures of modified low-density parity-check (LDPC) code ensembles designed for transmission over arbitrary discrete memoryless channels. The first structure is based on the well-known binary LDPC codes following constructions proposed by Gallager and McEliece, the second is based on LDPC codes of arbitrary (q-ary) alphabets employing modulo-q addition, as presented by Gallager, and the third is based on LDPC codes defined over the field GF(q). All structures are obtained by applying a quantization mapping on a coset LDPC ensemble. We present tools for the analysis of nonbinary codes and show that all configurations, under maximum-likelihood (ML) decoding, are capable of reliable communication at rates arbitrarily close to the capacity of any discrete memoryless channel. We discuss practical iterative decoding of our structures and present simulation results for the additive white Gaussian noise (AWGN) channel confirming the effectiveness of the 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.     

A high‐performance belief propagation decoding algorithm for codes with short cycles

The simplicity of decoding is one of the most important characteristics of the low density parity check (LDPC) codes. Belief propagation (BP) decoding algorithm is a well‐known decoding algorithm for LDPC codes. Most LDPC codes with long lengths have short cycles in their Tanner graphs, which reduce the performance of the BP algorithm. In this paper, we present 2 methods to improve the BP decoding algorithm for LDPC codes. In these methods, the calculation of the variable nodes is controlled by using “multiplicative correction factor” and “additive correction factor.” These factors are obtained for 2 separate channels, namely additive white Gaussian noise (AWGN) and binary symmetric channel (BSC), as 2 functions of code and channel parameters. Moreover, we use the BP‐based method in the calculation of the check nodes, which reduces the required resources. Simulation results show the proposed algorithm has better performance and lower decoding error as compared to BP and similar methods like normalized‐BP and offset‐BP algorithms.     

LDPC码的改进及其应用的研究

在介绍LDPC(Low Density Parity Code)低密度校验码的基本原理的基础上，针对任意离散无记忆信道的传输，从两个方面对其结构进行了改进。这种改进的LDPC码是定义在有限域GF(q)上的非正则LDPC码，较之正则LDPC码具有更好的性能。采用改进的非正则LDPC码，经过最大似然概率译码，能够实现以任意逼近任何离散无记忆信道容量的速率的可靠通信。同时，讨论了对应于这种码结构的实际的迭代译码方法，并简单介绍了这种改进的非正则LDPC码在OFDM系统、压缩图像传输等方面的应用。     

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

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

Quasi-cyclic LDPC codes using overlapping matrices and their layered decoders

Quasi-cyclic (QC) low-density parity-check (LDPC) codes have the parity-check matrices consisting of circulant matrices. Since QC LDPC codes whose parity-check matrices consist of only circulant permutation matrices are difficult to support layered decoding and, at the same time, have a good degree distribution with respect to error correcting performance, adopting multi-weight circulant matrices to parity-check matrices is useful but it has not been much researched. In this paper, we propose a new code structure for QC LDPC codes with multi-weight circulant matrices by introducing overlapping matrices. This structure enables a system to operate on dual mode in an efficient manner, that is, a standard QC LDPC code is used when the channel is relatively good and an enhanced QC LDPC code adopting an overlapping matrix is used otherwise. We also propose a new dual mode parallel decoder which supports the layered decoding both for the standard QC LDPC codes and the enhanced QC LDPC codes. Simulation results show that QC LDPC codes with the proposed structure have considerably improved error correcting performance and decoding throughput.     

非规则LDPC码在RICE信道中的性能分析

本文对非规则LDPC码在RICE信道的性能进行了分析和仿真,修正了BP译码算法,证明了RICE信道满足对称性,给出了RICE信道译码稳定性条件,推导出了RICE信道的Shannon容量限,采用VC编程对码长N=49512和3072进行了仿真,同时与同码长的Turbo码进行了比较;仿真结果表明LDPC码在码长N＝49512、码率R＝1/3时,与Shannon限相差1dB以内、在低信噪比时其性能优于Turbo码,以及LDPC码本身有很好的交织特性和抗衰落的能力;这进一步表明了LDPC码在包括RICE信道在内的各种信道中的性能都是非常优良的.