空间耦合LDPC码在AWGN信道下的性能分析

空间耦合LDPC(Spatially Coupled LDPC,SC-LDPC)码由于阈值饱和特性,被证明是未来无线通信系统的有力候选码型。SC-LDPC码是一种卷积LDPC码,在二元无记忆对称信道下采用置信传播译码算法时具有逼近香农限的性能。对SC-LDPC码的构造及其经典的置信传播译码算法进行了阐述,并在加性高斯白噪声信道下进行了性能仿真和分析。仿真结果表明,SC-LDPC码的约束长度越长或最大迭代次数越大,其性能就越逼近香农容量限。SC-LDPC码在误码率为10^-5、最大迭代次数为100时,码长20 000比码长10 000大约有0. 68 d B的增益;在误码率为10^-5、码长为10000时,最大迭代次数100的SC-LDPC码比最大迭代次数10的码大约有0. 66 d B的增益。仿真结果有效验证了SCLDPC码在无线通信系统中的良好性能。     

AWGN信道下LDPC码的译码算法研究

在高斯白噪声(AWGN)信道情况下,针对LDPC码的译码算法进行深入分析后,对适用于低密度奇偶校验(LDPC)码的硬判决译码算法与软判决译码算法进行了仿真与对比分析,并通过引入乘性校正因子以降低软判决算法中对数域置信传播(LLR-BP)算法的变量消息相关性。仿真分析表明改进后的LLR-BP算法与原算法相比,在几乎不增加计算复杂度的情况下,其译码纠错性能得到了明显的改善。因而改进后的LLR-BP算法具有明显的优越性。     

多进制高斯信道下四进制LDPC码的实现

四进制低密度校验码(Low-Density Parity-Check Code,LDPC)具有较好的抗突发差错性能。为了进一步改善系统的性能并适当降低其复杂度,在二进制LDPC码的基础上,主要研究短码长四进制LDPC码,并在原有串行译码算法的基础上对其改进,提出一种基于校验点准确度的串行译码算法。仿真结果表明,在多进制高斯信道条件下,对于短码而言,改进的串行译码算法性能要优于串行译码算法,在误码率为10-2时,能获得0.25 d B的编码增益。     

瑞利信道下基于广义阈值函数的LDPC译码算法

现存的LDPC译码算法,其节点处理依据主要遵循大数逻辑准则和完全处理准则,对应的阈值参数一般是固定不变的,在性能和复杂度之间的均衡不够灵活.本文首先提出一种广义阈值函数,能应用于大多数基于可靠度的二元LDPC译码算法.通过调整阈值参数,可方便地控制参与迭代处理的节点队列.其次,本文提出一种基于伴随式和星座映射信息的非均匀量化译码算法,可进一步降低复杂度和存储负荷.实验结果显示,在瑞利信道下,本文算法能够在较低的量化比特下获得优良的译码性能;结合广义阈值函数,只有约30%的变量节点参与迭代运算,译码复杂度可显著降低.     

Algebraic Construction of Quasi-Cyclic LDPC Codes for the AWGN and Erasure Channels

This paper is concerned with construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes for three different types of channels: the additive white Gaussian noise, the binary random erasure, and the binary burst erasure channels. Two algebraic methods for systematic construction of QC-LDPC codes are presented. Codes constructed perform well over all three types of channels.     

基于反馈的非均衡X-Z信道量子LDPC译码

针对量子LDPC码,以前期所提出的反馈式和积译码算法(FSPA)为基础,考虑其在非均衡X-Z信道下的译码方法,并分析其相应的性能表现。研究表明在该信道模型下的反馈式策略依然可以借由错误图样对比,译码失败校验子的错误方式,以及信道特征分析,更加有效地调整信息节点上的概率分布,从而大幅提高和积译码器的译码能力。最后,通过实例仿真验证了上述结论。     

AWGN信道下RA码译码算法研究

RA(Repeat-Accumulate)码是一种简单但非常重要的TLC(Turbo-Like Codes)码。本文首先介绍了RA码的Tanner图表示。然后重点分析研究并详细推导了RA码在加性高斯白噪声(AWGN)信道上的迭代译码算法。     

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

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

一种非规则广义LDPC码的构造方法

广义低密度奇偶校验(Generalized Low睤ensity Parity睠heck,GLDPC)码把低密度奇偶校验(Low睤ensity Parity睠heck,LDPC)码中的单奇偶校验(Single Parity睠heck,SPC)节点替换为校验能力更强的广义约束(Generalized Constraint,GC)节点,使其在中短码和低码率的条件下具有更低的误码率。传统GLDPC码要求基矩阵的行重等于分量码的码长,这限制了GLDPC码构造的灵活性。另外,相比于传统GLDPC码中GC节点位置的随机选取,GC节点的位置选择在GLDPC码的误码率性能上有一定的优化空间。针对以上两点,提出了一种基于渐进边增长(Progressive Edge-rowth,PEG)算法的非规则GLDPC码构造方法和一种基于Tanner图边数的GC节点位置选择算法。使用PEG算法生成的非规则LDPC码作为本地码,根据本地码的校验节点度使用多种分量码,结合GC节点位置选择算法构造非规则GLDPC码。仿真结果表明,与传统方法构造的GLDPC码相比,基于Tanner图边数的GC节点位置选择算法构造的非规则PEG-LDPC码在误码率和译码复杂度上均得到明显改善。     

非平稳信道下LDPC码低复杂度滑窗置信传播联合信道估计与译码算法

随着移动通信应用场景的持续增多,非平稳信道成为越来越常见的传输环境,而非平稳信道下的可靠传输依赖于准确的信道估计。基于信源编码中用于信源参数估计和信源相关性估计的滑窗置信传播(SWBP)算法,该文提出一种非平稳信道下LDPC码的联合信道估计与译码(JCED)算法;同时,分别基于交叉熵和离散傅里叶变换提出两种在每轮JCED迭代中自适应设置滑窗长度的快速算法。仿真结果表明,在无导频辅助的前提下,所提算法具有接近理想信道估计下置信传播译码的性能以及高效率、低复杂度、强鲁棒性和不导致错误平层等优点。     

Identical-Capacity Channel Decomposition for Design of Universal LDPC Codes

Design of low-density parity-check (LDPC) codes suitable for all channels which exhibit a given capacity C is investigated. Such codes are referred to as universal LDPC codes. First, based on numerous observations, a conjecture is put forth that a code working on N equal-capacity channels, also works on any convex combination of these N channels. As a supporting evidence, we prove that a code satisfying the stability condition on N channels, also satisfies the stability condition on the convex hull of these N channels. Then, a channel decomposition method is suggested which spans any given channel with capacity C in terms of a number of identical-capacity basis channels. We expect codes that work on the basis channels to be suitable for any convex combination of the bases, i.e., all channels with capacity C. Such codes are found over a wide range of rates. An upper bound on the achievable rate of universal LDPC codes is suggested. Through examples, it is shown that our codes achieve rates extremely close to this upper bound. In comparison with existing LDPC codes designed for a given channel, significant performance gain is reported when codes are used over various channels of equal capacity.     

采用LDPC码的分布式联合信源信道网络编码

提出了采用低密度奇偶校验码的分布式联合信源信道网络编码方案,应用于两源一中继一目的节点的无线传感器网络中.在方案中,信源节点通过传输系统信道码的校验位与部分信息位,同时实现了信源压缩与信道纠错.中继节点有效利用数据的相关性进行译码,并进行部分数据比特删余,减少因中继端网络编码引起的错误传播,仿真验证了方案的有效性.应用了不等差错保护思想,更贴近实际应用场景,利于目的节点进行更好的低误差解码.     

非平稳信道下LDPC码低复杂度滑窗置信传播联合信道估计与译码算法

随着移动通信应用场景的持续增多,非平稳信道成为越来越常见的传输环境,而非平稳信道下的可靠传输依赖于准确的信道估计.基于信源编码中用于信源参数估计和信源相关性估计的滑窗置信传播(SWBP)算法,该文提出一种非平稳信道下LDPC码的联合信道估计与译码(JCED)算法;同时,分别基于交叉熵和离散傅里叶变换提出两种在每轮JCED迭代中自适应设置滑窗长度的快速算法.仿真结果表明,在无导频辅助的前提下,所提算法具有接近理想信道估计下置信传播译码的性能以及高效率、低复杂度、强鲁棒性和不导致错误平层等优点.     

Does the Performance of LDPC Codes Depend on the Channel?

In this letter, we discuss the performance of low-density parity-check (LDPC) codes on memoryless channels. Using a recently proposed analysis technique based on extrinsic information transfer (EXIT) charts, we present an interpretation of the known fact that the bit-error rate (BER) performance of an ensemble of LDPC codes shows little dependence on the specific memoryless channel. This result has been partially observed in the literature for symmetric channels and is here extended to asymmetric channels. We conjecture and demonstrate that the performance of an ensemble of LDPC codes depends primarily and solely on the mutual information (MI) between the input and the output of the channel. As a validation of this conjecture, we compare the performance of a few LDPC codes with various rates for five representative memoryless (both symmetric and asymmetric) channels, obtaining results in excellent agreement with the EXIT chart-based prediction     

Architecture of Generalized Bit-Flipping Decoding for High-Rate Non-binary LDPC Codes

A VLSI architecture for the generalized bit-flipping decoding algorithm for non-binary low-density parity-check codes is proposed in this paper. The tentative decoding steps of the algorithm have been modified to avoid computing and storing a matrix of dimension N×2 ^q , for a code (N,K) over GF(2 ^q ), reducing its complexity with a minimal penalization of its performance, less than 0.05 dB compared with the original algorithm. The architecture was synthesized using a 90 nm standard cell library, for the (837,723) non-binary code over GF(2⁵), requiring 590220 xor gates and achieving a throughput of 89 Mbps. Additionally, it was implemented in a Virtex-VI FPGA device with a cost of 4070 slices and a throughput of 44.6 Mbps.     

MLC存储信道下的双层LDPC码优化设计

大数据及云存储的发展对传统的存储技术提出了更高的要求。为了进一步提升多级存储单元的存储效率,提出了一种双层低密度奇偶校验(Low-Density Parity-Check, LDPC)码的优化设计方法。该方法针对多层单元(Multi-level Cell, MLC)信道的非对称性特性,对存储单元的单页添加额外校验比特以提高存储单元闪存信道的译码性能,并对单层LDPC码和本算法的性能进行了分析。仿真结果表明,在多级存储单元信道中使用BP译码算法进行译码,误码率为10^-5时,基于双层LDPC码构造的纠错码算法比单层LDPC码有约额外4 000次的擦除次数的提升,且译码复杂度也相应降低。     

High Robust Broadcasting over DTMB-A with Low-rate LDPC Codes

As the 2nd generation digital terrestrial television broadcasting(DTTB) standard, digital terrestrial/television multimedia broadcasting-advanced(DTMB-A) can provide higher spectrum efficiency and transmission reliability by adopting flexible frame structure and advanced forward error correction coding compared with the 1 st generation DTTB systems.In order to increase the flexibility and robustness of the DTTB network, the frequency reuse scheme of factor one(reuse-1) is proposed, where the sam...     

Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach

In the late 1950s and early 1960s, finite fields were successfully used to construct linear block codes, especially cyclic codes, with large minimum distances for hard-decision algebraic decoding, such as Bose-Chaudhuri-Hocquenghem (BCH) and Reed-Solomon (RS) codes. This paper shows that finite fields can also be successfully used to construct algebraic low-density parity-check (LDPC) codes for iterative soft-decision decoding. Methods of construction are presented. LDPC codes constructed by these methods are quasi-cyclic (QC) and they perform very well over the additive white Gaussian noise (AWGN), binary random, and burst erasure channels with iterative decoding in terms of bit-error probability, block-error probability, error-floor, and rate of decoding convergence, collectively. Particularly, they have low error floors. Since the codes are QC, they can be encoded using simple shift registers with linear complexity.     

在BIAWGN信道下规则LDPC码的设计与仿真分析

LDPC码是一种逼近香农限 ,实现容易 ,系统复杂度低的优秀的线性纠错码。奇偶校验矩阵 H是决定一个 LDPC码性能的关键。本文针对规则 LDPC码 ,提出了两种随机构造 H的方式 :行列都均匀的 evenboth和仅列均匀的 evencol。通过仿真分析发现 ,由 evenboth方式生成的规则 LDPC码性能更好。本文还对规则 LDPC码与卷积码的性能进行了对比 ,证明了规则 LDPC码在中短帧传输下的优异性能。这对 LDPC码投入实际应用具有重要的意义