RS译码的Euclid算法及其FPGA实现

介绍运用于RS译码中的Euclid算法及利用Euclid算法进行RS译码的基本原理，同时给出该算法的FPGA实现，并在高清晰度数字电视接收机中验证了设计的可行性与可靠性。     

RS码的译码算法及软件实现

针对RS码译码比较复杂的特点，详细介绍了RS码译码的过程和算法，并通过实例说明其软件实现方法。     

RS码译码算法对比研究

RS码所具有的高效译码性能使其被广泛应用于数据通信和存储系统的差错控制中。本文主要对目前常用的RS码的硬判决译码算法和K—V代数软判决译码算法进行对比研究。通过对两种算法原理的理论分析,给出了RS码在硬判决与软判决的算法下的计算机仿真。结果表明两种算法均能得到良好的译码效果,而软判决译码算法较硬判决方式能更有效地带来系统增益。而软判决译码算法可以通过适当提高复杂度来改善系统的性能。     

RS码改进的step—by—step译码算法

提出一种改进的RS码的step-by-step译码算法,给出了算法的基本原理,以及具体的并行算法与串行算法,采用此改进算法可以显著降低计算的复杂度,并提高译码速度。     

一种利用多重偏置的RS码软判译码算法

为了提高RS码的纠错性能,本文将基于盒匹配译码算法(BMA)的多重偏置与自适应置信传播算法(ABP)进行级联,提出了一种利用多重偏置基于可信度迭代的RS码软判译码算法,称为ABP-BIAS-BMA,并将其与传统的基于自适应置信传播的级联算法ABP-BMA及自适应置信传播算法ABP进行了译码性能仿真比较.仿真结果表明,提出的ABP-BIAS-BMA算法比ABP-BMA及ABP的译码性能要好,特别在相同信噪比情况下算法整体平均迭代次数较小.     

[256,252]RS扩展码的快速译码算法

该文主要论述[256,252]RS(Reed-Solomon)扩展码的快速译码算法。该算法是通过简单的参数测试来发现接收数据中的错误类型以及错误模式,然后通过得到的错误模式来对接收数据进行错误纠正。与已有的译码算法相比,该算法具有占用硬件资源相对较少,处理时间相对较短的优点,并且在硬件译码器上实现的最高数据处理速率超过400Mbit/s。     

RS译码的BM迭代算法及其FPGA实现

介绍了运用于RS译码中的BM迭带算法及利用BM迭带进行RS译码的基本原理,同时给出了该算法的FPGA实现,并通过在高清晰度数字电视接收机中验证了设计的可行性与可靠性。     

一种新的LDPC译码算法及其硬件实现

介绍了LDPC编译码技术,提出了分层修正最小和算法并对该算法进行了定点仿真和硬件实现.仿真结果和硬件实现表明,该算法性能优良并能降低迭代次数以提高吞吐量.     

基于可配置VLIW结构DSP的RS译码算法设计

VLIW体系结构是高端DSP大多采用的体系结构,此结构有很强的指令级并行运算能力。一般的DSP应用开发,都是针对具体型号的DSP进行软件的设计和优化。为了更好地利用DSP资源、提高性能、节约成本,文中提出了一种软硬件协同设计的方法。通过Rs码的Euclid译码算法的实现,充分体现了可配置VLIW结构DSP的性能优势和开发周期短。达到面向应用的硬件和软件最优。     

RS码编码和译码的算法

本文针对用ＤＳＰ芯片实现ＲＳ码的编码器和译码器的要求,讨论ＲＳ码的编码和译码算法。     

Modified time-domain algorithm for decoding Reed-Solomon codes

A technique for reducing the number of inversions in the time-domain decoding algorithm based on an algebraic decoder (Blahut's decoder) is introduced. It is proved that the modified algorithm is equivalent to the original one. The modified algorithm can be used in the universal Reed-Solomon decoder to decrease complexity     

A modified Blahut algorithm for decoding Reed-Solomon codes beyond half the minimum distance

A modification of the Blahut algorithm is proposed for decoding of Reed-Solomon codes beyond half the minimum distance. An effective method is offered for the searching of unknown discrepancies needed for analytical continuation of the Berlekamp-Massey algorithm through two additional iterations. This reduces the search time by 2(q-1)n/((n+t+1)(n-t)) times, compared with the Blahut algorithm. An architecture of a searcher for unknown discrepancies is given. The coding gain of the proposed algorithm is shown for some practical codes.     

Modified minimum-weight decoding for Reed-Solomon codes

The authors describe an improvement to the minimum-weight decoding (MWD) algorithm for Reed-Solomon (RS) codes. The modification improves the probability of the MWD algorithm `trapping' the error pattern by squaring each of the terms in the received codeword resulting in a transformation which changes the order of the symbols while maintaining the cyclic properties of the codeword. The results of computer simulations are presented which show that the modified decoder provides an improvement in error performance of ~1 dB over the conventional technique with no increase in decoder complexity. The results show that the modified technique achieves an error performance close to that of maximum-likelihood algorithms with ~1/6 the complexity     

一种基于Chase的RS码代数软判决译码算法

为了提高RS码的纠错性能,本文提出了一种基于Chase的代数软判决译码算法,称为Chase-ASD.该算法充分利用了接收比特的可信度信息,但运算复杂度较高.针对该算法运算复杂度高的问题,本文进一步给出了简化的Chase-ASD算法.仿真结果表明,提出的Chase-ASD和简化的Chase-ASD算法均可比原ASD算法提供更多的译码增益.     

On decoding of Reed-Solomon codes

It is shown how nonsystematic Reed-Solomon (RS) codes encoded by means of the Chinese remainder theorem can be decoded using the Berlekamp algorithm. The Chien search and calculation of error values are not needed but are replaced by a polynomial division and added calculation in determining the syndrome. It is shown that for certain cases of low-rate RS codes, the total decoding computation may be less than the usual method used with cyclic codes. Encoding and decoding for shorter length codes is presented.     

A new decoding algorithm for correcting both erasures and errors of Reed-Solomon codes

In this paper, a high efficient decoding algorithm is developed here in order to correct both erasures and errors for Reed-Solomon (RS) codes based on the Euclidean algorithm together with the Berlekamp-Massey (BM) algorithm. The new decoding algorithm computes the errata locator polynomial and the errata evaluator polynomial simultaneously without performing polynomial divisions, and there is no need for the computation of the discrepancies and the field element inversions. Also, the separate computation of the Forney syndrome needed in the decoder is completely avoided. As a consequence, the complexity of this new decoding algorithm is dramatically reduced. Finally, the new algorithm has been verified through a software simulation using C/sup ++/ language. An illustrative example of (255,239) RS code using this program shows that the speed of the decoding process is approximately three times faster than that of the inverse-free Berlekamp-Massey algorithm.     

A burst-error-correcting algorithm for Reed-Solomon codes

It is known that for a burst-error environment, the error-correcting capability of Reed-Solomon codes can be extended beyond the Singleton bound with a high degree of confidence. This is significant in that an (n, k) code with an arbitrarily small probability of a miscorrection can correct more than (n- k)/2 errors. A decoding algorithm for correcting a burst of length greater than (n-k)/2 is presented     

Belief propagation decoding of Reed-Solomon codes; a bit-level soft decision decoding algorithm

In this article we propose the application of Belief Propagation (BP) algorithm as a novel bit-level soft decision decoding (SDD) technique for Reed-Solomon (RS) codes. A brief tutorial on Belief Propagation algorithm is presented. A central issue in the application of BP algorithm to decoding RS codes is the construction of a sparse parity check matrix for the binary image of the code. It is demonstrated that Vardy's technique may be applied to find a sparse parity check matrix for RS codes. However, this technique is not applicable to all cases. The BP algorithm is applied to two test codes. In one case, simulation models show that the BP algorithm outperforms the hard decision Euclidean decoding by more than 2 dB of additional coding gain. The results with the second test code are not as promising.     

A trellis-based recursive maximum-likelihood decoding algorithm forbinary linear block codes

This paper presents an efficient trellis-based maximum-likelihood decoding algorithm for binary linear block codes. This algorithm is recursive in nature and is devised based on the structural properties and optimum sectionalization of a code trellis. The complexity of the proposed decoding algorithm is analyzed. Numerical results show that the proposed decoding algorithm significantly reduces the decoding complexity. A recursive method for finding the optimum sectionalization of a trellis in terms of computational complexity is given