Modified Euclidean Algorithms for Decoding Reed-Solomon Codes - Computer Science > Information TheoryReport as inadecuate




Modified Euclidean Algorithms for Decoding Reed-Solomon Codes - Computer Science > Information Theory - Download this document for free, or read online. Document in PDF available to download.

Abstract: The extended Euclidean algorithm EEA for polynomial greatest commondivisors is commonly used in solving the key equation in the decoding ofReed-Solomon RS codes, and more generally in BCH decoding. For thisparticular application, the iterations in the EEA are stopped when the degreeof the remainder polynomial falls below a threshold. While determining thedegree of a polynomial is a simple task for human beings, hardwareimplementation of this stopping rule is more complicated. This paper describesa modified version of the EEA that is specifically adapted to the RS decodingproblem. This modified algorithm requires no degree computation or comparisonto a threshold, and it uses a fixed number of iterations. Another advantage ofthis modified version is in its application to the errors-and-erasures decodingproblem for RS codes where significant hardware savings can be achieved viaseamless computation.



Author: Dilip V. Sarwate, Zhiyuan Yan

Source: https://arxiv.org/







Related documents