不规则LDPC码构造方法研究及其改进

通过对码的度数分布进行设计,非规则LDCP码能获得比规则LDPC码更好的性能,但非规则LDPC码在高SNR区会出现错误平层.在本文中,利用ACE算法,对非规则LDPC码的构造方法PEG算法进行改进,以降低非规则LDPC码的错误平层.最后Matlab模拟证明此算法有效提高了非规则LDPC码在加性高斯白噪声通道中的纠错性能.     

一种低差错平底线性复杂度的QC-LDPC码构造方法

本文给出了一种低差错平底QC-LDPC码构造方法.首先,提出了扩展近似下三角阵eALT( extern Approximate Lower Triangular)的全局矩阵构造法,通过对改进后的全局矩阵M进行矩阵置换,生成LDPC码的校验矩阵H以达 到减少小停止集( Stopping Set)数量,降低差错平台(Er...     

非规则LDPC码简化译码算法研究

主要介绍了低密度奇偶校验码(LDPC)的基本概念及规则和非规则两种典型的LDPC码的结构,简要介绍了LDPC码的译码算法,在此基础上,引出两种非规则LDPC码的简化译码算法,仿真验证算法较大地降低了译码复杂度,并在高信噪比下性能损失较小.     

串行级联LDPC码及其传输性能分析

提出了一种简化的LDPC译码算法,以减小译码算法的复杂度.以非规则LDPC码作为内码,串联一个高码率规则LDPC码作为外码,可降低或消除错误平层.将此串行级联LDPC码在M-QAM调制信道上进行了仿真分析,结果表明其性能优于RS码,可有效利用带宽,同时保证数据可靠传输.     

非规则准循环OOC-LDPC码在图像传输中的应用

介绍了非规则准循环OOC-LDPC码的构造,并将其应用到图像传输中,根据SPIHT压缩图像编码后的码流具有渐进性的特点,进行不等差错保护。在AWGN信道下仿真结果表明,非规则准循环OOC-LDPC码具有很好的纠错能力和不等差错保护特性。     

非规则全分集LDPC码的构造方法

提出一种基于渐进边增长（Progressive Edge．Growth,PEG）算法的非规则全分集低密度奇偶校验（Low—Density Parity—Check,LDPC）码的构造方法。首先根据度分布和码率,对非规则全分集LDPC码中的节点进行度分配;然后对PEG算法中校验节点的选择标准加以约束,生成消除短环的非规则全分集LDPC码;进一步,通过改变局部校验节点剩余度的方法,解决在特殊度分布下算法失效的问题。仿真结果表明,构造的非规则全分集LDPC码在瑞利块衰落信道下能够实现全分集;在码长、码率相同的情况下与规则全分集LDPC码相比,非规则全分集LD—PC码能够获得更高的编码增益。     

关于非规则LDPC码的基于度分布HARQ性能研究

该文提出了一种非规则LDPC码字基于度分布HARQ技术的改进方案。该方案在选择重传信息的过程中,不仅考虑了节点度分布的影响,而且考虑了非规则LDPC码字自身的不均等错误保护特性。与原始的基于度分布的HARQ方案相比,该方案使系统的误比特率和吞吐量指标得到了明显改善。     

基于混沌理论的导航电文LDPC设计

混沌系统的类随机以及不规则特性．特别是对初始条件的敏感依赖性．可应用于信道编码领域。性能优越、逼近香农限的低密度奇偶校验码（LDPC）是一类重要的线性分组码。本文分析混沌系统的基本特性．并基于Logistic混沌模型构造与GPS新民用信号CNAV2导航电文同码长的LDPC码校验矩阵．并与规则MacKay码以及随机构造的非规则码比较。仿真结果表明,基于混沌理论构造的LDPc码．其环分布方差较大,相比随机码其错误平层也较低。     

光传输系统中LDPC码的新颖随机构造方法

分析光传输系统的传输特性与规则LDPC码的随机构造方法之后,提出LDPC码的一种新颖随机构造方法。基于该构造方法构造了一种新颖的码率为93.7%、冗余度为6.69%的规则SCG-LDPC(3969,3720)码,该规则LDPC码在将来的硬件实现中可相对地节省硬件存储空间和减少计算量。仿真分析表明:该新颖的SCG-LDPC(3969,3720)码在BER为10-8时,与同码率同冗余度的ITU-T G.975建议中RS(255,239)码和ITU-T G.975.1建议中LDPC(32640,30592)码相比,其净编码增益(NCG)和距离Shannon限都分别改善了约1.92dB和0.97dB。因而该规则LDPC码的纠错性能更为优越,更适用于光传输系统。     

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

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

Performance analysis and code optimization of low densityparity-check codes on Rayleigh fading channels

A numerical method has been presented to determine the noise thresholds of low density parity-check (LDPC) codes that employ the message passing decoding algorithm on the additive white Gaussian noise (AWGN) channel. In this paper, we apply the technique to the uncorrelated flat Rayleigh fading channel. Using a nonlinear code optimization technique, we optimize irregular LDPC codes for such a channel. The thresholds of the optimized irregular LDPC codes are very close to the Shannon limit for this channel. For example, at rate one-half, the optimized irregular LDPC code has a threshold only 0.07 dB away from the capacity of the channel. Furthermore, we compare simulated performance of the optimized irregular LDPC codes and turbo codes on a land mobile channel, and the results indicate that at a block size of 3072, irregular LDPC codes can outperform turbo codes over a wide range of mobile speeds     

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码在DSP上的实现

首先简单介绍了非正则LDPC码的结构,给出了一种基于IEEE802.16e直接编码法生成的(576,288)非正则LDPC码的编译码原理。然后详细论述了其在TI定点DSP(TMS320C5510)上的定点化算法实现方式,并在经过C和部分汇编优化后将算法效率提高了70%以上,达到了实时系统要求。最后给出了该LDPC码与(2,1,7)卷积码在AWGN信道下的性能对比,表明这种中短码长的非正则LDPC码较卷积码有较大的纠错性能优势。     

Rice信道下LDPC码密度进化的研究

应用低密度奇偶校验(LDPC)码译码消息的密度进化可以得到码集的噪声门限,依此评价不同译码算法的性能,并可以用来优化非正则LDPC码的次数分布对。该文首先以Rice信道下正则LDPC码为例,讨论了不同量化阶数及步长时BP,BP-based 和offset BP-based 3种译码算法的DDE(Discrete Density Evolution)分析,接着在offset BP-based译码算法的DDE分析基础上,采用差分进化方法对Rice信道下非正则LDPC码的次数分布对进行了优化,得出了相应的噪声门限。最后,给出了Rice信道下码率为1/2的优化非正则LDPC码的概率聚集函数(PMF)进化曲线。     

Design of efficiently encodable moderate-length high-rate irregular LDPC codes

This paper presents a new class of irregular low-density parity-check (LDPC) codes of moderate length (10/sup 3//spl les/n/spl les/10/sup 4/) and high rate (R/spl ges/3/4). Codes in this class admit low-complexity encoding and have lower error-rate floors than other irregular LDPC code-design approaches. It is also shown that this class of LDPC codes is equivalent to a class of systematic serial turbo codes and is an extension of irregular repeat-accumulate codes. A code design algorithm based on the combination of density evolution and differential evolution optimization with a modified cost function is presented. Moderate-length, high-rate codes with no error-rate floors down to a bit-error rate of 10/sup -9/ are presented. Although our focus is on moderate-length, high-rate codes, the proposed coding scheme is applicable to irregular LDPC codes with other lengths and rates.     

Construction of Irregular LDPC Codes by Quasi-Cyclic Extension

In this correspondence, we propose an approach to construct irregular low-density parity-check (LDPC) codes based on quasi-cyclic extension. When decoded iteratively, the constructed irregular LDPC codes exhibit a relatively low error floor in the high signal-to-noise ratio (SNR) region and are subject to relatively few undetected errors. The LDPC codes constructed based on the proposed scheme remain efficiently encodable     

非正则LDPC码在AWGN信道中的性能研究

简单介绍了非正则低密度奇偶校验(Low Density Parity Check,LDPC)码的结构。研究了其对数域概率译码的和积算法(Sum Product Algorithm,SPA),并对该算法的主要公式进行了推导,给出了其迭代核心部分的C语言实现伪码。对一种基于802.16e直接编码法生成的非正则LDPC码在高斯信道下进行了仿真分析,表明中短码长的非正则LDPC码已经具有优异的纠错性能。     

Correcting capabilities of binary irregular LDPC code under low-complexity iterative decoding algorithm

This paper deals with the irregular binary low-density parity-check (LDPC) codes and two iterative low-complexity decoding algorithms. The first one is the majority error-correcting decoding algorithm, and the second one is iterative erasure-correcting decoding algorithm. The lower bounds on correcting capabilities (the guaranteed corrected error and erasure fraction respectively) of irregular LDPC code under decoding (error and erasure correcting respectively) algorithms with low-complexity were represented. These lower bounds were obtained as a result of analysis of Tanner graph representation of irregular LDPC code. The numerical results, obtained at the end of the paper for proposed lower-bounds achieved similar results for the previously known best lower-bounds for regular LDPC codes and were represented for the first time for the irregular LDPC codes.     

BER performance due to irregularity of row-weight distribution of the parity-check matrix in irregular LDPC codes for 10-gb/s optical signals

Forward-error correction (FEC) coding is theoretically investigated to improve bit-error-rate (BER) performance in a 10-Gb/s optical transmission system using randomly irregular low-density parity-check (LDPC) codes, regular LDPC codes, and the Reed-Solomon (RS) (255,239) code as a comparison. The irregular LDPC codes has different row-weight variances of a parity-check matrix from 10.9 to 18.8 and a row-weight mean of 60. Simulation is carried out under various conditions including the impairment factors such as dispersion, polarization-mode dispersion (PMD), and fiber nonlinearities. Results suggest that the irregular LDPC code with a low row-weight variance (=10.9) generally has better performance for the most impairment factors except for the factor of dispersion. On the other hand, for the factor of dispersion the irregular LDPC code performs better with a high row-weight variance (=18.8). A specific LDPC code can overcome the impairment limits in a deployed link.