LDPC码编译码研究和应用.pdfVIP

线性复杂度；第二，节省存储空间，编、译码端只需要存储少量参数，就可以恢复 出校验矩阵；第三，与随机构造的编码方法相比该编码器具有更好的纠错性能。 为了进一步研究LDPC码的构造方法并考虑其实用性，本文提出了基于循环差集 (Cyclic Difference Sets)的构造方法。首先介绍了区组设计的基本概念以及循环差集的 定义和循环差集的构造，然后研究了一种循环差集的码字构造方法。与该方法相对 应，提出了一种基于完备距离循环排列的LDPC编码方法。采用上述方法构造的编码 器，其校验矩阵由于进行列分割失去了循环性，不能利用循环移位寄存器进行编码， 编码复杂。为了降低编码复杂度，提出了一种循环差集的准循环编码方式。与已有 的一些循环差集设计方法相比，该设计具有两大优势：第一，实现简单，可以通过 移位寄存器实现编码，编码具有线性复杂度；第二，节省存储空间，编、译码端只 需要存储少量参数，就可以恢复出校验矩阵进行编译码。 关键词： LDPC码 迭代译码 和积算法 线性同余序列 非对称区组设计 循环差集 完备距离循环排列 II Abstract With the increasing demand for high-speed services in mobile communication systems, forward error correction (FEC) codes and signal processing techniques are receiving much attention. Low-density parity-check codes (LDPC) first discovered by Gallager in 1962 are a class of linear block error-correcting codes that can be defined by the very sparse parity-check matrix or the bipartite graph. They have very attractive properties: error performance approaching Shannon limits, easy description and implementation, convenient theoretical analysis and research, easily decoded in complete parallel ways and suitable for hardware implementation. In resent years, LDPC codes have gained increasingly consideration of researchers with their excellent error performance, simple description and very good application foreground. LDPC codes have become another focus following turbo codes in error-correcting coding fields. There were not good algebraic methods for constructing LDPC codes though they have good performance. Good LDPC codes, especially long codes, often are obtained by searching in computer. As lacking the circlular or quasi-circular character of the circular LDPC codes, these search-based codes have ve