Efficient unequal error protection for online fountain codes

In this paper,an efficient unequal error protection(UEP)scheme for online fountain codes is proposed.In the buildup phase,the traversing-selection strategy is proposed to select the most important symbols(MIS).Then,in the completion phase,the weighted-selection strategy is applied to provide low overhead.The performance of the proposed scheme is analyzed and compared with the existing UEP online fountain scheme.Simulation results show that in terms of MIS and the least important symbols(LIS),when the bit error ratio is 10-4,the proposed scheme can achieve 85%and 31.58%overhead reduction,respectively.

A NOVEL APPROACH OF LIMITED-RANDOMNESS FOUNTAIN CODES IN DEEP SPACE COMMUNICATION

Digital fountain is applied into deep space communication for its rateless and non-feedback forward error correction.However,the long code length and encoding overhead are confined factors to guarantee a considerable recovery probability as power and buffer-limited equipment in deep space environment.At the same time,the typical fountain decoding is sub-optimum decoding algorithm.We propose a new approach,Dependent Sequences Compensation Algorithm(DSCA),to improve the encoding efficiency by restricting the randomness in fountain encoding.While decoding algorithm is also optimized by redundant information in stopping set.The results show that the optimized method can obtain a 10-4 decoding failure rate with overhead under 0.20 for code length 500,which indicates the usefulness of the proposed approach in deep space communication.

Joint Network and Fountain Codes Design for RelayAssisted Multi-User System

In relay-assisted multi-user system, relay coding is important to enhance the robustness and reliability of cooperative transmission. For better adaptability and efficiency, two joint network and fountain coding(JNFC) schemes are proposed. When the condition of all direct channels is worse, JNFC scheme based on distributed LT(DLT) codes is used. Otherwise, JNFC scheme based on multi-dimensional LT(MD-LT) codes is suited. For both two above-mentioned schemes, the united degree distribution design method for short-length fountain codes is proposed. For the latter scheme, MD-LT codes are proposed for equal error protection(EEP) of each user. Simulation results and analysis show that the united degree distribution need less decoding overhead compared with other degree distribution for short-length fountain codes. And then, all users are protected equally in despite of asymmetric uplinks.

Novel joint encoding/decoding algorithms of fountain codes for underwater acoustic communication

Fountain codes are considered to be a promising coding technique in underwater acoustic communication（UAC） which is challenged with the unique propagation features of the underwater acoustic channel and the harsh marine environment. And Luby transform（LT） codes are the first codes fully realizing the digital fountain concept. However, in conventional LT encoding/decoding algorithms, due to the imperfect coverage（IC） of input symbols and short cycles in the generator matrix, stopping sets would occur and terminate the decoding. Thus, the recovery probability is reduced,high coding overhead is required and decoding delay is increased.These issues would be disadvantages while applying LT codes in underwater acoustic communication. Aimed at solving those issues, novel encoding/decoding algorithms are proposed. First,a doping and non-uniform selecting（DNS） encoding algorithm is proposed to solve the IC and the generation of short cycles problems. And this can reduce the probability of stopping sets occur during decoding. Second, a hybrid on the fly Gaussian elimination and belief propagation（OFG-BP） decoding algorithm is designed to reduce the decoding delay and efficiently utilize the information of stopping sets. Comparisons via Monte Carlo simulation confirm that the proposed schemes could achieve better overall decoding performances in comparison with conventional schemes.

A Feedback Scheme for Fountain Codes Based Transport Protocol in Space Communications

This paper proposed a practicalfeedback scheme for fountain codes based transportprotocol in space communications. In the proposed scheme,the sender is signaled by two types of acknowledgment(ACK) packets.Before decoding, packet loss probability isestimated on the receiver side and encapsulated intoa soft ACKand sent to the sender.After decoding,decoding results are encapsulated into hard ACKsandsent to the sender.There are two contributions in the proposed scheme: 1. Employing physical layer calculation instead of application layer statistics to estimate the packet loss probability of space channel, which can improvethe accuracy and practicality. 2. A cascade overhead-failure probabilityrelationship between the sender and the receiver has been analyzed to help determine the exact numberof packetsneeded byfountain decoding.Simulations show that for space communications,compared with the existing space transport protocols, fountain codes based transport protocolwith the proposed schemecan not only ensure transmission reliability, but also greatly improvelink utilization.

Feedback-based unequal error protection fountain code over device-to-device broadcast

To enhance encoding efficiency, an unequal error protection （UEP） broadcast scheme based on one additional feedback is proposed. Different from the equal probability selection for source packets in traditional fountain encoding, the proposed scheme calculates the packet loss ratio （PLR） according to the feedback results in systematic broadcast phase （SBP） and then optimizes the selection probability for source packets to guarantee higher level error protection for those source packets with larger PLRs. Thus the amount of unnecessarily redundant encoded packets during encoding broadcast phase （EBP） is decreased significantly. Numerical results show that the proposed scheme can recover 60% more packets than the traditional non-feedback broadcast scheme at the ex- pense of tolerably only one feedback procedure.

A Novel Cooperative Multicast Scheme Based on Fountain Code

Multicast is an efficient way to support emerging multimedia services over wireless network. Fountain codes are used in multicast systems to enable a robust transmission without CSI feedback and ARQ. We propose a cooperative multicast scheme based on fountain code to improve the performance of multicast. The users are coordinated with each other to decode the message at different time slots within the data transmission of a multicast session. Speci?cally, we take the local channel state information (CSI) and the local residual energy information (REI) into consideration, and apply a relay-selection and power-allocation strategy in our cooperative multicast scheme to prolong the network lifetime, while keeping the transmission delay as low as possible. The simulation results show that the proposed scheme can achieve a good tradeoff between transmission delay and network lifetime.

DNA存储场景下的大小喷泉码模型设计

在DNA存储等应用场景中,传统喷泉码算法需要占用额外信道资源将源文件分组数目K传递给解码端。在实际应用中,虽然可以将K嵌入在每一个编码数据分组中进行传递,但这种做法会严重浪费信道的带宽。针对上述问题,提出了一种大小喷泉码模型,通过增加小喷泉码这一带外信道来优化关键参数的传递。小喷泉码将每个编码分组中有关参数K所占用空间的粒度降至1 bit,有效减少了带宽资源的消耗。此外,小喷泉码还能适应由于DNA存储介质不均匀所导致的编码序列不定长的限制条件,一定条件下甚至可以完全不占用额外信道带宽。

RaptorQ喷泉码编译码算法分析及优化

RaptorQ喷泉码是喷泉码的最新研究成果,理论分析和仿真验证表明,RaptorQ喷泉码是性能最好的喷泉码,同时也是编译码复杂度最高的喷泉码。针对RaptorQ喷泉码编译码复杂度高这一问题,以国际标准RFC6330所设计的RaptorQ码编译码流程为基础,提出一种RaptorQ编译码算法的优化版本。新的编译码流程通过固定生成矩阵的方式提前计算好生成矩阵并存储,方便随时调用;通过提前列变换的方式规避多次寻找标准行和高斯消去操作,以及通过去稀疏化的方式,减少编译码过程中的矩阵乘法和异或运算。仿真比较优化前后的编译码算法,结果表明,优化后的RaptorQ码编译码流程能够在保证传输性能不变的同时,减少RaptorQ喷泉码编译码基本运算次数、缩短RaptorQ喷泉码编译码的时间,降低了编译码的计算复杂度,并保持了传输性能。

一种规则变量节点度LT Codes编码方案

LT Codes差错平台(Erasure Floor)由变量节点的最小度决定,规则变量节点度LT Codes能够最大化变量节点的最小度,从而降低LT Codes的差错平台.该文提出一种新的规则变量节点度LT Codes编码方法,该编码方法省去了现有方法中对变量节点度值查找表的排序操作,降低了现有方案的编码复杂度;通过对度分布的修正增加低度校验节点,使得规则变量节点度LT Codes解码瀑布区域(雪崩区域)提前.仿真结果表明该文方法与现有方法相比有效减少了编码时间,降低了成功解码所需的平均传输开销,加快了误符号率收敛速度.

基于部分信息的SLT-LT联合码防窃听方案设计

近年来,信息的安全传输备受人们关注,现有的物理层安全技术从信息论的角度出发,将物理层安全编码与传输信道的动态物理特性进行结合,实现信息的保密传输。作为一种纠删码,LT(Luby transform)码由于其编码随机性、码率不固定等特性,使得窃听者不能直接从泄露的编码符号中得到有用信息,只要合法用户在窃听者之前接收到足够数量的编码符号,便可实现信息的安全传输。而作为一种转移LT(Shifted LT,SLT)码,SLT码能高效恢复信息的同时具有更小的译码开销。因此,我们将SLT码应用于Wyner降阶窃听信道模型进行研究,提出一种基于部分信息转移的SLT-LT联合码防窃听方案,信源利用接收者已知的部分信息对度分布进行调整,并对信源符号进行SLT-LT码级联编码。由于窃听信道是合法信道的降阶信道,因此外在的窃听者截获到的消息符号是合法接收者的降阶版本,在相同时间内,合法接收者能够收到更多消息符号,随着编解码过程的不断进行,合法接收者的优势不断累积,能够优先完成解码,而度分布的调整以及级联编码方案使得编码符号的平均度进一步增大,窃听者难以完成解码,进一步降低了窃听者译出率;之后,对所提方案的编解码性能以及安全性进行理论分析,并通过实验仿真进行验证,仿真结果表明,与其他防窃听LT方案相比,本文所提方案仅增加少量的译码开销但具有更好的安全性能。

Fountain码编译码算法结构的改进

在LT码的基础上对Raptor码进行了分析。根据IRA码的结构及其线性时间的编译码特性,提出了Raptor码和IRA码相结合的改进Fountain码结构。研究结果表明,该结构既保持了线性的编译码特性又能有效增强信元的恢复能力。利用其它编码技术与Raptor码相结合是今后进一步的研究方向。

基于混沌系统和喷泉码的DNA加密编码方法

在这个海量数据时代,DNA是一种很好的新信息存储媒介。与传统的物理存储介质相比,它具有能耗低、存储密度高、存储寿命长等固有的优点。随着DNA存储技术的快速发展,如何保障新技术下的信息安全至关重要。为此,该文结合加密领域研究和DNA编码领域研究,提出了一种基于混沌系统和喷泉码的DNA加密编码方法,利用混沌系统加密原理,在DNA喷泉码编码过程中进行加密,在保留DNA喷泉码特性的同时,保障了编码信息的安全性。该方法可用于任意类型数据,可实现高信息密度和任意约束条件的DNA编码。同时,通过仿真实验证明,该方法可以有效抵抗多种密码学攻击,并对DNA存储过程产生的数据错误有一定纠错能力。

面向6G高铁移动场景的R10编码传输方案

6G时代越来越多的智能应用将在高铁中部署,需要高铁移动网络提供可靠和高效的传输服务。然而,受高速移动影响,车-地通信链路呈现快时变特性,采用传统的信道估计、反馈机制难以有效跟踪链路的快速时变,因此高铁移动网络亟需高效的前向纠错无反馈传输方案。由于R10编码兼顾了喷泉码和系统码的优点,将其引入高铁移动场景,提出了一种基于R10编码的高速移动车-地编码传输方案。采用该方案,发送端编码过程加入结构化冗余信息结合特定编码规则生成并发送任意数量编码符号,而接收端只需要收集一定数量编码符号结合结构化冗余信息即可更精准地恢复原数据,因此可实现更低的误码率。仿真实验表明,所提方案与传统无需反馈编码传输方案相比误比特率大大降低。以Turbo码为例,误比特率降低了约13%。

Labview实现RS232协议FCS校验码运算

介绍了Labview7.0实现RS232C协议中的FCS校验码运算程序。

H．264四路视频编码FC传输系统的设计与实现

多路视频编码传输系统已经越来越广泛地应用到民用无人机航拍记录系统、视频监控、智能交通系统,以及机载航空领域。系统除了对视频压缩的效率和质量有较高的要求,传输速度也近乎要求零延迟。设计了一套嵌入式视频编码传输系统,采用H. 264编码标准和FC网络协议,设计了基于FPGA的硬件平台和软件架构,实现了性能良好的四路H. 264实时视频编码FC传输系统。设计成果已用于机载实时视频编码传输应用环境,具有重要的实用意义。

Performance Analysis and Parameter Optimizing Rules of LT Codes

As a new class of forward error correcting encoding algorithm,Luby Transform codes are suitable for the erasure channel environment based on the packet communication.The encoding,decoding algorithms and the implementation of LT codes are summarized in the paper.Meanwhile simulations of the ideal soliton distribution and robust soliton distribution are conducted to evaluate the performance of LT codes in terms of successful decoding probability,mean degree and decoding time over the erasure channel.The parameter optimization rules of LT codes are deeply discussed and proposed in the paper.The research results are of great practical importance for improving the real time performance in the erasure correction applications.

An optimized framework for degree distribution in LT codes based on power law

LT codes are practical realization of digital fountain codes, which provides the concept of rateless coding. In this scheme, encoded symbols are generated infinitely from k information symbols. Decoder uses only(1+α)k number of encoded symbols to recover the original information. The degree distribution function in the LT codes helps to generate a random graph also referred as tanner graph. The artifact of tanner graph is responsible for computational complexity and overhead in the LT codes. Intuitively, a well designed degree distribution can be used for an efficient implementation of LT codes. The degree distribution function is studied as a function of power law, and LT codes are classified into two different categories: SFLT and RLT codes. Also, two different degree distributions are proposed and analyzed for SFLT codes which guarantee optimal performance in terms of computational complexity and overhead.

Implementation of LT codes based on chaos

Fountain codes provide an efficient way to transfer information over erasure channels like the Internet. LT codes are the first codes fully realizing the digital fountain concept. They are asymptotically optimal rateless erasure codes with highly efficient encoding and decoding algorithms. In theory, for each encoding symbol of LT codes, its degree is randomly chosen according to a predetermined degree distribution, and its neighbours used to generate that encoding symbol are chosen uniformly at random. Practical implementation of LT codes usually realizes the randomness through pseudo-randomness number generator like linear congruential method. This paper applies the pseudo-randomness of chaotic sequence in the implementation of LT codes. Two Kent chaotic maps are used to determine the degree and neighbour（s） of each encoding symbol. It is shown that the implemented LT codes based on chaos perform better than the LT codes implemented by the traditional pseudo-randomness number generator.