LT码的性能分析及仿真

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

范德蒙阵列纠删码在嵌入式系统中的应用

针对范德蒙阵列纠删码算法,介绍了纠删码编译码过程,重点论述了范德蒙码编码算法和译码算法,提出了适合在嵌入式系统实现时的快速算法;在Matlab软件中构建了数字卫星广播系统(DVB-S)模型并进行了信道误码分布仿真,获得了DVB-S系统的误码分布,分析了在系统中使用范德蒙纠删码的可行性;提出了纠删码与系统中的纠错码级联使用模型,并对算法的纠错性能进行仿真,仿真结果表明级联模型能大大提高无线传输系统的可靠性。     

基于XOR纠删码的性能分析

基于异或的纠删码有一个不规则结构,这个结构可能允许它以汉明码码距或者超过汉明码码距的码距容错。为了能够完全描述基于异或纠删码的容错情况,本文提出一种基于异或纠删码的容错机制：最小删除列表。相对于其他基于异或纠删码的容错机制,最小纠删列表是一种有效机制。在本文我们还给出了一种有效确定纠删码的最小删除列表的算法。这个算法使用纠删码的结构去有效确定最小删除列表。试验结果表明,对于给定的纠删码,有超过最小删除列表数目的100倍的删除数目。     

分布式无标度LT码

LT码是喷泉码的一种,在删除信道中性能优越,分布式喷泉码多信源多中继的特性适合用于深空通信中。无标度网络（SF network）具有平均路径（APL）长最小的特性,非常适合喷泉码的度分布设计需求。首先介绍了LT码的编译码算法,然后对无标度网络和基于无标度网络的SF-LT码度分布设计进行了详细分析和优化,最后在删除信道条件下,选取码长较短、删除概率较小的情形对分布式二信源SF-LT码进行仿真分析,仿真结果表明,与LT码相比,分布式SF-LT码具有更好的性能。     

RS-LT级联码在无线图像传输中的应用

提出了一种应用于无线图像传输的RS-LT级联编码方法。分析了RS-LT级联编码相对传统LT码在提高可译码概率方面的优点。仿真结果表明,本方法提高了LT码在相同编码冗余度下的可译码概率,降低了LT码在一定可译码概率下的编码冗余度要求。在较强干扰环境下,应用RS-LT级联码方法,可以提供无线图像传输的"断点"续传机制,可显著提高无线图像传输抗干扰能力。     

短长度分布式喷泉码的性能分析

LT码是喷泉码的一种,由于深空通信不能实现反馈,距离远,变时延的传输特性,LT码适合用于深空通信中,由于传统的单信源通信已经不能满足当前的通信需求,多信源多中继通信系统成为了研究的重点。介绍了短长度分布式二、四信源的通信模型,以及各自的度分布,并选取了码长较短、删除概率较小这几种情形通过仿真验证了各自的性能。仿真结果表明,二、四信源分布式LT码比LT码有更好的性能。     

光通信系统级联码的仿真研究

随着光通信技术向更长距离、更大容量和更高速度的进一步发展,有必要深入研究性能更好的FEC码型方案。在光通信应用的众多FEC码型中,级联码具有短码的复杂度和长码的性能,具有极强的纠突发和纠随机错误的能力,是光通信系统中高效编码的主要研究对象。文中主要对RS-BCH型级联码进行了理论分析及建模仿真,与一般循环码相比该级联码纠错性能优良、冗余度适中、易于实现,更适用于高速光通信系统。     

关于纠删码的研究与进展

该文简述了几类纠删码的纠删原理,系统地综合分析了各类纠删码的优缺点及其相互区别与联系,证明了若选取MDS(Maximal Distance Separable)码作为纠删码,只要接收者接收到源数据个数的数据,就能恢复原来的源数据。分析结果表明:复损码以及旋风(Tornado)码不仅能以线性时间可编码和可成功地译码,而且能以任意接近删除信道容量的速率进行传输,最后指出了目前复损码的研究中需要解决的一些问题,这些分析和结论为进一步研究纠删码提供了理论基础和新的思路。     

光通信系统中交织型级联码性能的研究

对光通信系统中单级型级联码和交织型级联码的纠错性能进行理论研究与仿真分析后表明:交织型级联码的纠错性能与单级型级联码基本相当,与经典的RS(255,239)码型相比,其净编码增益(NCG)大得多,纠错性能有很大的提升;交织型级联码的冗余度比单级型级联码要低得多,并且还具有比单级型级联码更强的纠突发差错能力。因而交织型级联码更适合光通信系统的实际应用要求。     

LT码在深空通信中的应用研究

深空通信具有时延长、误码率大、链路易中断等特点,链路中断将导致数据不可恢复的丢失。针对深空通信误码率大、数据易丢失等特点,对LT(Luby Transform)码与LDPC/TPC码的级联进行了研究,描述了喷泉码的原理和主要实现方法,给出了LT码与LDPC/TPC码的级联方法及Matlab仿真分析结果,实现了LT码与LDPC/TPC码的级联编解码,并通过设计闪断试验测试了级联码的性能,给出了分析结果,以期为深空通信数据的获得提供更为可靠的解决方案。     

分布式分级保护LT码

LT码是喷泉码的一种,它是线型无速率码,在删除信道中性能优越。数据传输中有一些数据相对来说可能更重要,在这样的传输模型中,对于关键信息的保护显的尤为重要。基于此目的提出了一种分布式LT码多信源节点信息的保护措施,分级保护LT码是通过改进每个节点的度为1和2的数据包的原始数据包的选择以提高整个码字的性能,在此基础上引入分布式模型,使得得到的分布式分级保护码字结合了分布式LT码和分级保护LT码的双重优点。     

Decomposed LT Codes for Cooperative Communications

In order to reduce computation complexity and latency in cooperative communication system based on fountain code, a decomposed LT codes (DLT) based cooperative transmission scheme was proposed. The scheme comprises of two layers of random encoding but only a single layer of decoding. A general decomposition technique for the decomposed LT codes construction is developed. The transmission latency for the proposed scheme was analyzed. Simulation results show that the total time consumed under the proposed scheme can be significantly reduced compared to direct transmission and conventional cooperative transmission based on LT codes in the medium to high packet erasure rate regimes. Moreover, With the increase of packet erasure rate, the advantage of the proposed scheme is more evident.     

Asymptotic performance comparison of concatenated (turbo) codes over GF(4)

In this paper, we investigate and compare the asymptotic performance of concatenated convolutional coding schemes over GF(4) over additive white Gaussian noise (AWGN) channels. Both parallel concatenated codes (PCC) and serial concatenated codes (SCC) are considered. We construct such codes using optimal non‐binary convolutional codes where optimality is in the sense of achieving the largest minimum distance for a fixed number of encoder states. Code rates of the form k₀/(k₀ + 1) for k₀=1, 8, and 64 are considered, which suite a wide spectrum of communications applications. For all of these code rates, we find the minimum distance and the corresponding multiplicity for both concatenated code systems. This is accomplished by feeding the encoder with all possible weight‐two and weight‐three input information patterns and monitoring, at the output of the encoder, the weight of the corresponding codewords and their multiplicity. Our analytical results indicate that the SCC codes considerably outperform their counterpart PCC codes at a much lower complexity. Inspired by the superiority of SCC codes, we also discuss a mathematical approach for analysing such codes, leading to a more comprehensive analysis and allowing for further improvement in performance by giving insights on designing a proper interleaver that is capable of eliminating the dominant error patterns. Copyright © 2004 John Wiley & Sons, Ltd.     

部分系统Turbo码的研究

对一种码率为1／2的部分系统turbo码性能进行了讨论。它是通过对码率为1／3的turbo码的校验位和信息位进行删余得到的。这种码的“误码下限”（error-floor）比对应的系统码要低。因此,码率为1／2的turbo码,在没有增加编码和译码复杂性的情况下,通过简单地对信息位和校验位的删除可以提高性能。     

A new high rate code scheme with highly parallel and low complexity decoding algorithm

A new high rate code scheme is proposed in this paper. It consists of serial concatenated recursive systematic ordinary (nonpunctured) convolutional codes with only 8 states in the trellis of the corresponding reciprocal dual codes. With a low complexity and highly parallel decoding algorithm, over additive white Gaussian noise channels, the proposed codes can achieve good bit error rate (BER) performance comparable to that of turbo codes and low density parity check (LDPC) codes. At code rate R=16/17, the overall decoding complexity of the proposed code scheme is almost half that of the LDPC codes.     

Progressive transmission of images over memoryless noisy channels

An embedded source code allows the decoder to reconstruct the source progressively from the prefixes of a single bit stream. It is desirable to design joint source-channel coding schemes which retain the capability of progressive reconstruction in the presence of channel noise or packet loss. Here, we address the problem of joint source-channel coding of images for progressive transmission over memoryless bit error or packet erasure channels. We develop a framework for encoding based on embedded source codes and embedded error correcting and error detecting channel codes. For a target transmission rate, we provide solutions and an algorithm for the design of optimal unequal error/erasure protection. Three performance measures are considered: the average distortion, the average peak signal-to-noise ratio, and the average useful source coding rate. Under the assumption of rate compatibility of the underlying channel codes, we provide necessary conditions for progressive transmission of joint source-channel codes. We also show that the unequal error/erasure protection policies that maximize the average useful source coding rate allow progressive transmission with optimal unequal protection at a number of intermediate rates     

无速率编码及其应用综述

纠错编码技术通过引入冗余增加可靠性,是现代通信的关键技术之一。无速率编码是一类新兴纠错编码,其速率可以根据信道状态自适应改变,编译码算法较为简单,且性能优异,可以适用于不同的应用场景,因此受到了国内外学者和工业界的关注。介绍了4种经典或新兴的无速率编码方案,包括卢比变换(Luby Transform,LT)码、Raptor码、在线喷泉码(OFC)和BATS(Batched Sparse)码。介绍无速率编码的基本原理,通过其发展过程比较不同无速率编码的特点。阐述了这些无速率编码的编译码方法,并简要介绍其最新的研究进展。最后,介绍无速率编码在广播通信及不等差保护、无线传感器网络、车联网、存储以及分布式计算等新老场景中的应用。无速率编码是一种复杂度低、灵活度高的编码,随着新型无速率编码的发展,在未来的分布式系统等场景中将会有更广泛的应用。     

Concatenated coding with inner trellis codes for fading channels

It is known that concatenated coding can significantly enhance the performance of digital communication systems operating over fading channels when compared to uncoded or single-coded systems. The price to be paid for such an improvement, however, is a substantial increase in the required bandwidth. In this paper, we consider the use of a concatenation scheme in which the inner code is a trellis-coded modulation (TCM) system. The analysis is carried out for two different outer codes: a binary Golay code and a non-binary Reed-Solomon code. Results obtained for the Rayleigh and Rician fading channels through analytical bounds indicate that the use of this system does provide a significant reduction in the bit error probability, a fact that is also verified through computer simulation. Unlike a traditional concatenated system, the proposed method achieves the coding gain while maintaining acceptable bandwidth efficiency.