基于随机置换展开与停止集的LT码联合编译码算法

针对短码长LT码(码长在103以下)的随机编码方式,需要较高的编码冗余才能保证一定的译码性能的问题。设计了一种基于限制Tanner图连接边随机关系的随机置换展开编码算法,可以实现在较小编码冗余开销下提高短码长LT码的可译码概率。在此基础上,针对短码长LT码的传统BP译码算法效率不高的问题,充分利用BP算法译码失败的停止集剩余信息,设计了采用上述编码算法的短码长LT码的停止集高斯译码算法,可以获得接近最大似然译码的性能。仿真结果表明,所提出的编译码联合算法有效降低了短码长LT码满足10 4译码失败概率时所需的编码冗余开销。     

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

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

LT码编译码分析及改进

数字喷泉码是一类不受限的纠错码,即从原始数据分组编码产生的编码分组序列是无限的。通过研究数字喷泉码中译码终止的原因,得出在数字喷泉码中,译码终止是由于缺少度数为1的编码包,导致译码提前终止以至译码失败。注意到度数为2的编码包在整个编码包中占有很高的比例;因此,将数据包分成两组,在度数为2时,分别从两组中取出数据,这样可以有效地提高数据的覆盖率,降低译码提前终止的概率。通过对编码算法的改进,提高整个数字喷泉码的译码成功率。     

非系统RS(31,19)编译码算法研究与FPGA实现

针对战术数据链系统低时延数据传输需求,提出一种适用于数据链系统的信道编码方案—非系统缩短码RS(31,19)。本文从MS多项式的观点讨论了非系统RS码的编码和译码算法,并对缩短RS码的编译码算法进行了研究。最后在FPGAEP3SE110上采用了一种改进的BM算法,成功实现RS(31,19)编译码复杂算法,有效提高了译码速度,简化了数据链系统硬件设计。     

一种适用于LT码的选择编码算法

无速率码的出现为自适应数据传输提供了新途径。作为第一种实用的无速率码,LT码在高斯信道中的性能不佳,存在较高的误码平台。针对此问题,提出一种选择编码(SE)算法。SE算法按照度数值大小将信息节点分类成若干个集合,并通过控制编码过程使每个校验节点优先从小度数值节点集合中选取与之相连接的信息节点,从而消除了小度数值的信息节点,降低了LT码的误码平台。通过蒙特卡洛仿真得到不同条件下SE算法中信息节点的度分布,并利用外信息传递图法对SE算法及传统编码方法的收敛性进行对比分析,结果显示SE算法能够进一步拓宽译码通道,使误比特率更快趋近于0。此外,SE算法在给定范围信噪比及码率值条件下均能降低误码平台,当误比特率为10-5时,码长为512 bit的LT码可以得到近5 dB的性能改善。     

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

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

LT码的增强型BP译码算法

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

(16,12) RS缩短码编译码原理及性能分析

在各类数字通信系统以及计算机存储和运算系统经常利用差错控制编码降低误码率,提高通信质量,满足对数据传输通道可靠性的要求. RS 码是一种性能优良的前向纠错码,具有同时纠正随机错误和突发错误的能力,它的构造特点决定了其非常适合于纠正突发性错误.文中在阐述 RS 系统码编译码原理的基础上,提出了(16,12)RS 缩短码的编译码方法,利用 MATLAB 对(16,12)RS 缩短码在高斯信道和瑞利信道条件下的纠错能力进行仿真,并分析其纠错性能     

LT码新型度分布及其在电力线通信中的应用

Luby变换(Luby Transform,LT)码作为信道编码应用于电力线通信(Power Line Communication,PLC),可实现电信号的可靠传输。度分布对LT码编译码性能的影响至关重要。为了得到更优的度分布,首先调整二进制指数分布(Binary Exponential Distribution,BED)中的度数比例,获得一种译码性能更优的改进的二进制指数分布(Improved BED,IBED)。然后,根据IBED在冗余度较小时译码成功率高,而冗余度增大后鲁棒孤子分布(Robust Soliton Distribution,RSD)的译码性能表现更佳的特点,通过求和归一化的方式将IBED与RSD两种度分布的优势进行有机结合,提出一种新型二进制鲁棒孤子分布(Binary RSD,BRSD)。仿真结果表明,与其他方法及传统的RSD相比,采用新度分布进行LT编码,可明显降低译码开销,并节约编译码耗时。将新型度分布应用于基于LT码的PLC系统中,能有效地抑制PLC信道中各种噪声对电信号的干扰,并提高通信效率。     

基于改进高斯近似方法的LT码度数分布设计

高斯近似是一种用来分析基于Tanner图的信道编译码性能和进行度数分布设计的有效方法,但是在对LT码进行分析时,不能准确计算译码过程中的迭代消息.在此方法的基础上,结合LT码译码的特点,提出迭代盒的概念,对LT码的BP解码中的迭代消息密度函数进化过程进行分析.在LT码消息迭代模型基础上,运用微分演化方法对LT码的输出度数分布进行优化.仿真表明,经过度数分布优化的LT码的抗误码性能有了明显的提高.     

Degree distribution optimization for LT codes and its application in link maintenance of cognitive radio

The degree distribution has a great influence on the performance of Luby transform (LT) codes.Based on the link maintain model of cognitive radio system,the novel degree distribution of LT codes was obtained by using the THOA (two-layer hierarchical optimization algorithm) to combine the IPD (improved poisson distribution) which achieved high decoding success rate with low overhead and the robust soliton distribution (RSD) which achieved high decoding success rate with high overhead.Simulation results show that the proposed method with application to link maintenance in cognitive radio system can improve the reliability and efficiency of secondary communication.     

Decoding of LT‐Like Codes in the Absence of Degree‐One Code Symbols

Luby transform (LT) codes were the first practical rateless erasure codes proposed in the literature. The performances of these codes, which are iteratively decoded using belief propagation algorithms, depend on the degree distribution used to generate the coded symbols. The existence of degree‐one coded symbols is essential for the starting and continuation of the decoding process. The absence of a degree‐one coded symbol at any instant of an iterative decoding operation results in decoding failure. To alleviate this problem, we proposed a method used in the absence of a degree‐one code symbol to overcome a stuck decoding operation and its continuation. The simulation results show that the proposed approach provides a better performance than a conventional LT code and memory‐based robust soliton distributed LT code, as well as that of a Gaussian elimination assisted LT code, particularly for short data lengths.     

A novel rateless codes design scheme based on two‐stage encoding and forward equal probability

This paper proposes an ideal rateless codes model to comprehensively describe rateless codes and extends the definition of systematic linear block code to generalized systematic code. Under the proposed model, average delay, maximum disorder, and uniformity recovery entropy are introduced as performance indices to design efficient rateless codes. A novel coding scheme based on two‐stage encoding and forward equal probability is proposed to optimize the proposed indices. In the first stage, the first k symbols are encoded, aiming to improve the performance of order recovery, uniformity recovery, and transmission efficiency as much as possible. In the second stage, the remaining infinite symbols are encoded, where the symbols with high degree are used to compensate the symbols loss in the first stage. Simulation results show that the proposed scheme can achieve generalized systematic rateless codes with high probability and also has less average delay and maximum disorder, better capacity achievability, and uniformity recovery performance than Luby trasform (LT) codes and rateless coded symbol sorting algorithm. Besides, the proposed scheme has the aforementioned advantages compared with expending window fountain codes except for uniformity recovery and maximum disorder performance when the erasure rate is higher than about 0.25. Copyright © 2013 John Wiley & Sons, Ltd.     

Convolutional fountain distribution over fading wireless channels

Mobile broadband has opened the possibility of a rich variety of services to end users. Broadcast/multicast of multimedia data is one such service which can be used to deliver multimedia to multiple users economically. However, the radio channel poses serious challenges due to its time‐varying properties, resulting in each user experiencing different channel characteristics, independent of other users. Conventional methods of achieving reliability in communication, such as automatic repeat request and forward error correction do not scale well in a broadcast/multicast scenario over radio channels. Fountain codes, being rateless and information additive, overcome these problems. Although the design of fountain codes makes it possible to generate an infinite sequence of encoded symbols, the erroneous nature of radio channels mandates the need for protecting the fountain‐encoded symbols, so that the transmission is feasible. In this article, the performance of fountain codes in combination with convolutional codes, when used over radio channels, is presented. An investigation of various parameters, such as goodput, delay and buffer size requirements, pertaining to the performance of fountain codes in a multimedia broadcast/multicast environment is presented. Finally, a strategy for the use of ‘convolutional fountain’ over radio channels is also presented.     

Iterative decoding of codes over complex numbers for impulsive noise channels

We discuss the decoding of error-correcting block codes over complex numbers for the transmission over impulsive noise channels. The encoder multiplies a vector of complex information symbols resulting from a modulation scheme, e.g., quadrature amplitude modulation (QAM), with a unitary generator matrix G. Choosing the inverse Fourier transform as G, the encoding procedure is similar to orthogonal frequency-division multiplex (OFDM) modulation. The maximum a posteriori (MAP) receiver is analyzed and a suboptimum decoder based on the turbo decoding principle is derived. Simulation results show the excellent performance of the iterative decoder.     

A new multilevel coding method using error-correcting codes

A new multilevel coding method that uses several error-correcting codes is proposed. The transmission symbols are constructed by combining symbols of codewords of these codes. Usually, these codes are binary error-correcting codes and have different error-correcting capabilities. For various channels, efficient systems can be obtained by choosing these codes appropriately. Encoding and decoding procedures for this method are relatively simple compared with those of other multilevel coding methods. In addition, this method makes effective use of soft-decisions to improve the performance of decoding. The decoding error probability is analyzed for multiphase modulation, and numerical comparisons to other multilevel coding systems are made. When equally complex systems are compared, the new system is superior to other multilevel coding systems.     

LT码的性能分析及参数优化规则

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.     

BER Performance of Walsh–Hadamard Like Kronecker Product Codes in a DS-CDMA and Cognitive Underlay System

Walsh–Hadamard transform, a discrete unitary transform is widely used in many applications such as signature codes in the current wireless standards IS-95 CDMA, WCDMA, CDMA2000 and image transform applications. It is simple to implement this transform since they can be generated by a single Kronecker product recursion formula. In this paper, a new set of binary code families similar to Walsh codes are obtained based on the concept of code concatenation and permutation. It is shown that these codes can be generated by reconfiguring the Walsh–Hadamard code generator. Hence it can be utilized in reconfigurable radios such as underlay cognitive radio (UCR). Theoretical results showing the BER performance due to MAI between primary users and secondary users in an UCR is also obtained. Simulation results showing the BER performance of these codes in a direct sequence spread spectrum system and UCR system with quadrature multiplexing operating in the individual decoding mode under AWGN plus flat fading Rayleigh channel conditions is also obtained.     

基于FSO系统的多进制LT码性能分析

为克服空间光通信(FSO)链路受大气湍流效应的影响,将LT码应用到FSO系统中.多进制LT码具有较高的传输效率.提出一种新型度分布函数来改善多进制LT码的译码性能.计算不同进制LT码的译码失败率,并模拟强湍流信道,对采用不同编码方案的FSO性能进行仿真.结果表明:采用新型度分布的LT码能够降低译码失败率,且能有效改善FSO系统在强湍流情况下的性能.