改善LT码性能的预译码集优化方法研究

喷泉码是第一种与码率无关的编码方式.LT码是在删除信道下性能优异的稀疏随机线性喷泉码.与传统编码相比,大大降低了编译码的复杂度.通过分析影响LT码性能的预译码集,提出了优化LT码预译码集的方法.主要在编码端改变初始预译码集大小以及修改度为2的生成矩阵,在译码端利用编码冗余情况来破解译码停止集,同时消除短环.大量的数据仿真结果表明本文方法对译码性能有明显的改善.     

LT码的增强型BP译码算法

传统的LT码采用的BP译码算法,当不存在度1编码分组时会导致BP译码算法失败,不能继续译码.为了提高译码的成功率,分析了剩余编码分组的结构,提出LT码的再次译码算法(Again Belief Propagation decoding algorithm,ABP).算法主要思想是BP译码失败后,查找满足条件的可译结构,继续译码,直到译码成功或再次失败,如果失败重复上面步骤直到译码成功或可译结构不存在,从理论上分析了可译结构存在的概率.仿真结果显示译码成功率得到提高.     

基于反馈的Raptor码的编码算法研究

当通信系统允许反馈时,除用反馈控制信息的传输外,还可用于调整喷泉码的编码,提高整体的编译码性能。文章针对Raptor码的码长分别为短码和中长码时,研究如何利用反馈来调整Raptor码的编码算法,并给出了两种不同的编码算法。仿真结果表明,与原来的编码算法相比,提出的两种算法均明显减小了译码开销,提高了译码效率。     

LT码的一种非阶梯化高斯消元译码算法

LT码是一种应用于删除信道上的编码方法,使用BP译码算法,译码复杂度低但译码开销较大,而高斯消元译码算法可以实现最低译码开销。提出了一种非阶梯化低复杂度的高斯消元方法,当BP译码遇到停止集时,对当前的生成矩阵进行高斯消元,使得简化后的矩阵能够有再次进行BP译码的可能。给出了算法的具体步骤,通过仿真,表明了该算法在保持低开销的同时,相比原始的高斯消元算法,大大减小了复杂度。。     

LDPC短码的编译码研究

这里研究了原模图LDPC码和BP译码算法,首先提出了一种基于PEG算法构造原模图LDPC码的算法,该码字在码率为1/2,码长256比特的情况下,译码性能超过了PEG算法,然后针对LDPC短码不可避免存在四环的特殊性,提出了一种修正四环中变量节点迭代信息的BP译码改进算法,使得具有四环的LDPC短码的译码性能得到较大提升。     

Fountain码编译码技术的研究

通过从Fountain码的其中一种LT码的度数分布入手进行分析,发现LT码易出现停止集.针对LT码的缺点分别将汉明码和RS码作为Fountain码的预编码对其进行了改进并仿真.仿真结果证明预编码可以降低停止集出现的概率.通过对Hamming-Founta in码和RS-Fountain的仿真对比表明RS-Fountain码具有更高的恢复能力.     

LT码的性能分析及仿真

LT码（Luby Transform Codes）属于喷泉码的其中一种,它是一类基于图的线性纠删码,其应用的信道环境是删除信道（BEC,Binary Erasure Channel）。这里主要介绍在二元删除信道模型下,LT码的4种度分布设计方法及,分析了短码长和长码长情况下的LT码在不同信道删除概率情况下的性能及比较。研究结果表明：在删除概率非常大的情况下,只要译码端接收到足够多的包都能以高概率译出原始数据包,只是产生的冗余度大,这里的结果将为系统选择不同参数的LT码提供参考。     

LDPC码BP译码算法研究

本文研究了LDPC码的译码。深入研究了概率域BP算法和LLRBP算法。通过计算机仿真,比较了不同码长和不同迭代次数对译码性能的影响。通过计算机仿真得到在LDPC译码过程中,LDPC码的码字越长,构造的校验矩阵中短周期就越短,性能提高就越为明显。同时得到在LDPC译码过程中,迭代次数越多,各节点获得的信息的准确性就越高,性能提高就越为明显。     

LDPC码在BPSK通信系统中的性能分析

LDPC编码在长码条件下具有接近Shannon极限的纠错能力,但是译码较为复杂,因此分析LDPC编码在短码条件下的编译码性能对于扩大LDPC编码的应用范围,降低译码设备的复杂度有着重要的意义。针对较短LDPC编码情况下的判决译码在BPSK系统中的应用,对基于BP算法的几种软判决译码算法进行了介绍,对算法在BPSK系统中的译码性能进行了仿真,仿真结果表明:基于对数测度的BP算法在LDPC短码条件下有着优良的译码性能,能够有效降低通信系统中编译码的复杂度。     

基于IBED和仿生算法的LT码度分布设计

度分布是影响Luby变换（Luby transform,LT）码性能优劣的关键因素,为了得到更优的度分布,提出一种基于改进的二进制指数分布（improved binary exponential distribution,IBED）和仿生算法的LT码度分布设计方案.采用IBED度分布进行LT编码,初始译码成功率可高达90%以上,但随着译码开销增大,译码成功率上升速度减缓,而此时鲁棒孤子分布（robust soliton distribution,RSD）的译码性能表现更佳.为了将IBED和RSD的优点有机结合,利用人工鱼群算法（artificial fish swarm algorithm,AFSA）在两种度分布间寻优,基于期望可译集构建该算法的目标函数,通过最大化目标值得到更优的度分布.仿真结果表明,与类似方法及传统的RSD相比,采用新度分布进行LT编码可明显降低译码开销,并节约编译码耗时.     

Turbo encoding and decoding of Reed-Solomon codes through binary decomposition and self-concatenation

This paper presents a two-stage turbo-coding scheme for Reed-Solomon (RS) codes through binary decomposition and self-concatenation. In this scheme, the binary image of an RS code over GF(2/sup m/) is first decomposed into a set of binary component codes with relatively small trellis complexities. Then the RS code is formatted as a self-concatenated code with itself as the outer code and the binary component codes as the inner codes in a turbo-coding arrangement. In decoding, the inner codes are decoded with turbo decoding and the outer code is decoded with either an algebraic decoding algorithm or a reliability-based decoding algorithm. The outer and inner decoders interact during each decoding iteration. For RS codes of lengths up to 255, the proposed two-stage coding scheme is practically implementable and provides a significant coding gain over conventional algebraic and reliability-based decoding algorithms.     

Probabilistic construction of large constraint length trellis codesfor sequential decoding

Probabilistic algorithms are given for constructing good large constraint length trellis codes for use with sequential decoding that can achieve the channel cutoff rate bound at a bit error rate (BER) of 10^-5-10^-6. The algorithms are motivated by the random coding principle that an arbitrary selection of code symbols will produce a good code with high probability. One algorithm begins by choosing a relatively small set of codes randomly. The error performance of each of these codes is evaluated using sequential decoding and the code with the best performance among the chosen set is retained. Another algorithm treats the code construction as a combinatorial optimization problem and uses simulated annealing to direct the code search. Trellis codes for 8 PSK and 16 QAM constellations with constraint lengths v up to 20 are obtained. Simulation results with sequential decoding show that these codes reach the channel cutoff rate bound at a BER of 10^-5-10^-6 and achieve 5.0-6.35 dB real coding gains over uncoded systems with the same spectral efficiency and up to 2.0 dB real coding gains over 64 state trellis codes using Viterbi decoding     

基于MSK和LT码的联合迭代译码算法

传统的简单级联编码调制系统在译码时会造成软信息损失.提出了一种基于MSK和LT码的联合软迭代译码算法,设计了算法的系统模型.利用LT码的软译码和MSK调制的SISO算法,进行联合软迭代译码,提高了编码调制系统的性能.仿真结果表明:在误码率为10-4时,提出的算法比传统的简单级联编码调制算法约有1.5 dB的编码增益.     

New stopping criteria for iterative decoding of LDPC codes in H‐ARQ systems

Under severely unreliable channel, decoding of error‐correcting codes frequently fails, which requires a lot of computational complexity, especially, in the iterative decoding algorithm. In hybrid automatic repeat request systems, most of computation power is wasted on failed decoding if a codeword is retransmitted many times. Therefore, early stopping of iterative decoding needs to be adopted. In this paper, we propose a new stopping algorithm of iterative belief propagation decoding for low‐density parity‐check codes, which is effective on both high and low signal‐to‐noise ratio ranges and scalable to variable code rate and length. The proposed stopping algorithm combines several good stopping criteria. Each criterion is extremely simple and will not be a burden to the overall system. With the proposed stopping algorithm, it is shown via numerical analysis that the decoding complexity of hybrid automatic repeat request system with adaptive modulation and coding scheme can be fairly reduced. Copyright © 2012 John Wiley & Sons, Ltd.     

Results on the Improved Decoding Algorithm for Low-Density Parity-Check Codes Over the Binary Erasure Channel

In this correspondence, we first investigate some analytical aspects of the recently proposed improved decoding algorithm for low-density parity-check (LDPC) codes over the binary erasure channel (BEC). We derive a necessary and sufficient condition for the improved decoding algorithm to successfully complete decoding when the decoder is initialized to guess a predetermined number of guesses after the standard message-passing terminates at a stopping set. Furthermore, we present improved bounds on the number of bits to be guessed for successful completion of the decoding process when a stopping set is encountered. Under suitable conditions, we derive a lower bound on the number of iterations to be performed for complete decoding of the stopping set. We then present a superior, novel improved decoding algorithm for LDPC codes over the binary erasure channel (BEC). The proposed algorithm combines the observation that a considerable fraction of unsatisfied check nodes in the neighborhood of a stopping set are of degree two, and the concept of guessing bits to perform simple and intuitive graph-theoretic manipulations on the Tanner graph. The proposed decoding algorithm has a complexity similar to previous improved decoding algorithms. Finally, we present simulation results of short-length codes over BEC that demonstrate the superiority of our algorithm over previous improved decoding algorithms for a wide range of bit error rates     

On list sequence turbo decoding

An algorithm for decoding Turbo codes that combines conventional Turbo decoding and list sequence maximum a posteriori probability decoding is presented and evaluated. Compared to previous results on this theme, performance improvements in the order of 0.7 dB are obtained for Turbo codes with 514-b pseudorandom interleaving at a frame error rate of 10/sup -4/ on the additive white Gaussian noise channel.     

基于停止集的喷泉编码有限长性能估计

喷泉编码是一类基于删除信道、面向数据分组的前向纠错编码技术。该文分析了停止集的尺度分布对固定码率喷泉编码解码性能的影响,提出了一种估算低误码条件下喷泉编码有限长性能的方法以及一种低复杂度的停止集尺度分布搜索算法。比较结果表明,该文给出的喷泉码解码性能上下界与实际仿真结果非常接近。     

基于纠错算术码的信源信道自适应联合编解码系统

对信源信道自适应联合编码方法进行了研究,提出了一种新的基于纠错算术码的联合信源信道编解码系统。该系统在编码端利用算术码内嵌禁用符号实现信源信道一体式编码,即利用马尔科夫信源模型和根据信道状态信息自适应地调整禁用符号概率大小从而调整编码码率来实现信道自适应;在解码端,推导出了基于MAP的解码测度数学公式并基于此测度公式提出了一种改进的堆栈序列估计算法。与传统的信道自适应编码算法不同,该自适应编码算法只需调整一个参数:禁用符号,且理论上可获得连续可变的编码码率。实验结果表明,与经典的Grangetto联合编码系统以及分离编码系统相比,所提出的编码系统具有明显改善的性能增益。     

Non-sequential decoding algorithm for hard iterative turbo product codes - [transactions letters]

In this letter, we propose a new decoding algorithm to improve the bit error rate performance of the hard-input hard-output (HIHO) turbo product codes (TPC) with hard iterative decoding. The proposed algorithm iteratively, but not sequentially, decodes the received TPC blocks based on the reliability of the constituent codes. Simulation results confirm a noticeable coding gain improvement using the proposed decoding process with respect to standard HIHO TPC decoding. An efficient implementation of the new technique offers a negligible additional complexity when the channel-bit error probability is less than 10^?2.