格状编码和RS码级连技术在HDTV中应用的性能模拟

设计一种用于ＨＤＴＶ地面数字传输系统的级连格状编码和ＲＳ码方案，并对其在ＨＤＴＶ中应用进行计算机模拟。模拟结果表明：该级连格状编码方案在低信噪比具有较好的误码性能。     

RS码频域纠错编码在激光对潜通信信道中的实现方法

介绍了信道编码在激光对潜通信系统中的重要作用，介绍了频域编译ＲＳ码的基本方法，并给出了脉冲位置调制信道的ＲＳ码频域编译码的计算机模拟方法和结果。     

Two new decoding algorithms for Reed-Solomon codes

The subject of decoding Reed-Solomon codes is considered. By reformulating the Berlekamp and Welch key equation and introducing new versions of this key equation, two new decoding algorithms for Reed-Solomon codes will be presented. The two new decoding algorithms are significant for three reasons. Firstly the new equations and algorithms represent a novel approach to the extensively researched problem of decoding Reed-Solomon codes. Secondly the algorithms have algorithmic and implementation complexity comparable to existing decoding algorithms, and as such present a viable solution for decoding Reed-Solomon codes. Thirdly the new ideas presented suggest a direction for future research. The first algorithm uses the extended Euclidean algorithm and is very efficient for a systolic VLSI implementation. The second decoding algorithm presented is similar in nature to the original decoding algorithm of Peterson except that the syndromes do not need to be computed and the remainders are used directly. It has a regular structure and will be efficient for implementation only for correcting a small number of errors. A systolic design for computing the Lagrange interpolation of a polynomial, which is needed for the first decoding algorithm, is also presented.This research was supported by a grant from the Canadian Institute for Telecommunications Research under the NCE program of the Government of Canada     

An FEC scheme combined with weighted scheduling to reduce multicast packet loss in IPTV over PON

Congestion is one of the most important challenges in optical networks. In a Passive Optical Network (PON), the Optical Line Terminal (OLT) is a bottleneck and congestion prone. In this paper, a framework is proposed with Forward Error Correction (FEC) at the IP layer combined with Weighted Round Robin (WRR) at the scheduling level to overcome packet-loss due to congestion in the OLT in order to achieve efficient video multicasting over PON. In the FEC scheme, Reed-Solomon (RS(n,k)) with erasure coding is used, where (n−k) erroneous symbols per n symbol blocks can be corrected. In our framework, an Internet Protocol TeleVision (IPTV) service provider uses the mentioned RS coding and generates redundant packets from regular IPTV packets in such a way that an Optical Network Unit (ONU) can recover lost packets from received packets, thus resulting in a better video quality. Simulation results show that using the proposed framework, an ONU can recover many lost packets and achieve better video quality under different traffic loads for its users. For instance, the proposed method can reduce packet loss rate by almost 55% and 10% under traffic load 0.9, respectively, compared with the Round Robin (RR) and WRR methods under symmetric traffic load. When High Receivers Queue (HRQ) traffic (i.e., traffic received by many users) is twice Low Receivers Queue (LRQ) traffic (i.e., traffic received by a small number of users), this reduction is almost 86% and 30% under traffic load 0.9. Finally, when LRQ traffic is twice HRQ traffic, the reduction in packet loss rate is almost 70% and 91% at traffic load 0.5.     

吉比特里所码和卷积码级联译码器设计

针对60-GHz无线个域网,提出了一种吉比特里所码和卷积码级联译码器架构。在推荐级联架构中,里所码和卷积码分别作为外码和内码,通过交织器级联。采用基于Viterbi算法的8路并行卷积译码结构和基于RiBM算法的里所码译码结构,实现了超高速级联译码器。在TSMC 0.13μm CMOS工艺下,该译码器以0.135 nJ/bit和5.19 mm2的能耗资源开销实现了高达2 Gb/s的吞吐率。     

A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes

We tighten a key estimate, which dictates the computational complexity of Guruswami-Sudan algorithm, on the lower bound of the degrees of freedom, and then propose a modified decoding algorithm for Reed-Solomon codes beyond half the minimum distance. The computational complexity of the modified algorithm is lower than the Guruswami-Sudan algorithm for the medium to high rate Reed-Solomon codes, and has the same asymptotic complexity as the algorithm proposed by Wu. Besides we also claim that our modified algorithm outperforms Wu's algorithm to some extent.     

基于RS码的错误容忍存储方案

在分布式存储系统存储数据时,如果一个或几个设备出现故障,不仅该设备中的数据不能使用,而且会导致用户无法完整地访问资源。针对该问题,提出一种基于RS码的错误容忍存储方案,当系统中错误设备的数量不超过m时,就可以对其进行恢复,实现容错。该方案具有较高的安全性与执行效率,能满足存储系统容错的要求,可以利用其构造对可靠性要求较高的存储系统。     

高速可配置RS纠删解码器的VLSI设计

目前对可配置纠错与删除(纠删)解码器研究较少。为此,采用性能优异的RS编码方法,提出一种高速可配置RS纠删解码器的超大规模集成电路(VLSI)架构,并详述可配置纠删BM模块的构成。该架构通过折叠技术,使解码器在保证高速的前提下降低硬件复杂度。通过0.18 μm工艺和Design Complier工具综合测试结果表明,与同类解码器研究相比,该解码器在硬件复杂度吞吐率和可配置性方面,均具有较大优势。     

RS(255,223)码中乘法器的设计

分别研究了有限域GF(2m)中自然基和对偶基下比特并行乘法器的设计方法与实现手段;在分析有限域乘法运算法则的基础上,用Matlab简化其复杂而消耗资源的部分,得到形式简单的组合逻辑,并用VHDL语言分别设计了有限域GF(2m)中自然基和对偶基下比特并行乘法器,之后在QuartusⅡ编译环境下,分别对自然基下常系数乘法器和对偶基下乘法器进行编译,最后用仿真软件ModelSim进行仿真;仿真结果表明,该乘法器结构规则,易于实现,消耗资源少,性能良好,为实现RS(255,223)编译码奠定了基础。     

一种利用本原元的快速RS码盲识别算法

建立了一种RS码编码参数的盲识别新方法.该方法利用本原元的校检作用并行搜索码长和域,提高了盲识别的效率;略掉不符合本原元校检的码字,增强了码根搜寻的可靠性;利用码根的连续性采用前进-倒退法搜索生成多项式,简化计算,提高了搜索速度.仿真结果表明,新算法在90%识别率的误比特率上限上有明显提高.