不规则重复累积码的分析与仿真

本文主要研究非规则重复累积码(Irregular RepeatAccumulate,IRA码)的编译码原理。着重整理与实现了IRA码的编译码方法 ,对IRA码译码算法进行了研究。最后,对IRA码进行矩阵整理、仿真和分析,从而得出该码编译码性能以及相应的分析结果。     

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

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

Raptor码译码算法的改进方案

喷泉码是一类重要的纠删码,特别是Raptor码,由于其非固定码率、逼近信道容量、可以有效纠删等方面的内在特点,非常适合作为应用层FEC而使用到各类系统中。主要就Raptor码的译码算法展开深入的讨论,在介绍现有译码算法的基础上,提出了Raptor码译码算法的优化思路,它能更好的平衡译码失败率和译码计算复杂度两个指标之间的关系,以更好的适用于某些特定应用场景的需要。     

喷泉码及其在通信网络中的应用

喷泉码是一种新颖的信道编码技术,可有效应用于分组级前向纠删技术中。喷泉码可以由k个原始分组生成任意数量的编码分组,而只要收到其中任意k(1 ε)个编码分组,即可通过译码以高概率成功恢复全部原始分组。精心设计的喷泉码不仅具有很小的译码开销ε,而且具有简单的编译码方法和很小的编译码复杂度。本文介绍了喷泉码的基本概念和LT码、Raptor码等实用喷泉码,并且从单点对单点、单点对多点、多点对单点通信等三个方面阐述了喷泉码在通信网络中的应用。     

Fountain码译码的改进方法

Fountain码的无速率特性使得它可以在信道删除率未知的删除信道下高效传输信息。但是由于传统的Fountain码（主要是LT码和Raptor码）在译码过程中未对差异信息进行处理,丢失了部分可以被译出的信息,从而增加了译码代价。针对传统Fountain码这方面的缺点,提出一种利用消除度数为2的校验单元来处理差异信息的Fountain码译码的改进方法。仿真结果验证,采用该方法不但保证了Fountain码的无速率特性,而且提高了信息利用率和译码效率。     

IRA码最小和译码算法的改进算法

研究了重复累积(IRA)码的简化译码算法.IRA码的BP译码算法具有较高的复杂度,为了降低复杂度,首先提出将最小和算法应用于IRA码.然而,最小和算法使译码性能降低约1.2 dB.为了在复杂度和译码复杂度之间取得较好的折衷,提出了对IRA码的最小和算法的改进算法:归一化算法和偏移算法.仿真结果表明,IRA码归一化算法和偏移算法在复杂度略有增加的情况下,性能得到明显改善.     

Turbo码编译码技术研究

Turbo编码技术由于其优越的编译码性能在无线通信领域得到广泛地研究和应用。本文介绍了Turbo码的编码结构和译码原理,分析了各种参数对Turbo码性能的影响,并得出相关结论。     

基于RS码与Turbo码的纠错码特性研究

对两种重要实用的纠错码：RS和Turbo码从其特点、纠错能力、码率、编码复杂度、译码复杂度等方面做比较研究，以加深对这两种纠错码特性的认识，利于进一步研究和应用他们。指出RS码是最优线性分组码，实现电路简单，RS码的缺点是：延时较大，要求精确的帧同步，当信道条件比较差时，性能变差；Turbo码一般利用递推系统卷积码，通过交织器并联而成，他具有的优点是：延时短，译码算法能充分利用软判决，纠突发错误性能好，即使在信道条件较差时，仍有较好的纠错能力，Turbo码具有广阔的应用前景；Turbo码的编译码运算比RS码复杂，实现电路复杂，码率低。     

基于差分算法和Raptor码的广播通信应用研究

喷泉码由于译码开销低,编译码复杂度小,在卫星通信广播系统的业务中应用广泛。文章分析比较几种典型的数字喷泉码的编码方式,得出Raptor码性能更加优良,实际应用更加有效。通过减半差分算法和Raptor码的结合得出了一种方法使得文件传输在卫星通信广播系统中的应用变得更加有效。最后对喷泉码的发展远景进行了展望。     

基于级联码的信道编译码设计与FPGA实现

介绍了RS(255,223)码级联卷积(4,3,3)码编译码器的实现,对于编码和译码端不同的结构特点.分别采用并行和串行结构实现.其中RS译码采用欧几里德算法,卷积译码采用维特比算法.同时给出了该编译码器的FPGA实现,按照自上而下的设计流程,在保证速度的同时最大限度地减少了资源占用.     

译码转发中继系统基于校验分裂的IRA码设计

在译码转发中继系统中,非规则重复累积(IRA)码的设计本质是设计码率兼容IRA码.由于通过校验分裂得到的码字的不同部分经历不同的信噪比,因此给出了基于校验分裂的修正的高斯近似的密度进化算法来分析IRA码的门限并且用差分进化算法对其优化.实验仿真证明与传统的密度进化算法得到的IRA码相比,当误帧率是10~(-3)时,优化得到的码字大约有0.5dB的增益.     

Optimization and realization of SWIPT relay channel transmission rate based on rateless code

The optimization of the transmission rate and implementation of the simultaneous wireless information and power transfer in a relay system were studied.In a three-node two-hop system,the decode-and-forward protocol was employed by the relay node.One transmission period was divided into two phases.The first phase was the simultaneous transmission of the information and energy from the source to the relay.The received signal at the relay node was split to two parts.One part was used for information decoding,and the other was converted into energy for information forwarding in the second phase.In the second phase,the information was forwarded according to the decode-and-forward protocol by the relay.The power splitting factor was optimized to minimize the total time of the two hops for the transmission of a certain amount of information when the durations of the two hops were unequal.Furthermore,Raptor codes were combined with different modulation modes to realize different transmission rates on the two hops for the efficient utilization of the different channel capacities in the two hops.The selection mechanism of the codeword length of Raptor codes and modulation mode was given.The simulation proves that the two hops with unequal durations can achieve a higher throughput,and the capacity of the relay channel can be efficiently used by employing Raptor codes,and an efficient and reliable transmission is realized.     

IRA码在远程光纤通信系统中的应用

前向纠错码 (FEC)是光纤通信系统提高系统容量的一项关键技术。在远程光纤信道中 ,放大器自发辐射 (ASE)噪声是主要噪声源。FEC在光纤通信系统应用时 ,通常用高斯分布估计ASE噪声。本文提出用x平方律分布模型代替高斯信道模型 ,并将高性能的不规则重复累积 (IRA)码应用于远程光纤通信系统。仿真结果表明 :IRA码的性能优于RS码、Turbo码等 ,而且x平方律信道的性能优于高斯信道。     

Raptor codes

LT-codes are a new class of codes introduced by Luby for the purpose of scalable and fault-tolerant distribution of data over computer networks. In this paper, we introduce Raptor codes, an extension of LT-codes with linear time encoding and decoding. We will exhibit a class of universal Raptor codes: for a given integer k and any real epsiv>0, Raptor codes in this class produce a potentially infinite stream of symbols such that any subset of symbols of size k(1+epsiv) is sufficient to recover the original k symbols with high probability. Each output symbol is generated using O(log(1/epsiv)) operations, and the original symbols are recovered from the collected ones with O(klog(1/epsiv)) operations. We will also introduce novel techniques for the analysis of the error probability of the decoder for finite length Raptor codes. Moreover, we will introduce and analyze systematic versions of Raptor codes, i.e., versions in which the first output elements of the coding system coincide with the original k elements     

基于高斯近似的IRA码构造算法研究

介绍了非规则重复累积码(IRA)的结构,对其Tanner图和校验矩阵进行了分析。IRA码的构造分为优化度分布和设计奇偶校验矩阵2部分。在AWGN信道下,对给定的噪声方差,采用高斯近似的方法优化度分布并得出优化结果。根据度分布和相应规则设计奇偶校验矩阵,给出了设计步骤。对设计出的码进行计算机仿真,结果表明这类码相对于计算机随机构造的LDPC码能带来性能上的提高,且随码长增加,码的性能有明显改善。     

A modified design of Raptor codes for small message length

Wireless Networks - Raptor codes are a class of fountain codes which can get capacity-achieving performance over various channels. Traditional Raptor codes can obtain perfect performance for large...     

基于循环中国剩余定理和改进的PEG算法的IRA码

为了避免交织器产生的时延,通过改进的渐进边增长(PEG)算法和循环中国剩余定理构造了一种不规则重复累积(IRA)码.与常规的IRA码相比,提出的码字具有半随机半结构化形式,不需要设计交织器,且码长选择更加灵活.仿真结果显示,在码率为1/2的条件下,当误码率为10-6时,构造的IRA(1 000,500)码与PEG-IRA(1 000,500)码和基于剩余类数对的IRA(1 000,500)码相比,在对应的相同条件下分别取得了0.2 dB和0.1 dB左右的净编码增益提升;且在码率为3/4时,所构造的IRA(16 200,11 880)码比相同码长和码率的DVB-S2标准LDPC码净编码增益提高了约0.1 dB左右.     

Design methods for irregular repeat-accumulate codes

We optimize the random-like ensemble of irregular repeat-accumulate (IRA) codes for binary-input symmetric channels in the large block-length limit. Our optimization technique is based on approximating the evolution of the densities (DE) of the messages exchanged by the belief-propagation (BP) message-passing decoder by a one-dimensional dynamical system. In this way, the code ensemble optimization can be solved by linear programming. We propose four such DE approximation methods, and compare the performance of the obtained code ensembles over the binary-symmetric channel (BSC) and the binary-antipodal input additive white Gaussian noise channel (BIAWGNC). Our results clearly identify the best among the proposed methods and show that the IRA codes obtained by these methods are competitive with respect to the best known irregular low-density parity-check (LDPC) codes. In view of this and the very simple encoding structure of IRA codes, they emerge as attractive design choices.     

一种码长变化灵活的重复累加码构造方法

在一类非规则重复累加码优越的次数分布对基础上,利用准循环码原理设计了基校验矩阵,并进行了去四环优化,利用算法构建优化的低密度奇偶校验码,码长变化灵活,性能比优化前有明显提高,十分接近IEEE 802.16e标准规定的LDPC码性能,非常适合电视信号的传输。     

Scalable image and video transmission using irregular repeat-accumulate codes with fast algorithm for optimal unequal error protection

This paper considers designing and applying punctured irregular repeat-accumulate (IRA) codes for scalable image and video transmission over binary symmetric channels. IRA codes of different rates are obtained by puncturing the parity bits of a mother IRA code, which uses a systematic encoder. One of the main ideas presented here is the design of the mother code such that the entire set of higher rate codes obtained by puncturing are good. To find a good unequal error protection for embedded bit streams, we employ the fast joint source-channel coding algorithm in Hamzaoui et al. to minimize the expected end-to-end distortion. We test with two scalable image coders (SPIHT and JPEG-2000) and two scalable video coders (3-D SPIHT and H.26L-based PFGS). Simulations show better results with IRA codes than those reported in Banister et al. with JPEG-2000 and turbo codes. The IRA codes proposed here also have lower decoding complexity than the turbo codes used by Banister et al.