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

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

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.     

A CLASS OF LDPC CODE''''S CONSTRUCTION BASED ON AN ITERATIVE RANDOM METHOD

This letter gives a random construction for Low Density Parity Check (LDPC) codes, which uses an iterative algorithm to avoid short cycles in the Tanner graph. The construction method has great flexible choice in LDPC code's parameters including codelength, code rate, the least girth of the graph, the weight of column and row in the parity check matrix. The method can be applied to the irregular LDPC codes and strict regular LDPC codes. Systemic codes have many applications in digital communication, so this letter proposes a construction of the generator matrix of systemic LDPC codes from the parity check matrix. Simulations show that the method performs well with iterative decoding.     

一种利用大衍数列构造多码率原模图QC-LDPC码的方法

针对准循环低密度奇偶校验(Quasi-Cyclic Low-Density Parity-Check,QC-LDPC)码存在码长码率不能灵活选择的问题,提出了一种基于大衍数列构造多码率的原模图QC-LDPC码的新颖方法,该方法利用计算机搜索算法得到原模图基矩阵,然后基于大衍数列的循环移位矩阵对原模图基矩阵进行循环扩展,以此得到校验矩阵.该方法构造的校验矩阵围长至少为6,只需要简单的移位寄存器就可以实现编码,并且具有良好的纠错性能.仿真结果表明,在误码率(BitError Rate,BER)为10-6时,所构造的码率为0.5的P-DY-QC-LDPC(4000,2000)码和码率为0.75的P-DY-QC-LDPC(4000,3000)码与同码率近似码长的其他码型相比较,其净编码增益均有一定提高.     

A CLASS OF LDPC CODE’S CONSTRUCTION BASED ON AN ITERATIVE RANDOM METHOD

This letter gives a random construction for Low Density Parity Check （LDPC） codes, which uses an iterative algorithm to avoid short cycles in the Tanner graph. The construction method has great flexible choice in LDPC code＇s parameters including codelength, code rate, the least girth of the graph, the weight of column and row in the parity check matrix. The method can be applied to the irregular LDPC codes and strict regular LDPC codes. Systemic codes have many applications in digital communication, so this letter proposes a construction of the generator matrix of systemic LDPC codes from the parity check matrix. Simulations show that the method performs well with iterative decoding.     

基于多重置换阵的满秩结构化LDPC码构造方法

 在多重置换阵的基础上,提出一种适用基于网络编码的协作中继策略的结构化LDPC码构造方法.首先定义了多重置换阵的概念,提出并证明了该方阵在秩和消元等方面的重要性质;给出具体的构造步骤,构造了列重为3和围长至少为6的满秩LDPC码;分析了该LDPC码的生成矩阵,具有稀疏和结构化的特点,适用基于网络编码的协作中继系统中进行联合网络编码和迭代译码.仿真结果表明,在相同码长、2/3码率和准循环矩阵 Y 结构条件下,相比阵列LDPC码、近似双对角形式的LDPC码和三对角形式的LDPC码,新构造的LDPC码具有相对较好的译码性能.     

GB20600标准的LDPC码的改进

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

一种基于BIBD的量子LDPC码构造新方法

利用均衡不完全区组设计(Balance Imcomplete Block Designs,BIBD)的半结构化低密度奇偶校验(Low Density Parity Check,LDPC)码设计方法,该文提出了一种获得自对偶CSS(Calderbank-Shor-Steane)式的量子LDPC码的校验矩阵的新构造方法。由于构造出的量子码校验矩阵稀疏,有且仅有一个4环(girth 4),在置信传播迭代译码算法下可获得良好的性能。数值计算结果表明,对于该构造方法得到的GF(6t+1)和GF(12t+1)量子LDPC码,比基于BIBD的其他构造方法所得到的量子码的码长更长、量子校验矩阵更加稀疏、性能也更加优越。     

Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes

In this paper, a simple and effective tool for the design of low-density parity-check (LDPC) codes for iterative correction of bursts of erasures is presented. The design method consists of starting from the parity-check matrix of an LDPC code and developing an optimized parity-check matrix, with the same performance over the memoryless erasure channel, and suitable also for the iterative correction of single erasure bursts. The parity-check matrix optimization is performed by an algorithm called pivot searching and swapping (PSS) algorithm. It executes permutations of carefully chosen columns of the parity-check matrix, after a local analysis of particular variable nodes called stopping set pivots. This algorithm can be in principle applied to any LDPC code. If the input parity-check matrix is designed to achieve a good performance over the memoryless erasure channel, then the code obtained after the application of the algorithm provides a good joint correction of independent erasures and single erasure bursts. Numerical results are provided in order to show the algorithm effectiveness when applied to different categories of LDPC codes.     

准循环多进制LDPC码构造

该文研究准循环多进制LDPC码的构造,给出多进制LDPC码的设计流程和构造方法.详细讨论了多进制LDPC码的性能影响因素,综合考虑了环长和环的连通性对性能的影响,研究了母矩阵扩展中偏移因子的选择以及GF(q)上非零元素替代.同时提出了次优解的搜索方法,以降低搜索复杂度.最后,将提出的方法用于不同阶数下LDPC码的构造.仿真结果表明,通过新方法构造得到的多进制LDPC码与二进制码相比,在BPSK调制方式下在误帧率10-4附近有0.2 dB的性能提升;在有限域阶数与调制阶数匹配的情况下,有更大的性能提升.与相近码长,相同码率的多进制循环码相比,该文构造得到的多进制LDPC码在误帧率10-4附近有0.25 dB的性能提升.     

一种改进的QC_LDPC码在MIMO-OFDM系统中的性能研究

由于规则的QC码的校验矩阵是奇异的,那么虽然QC码在硬件上较之于一般的LDPC码更容易实现,但是其性能往往比一般的LDPC码对系统的性能要差,为此本文基于此种考虑,设计了一种新的快速编码的不规则QC码,FQC-LDPC码,并就其构造方法和在MIMO-OFDM系统的性能进行了研究.     

一种基于伪循环MDS码的准循环LDPC码构造方法

该文提出了一种利用两个信息符号的伪循环最大距离可分(MDS)码,构造围长为6的准循环低密度奇偶校验(LDPC)码的方法。在GF(q)中,它通过直接计算长为q+1的伪循环MDS码生成多项式,构造准循环LDPC码的校验矩阵。其主要利用了含两个信息符号的伪循环MDS码字特殊的循环性,及任意两个码字间距离不小于q的特点,使所构造的准循环LDPC码保证无4环。仿真结果表明,基于伪循环MDS码的准循环LDPC码在高斯信道下,能获得较好的误码性能。     

LDPC编码中大矩阵求逆及存储的一些方法

低密度奇偶校验(LDPC)码在CMMB、DVB-S2及地面数字电视国家标准(GB20600-2006)等标准中得到了广泛的应用,LDPC码在码长较长时优势才比较明显,而在进行编码运算时码长较长会遇到大矩阵求逆及存储方面的问题,就此提出一些大矩阵求逆及存储的方法,简化了LDPC编码运算时的复杂度.     

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码的构造

主要提出一种新的计算规则LDPC(low-density parity-check)码的最小距离下界的方法。该方法是基于LDPC码的每个变量节点的独立树进行构造LDPC码。与随机构造的LDPC码和用PEG方法构造的方法比较,这个新的构造方法得到了更大的围长和最小距离下界。在AWGN信道中,在码长N=1 008和N=1 512时进行Matlab仿真,仿真结果表明随着信噪比的增加此方法构造的LDPC码有优异的误码率性能。     

Configurable LDPC Decoder Architectures for Regular and Irregular Codes

Low Density Parity Check (LDPC) codes are one of the best error correcting codes that enable the future generations of wireless devices to achieve higher data rates with excellent quality of service. This paper presents two novel flexible decoder architectures. The first one supports (3,6) regular codes of rate 1/2 that can be used for different block lengths. The second decoder is more general and supports both regular and irregular LDPC codes with twelve combinations of code lengths ??648,1296,1944-bits and code rates-1/2,2/3,3/4,5/6- based on the IEEE 802.11n standard. All codes correspond to a block-structured parity check matrix, in which the sub-blocks are either a shifted identity matrix or a zero matrix. Prototype architectures for both LDPC decoders have been implemented and tested on a Xilinx field programmable gate array.     

可分解的RC-LDPC码以及HARQ的设计

该文提出了一种可分解的码率兼容LDPC码的构造方法, 该方法构造所得到的一个高码率LDPC码的校验矩阵中包含有若干低码率LDPC码的校验矩阵,而且一个高码率的LDPC码又可以分解成多个性能优异的低码率的LDPC码进行编译码;结合该特性设计了一种基于可分解的码率兼容LDPC码的混合自动重传方案。与普通的ARQ方案相比,该重传方案不单能够通过重传获得更多的信息,而且能够通过降低纠错码的码率来提高纠错码的性能。仿真结果表明,当所采用LDPC码的码长为2000左右,码率为1/2和2/3时,与一般的ARQ相比,该方案的误帧率以及吞吐量(小于0.5的时候)均能获得近1.5dB的增益。     

一种新颖的低错误平层LDPC码构造方法

针对低密度奇偶校验(LDPC)码在高信噪比区域可能存在错误平层的缺点,提出了一种低错误平层LDPC码的新构造方法。该方法的基本矩阵由渐进边增长(PEG)算法与近似环额外信息度(ACE)算法相结合,目的是提升基本矩阵中环的连通性;然后将基于分割移位(PS)的循环移位系数矩阵对基本矩阵循环扩展,以此构造出校验矩阵。该方法除了能够改善高信噪比区域的错误平层,还具有码长、码率的任意可设性特点。仿真结果表明,PAP-LDPC(3 600,2 700)码在信噪比为4 dB以后并未出现明显的错误平层。     

基于QC-LDPC码的MIMO-OFDM系统的性能仿真

QC-LDPC码是一个十分重要的LDPC码研究分支。QC-LDPC码(准循环低密度奇偶校验码)是一类结构化的LDPC码,其校验矩阵H采用准循环方式构造,具有实现复杂度低的特点,易于硬件实现。大量研究人员认为,MIMO-OFDM技术将会成为4G的核心技术。将QC-LDPC码与MIMO-OFDM系统相结合,分析了在时变频率选择性衰落信道下的系统性能。仿真结果表明,在时变频率选择性衰弱信道下,QC-LDPC码与随机构造的LDPC码具有接近的系统性能。     

Efficient encoding of quasi-cyclic low-density parity-check codes

Quasi-cyclic (QC) low-density parity-check (LDPC) codes form an important subclass of LDPC codes. These codes have encoding advantage over other types of LDPC codes. This paper addresses the issue of efficient encoding of QC-LDPC codes. Two methods are presented to find the generator matrices of QC-LDPC codes in systematic-circulant (SC) form from their parity-check matrices, given in circulant form. Based on the SC form of the generator matrix of a QC-LDPC code, various types of encoding circuits using simple shift registers are devised. It is shown that the encoding complexity of a QC-LDPC code is linearly proportional to the number of parity bits of the code for serial encoding, and to the length of the code for high-speed parallel encoding.