删除信道 meaning in English
erasure channel
Examples
- Cascaded low - density erasure codes are based on sparse random bipartite graphs . very efficient linear time encoding and erasure recover algorithms with the arbitrarily near erasure channel capacity performance of the codes with respect to the algorithms have made them one of the most optimal coding techniques up to now
基于稀疏随机二部图的级联型低密度纠删码因其线性时间的编译码算法和可任意逼近删除信道容量限而成为目前最佳编码技术之一。 - The principles of erasure codes used under binary erasure channels are summarized and erasure codes which belong to standard classes of rs codes are introduced with emphasis on cascaded low - density erasure codes with linear time encoding and erasure recover algorithms . thresholds of regular degree distributions are analyzed . it is shown that low - density erasure codes based on ( d , 2d ) - regular sequences of degree distribution are not close to optimal ( d 3 ) . two pares of irregular degree distribution sequences are introduced and a pare of improved right regular sequences of low - density erasure codes are presented , it is testified that the new sequences are asymptotically quasi - optimal . in the meantime , simulations of cascaded low - density erasure codes based on a few types of special sequences of degree distribution available are given , together with performance analyses on these codes
阐述了应用于删除信道下的纠删码基本原理，介绍了两类标准的rs码类纠删码，重点分析了具有线性时间编码和恢复算法的渐近好码?级联型低密度纠删码，分析了正则度分布的阈值，对正则低密度校验码在删除信道下的纠错性能进行了仿真，从理论上证明了基于( d ， 2d ) -正则度序列的低密度纠删码都不是渐近最优码( d 3 ) ，同时还分析了非正则低密度校验码的度序列设计，基于右边正则序列提出了一种改进型右边正则序列，证明了此序列为渐近拟最优的，对基于几类现有典型度分布序列的级联型低密度纠删码进行了模拟仿真及性能分析； 3 - In this dissertation , the basic principles of the coding and decoding of ldpc codes are studied systematically , and some code - design problems such as the design of degree distribution sequences , the design of girths and the design of efficient encode - able ldpc codes are analyzed in detail . based on all these efforts , some positive results are obtained and summarized as follow : 1
本文在对低密度校验码现有理论的研究基础上，系统地分析了低密度校验码在删除信道下的纠错性能和度序列设计、低密度校验码的围长设计和快速编码设计等编码设计问题，获得了一些研究成果，主要概括为： 1 - In this paper , we study the stopping sets , stopping distance and stopping redundancy for binary linear codes . stopping redundancy is a new concept proposed by schwartz and vardy recently for evaluating the performance of a linear code under iterative decoding over a binary erasure channel . since the exact value of stopping redundancy is difficult to obtain in general , good lower and upper bounds are important
近年来，迭代译码的性能分析是低密度校验ldpc码研究领域的热点问题之一， di等人在2001年指出：迭代译码在二元删除信道bec中的性能可以由ldpc码的停止集stopping set完全刻画。