Low-Complexity Soft-Decoding Algorithms for Reed-Solomon Codes-Part I: An Algebraic Soft-In Hard-Out Chase Decoder

In this paper, we present an algebraic methodology for implementing low-complexity, Chase-type, decoding of Reed-Solomon (RS) codes of length n . In such, a set of 2 ¿ test-vectors that are equivalent on all except ¿ ¿ n coordinate positions is first produced. The similarity of the test-vectors is u...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on information theory Ročník 56; číslo 3; s. 945 - 959
Hlavní autoři:	Bellorado, J., Kavcic, A.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.03.2010 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algebra Algorithms Applied sciences Artificial satellites chase decoding Codes Coding, codes Computational complexity Computational modeling Construction Decoding Equivalence Exact sciences and technology Gain hard-decision decoding Information theory Information, signal and communications theory Interpolation Magnetic memory Messages Methodology Methods Optical feedback Performance loss polynomial factorization polynomial interpolation Polynomials reduced-complexity factorization Reed-Solomon (RS) codes Signal and communications theory soft decoding Telecommunications and information theory Testing Reed Solomon code Performance evaluation reduced-complexity factorization Similarity chase decoding hard-decision decoding Reed-Solomon (RS) codes Tree structure polynomial factorization Decoding Algorithm Computational complexity Factorization Implementation Binary tree Simulation Coding Polynomial interpolation soft decoding
ISSN:	0018-9448, 1557-9654
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	In this paper, we present an algebraic methodology for implementing low-complexity, Chase-type, decoding of Reed-Solomon (RS) codes of length n . In such, a set of 2 ¿ test-vectors that are equivalent on all except ¿ ¿ n coordinate positions is first produced. The similarity of the test-vectors is utilized to reduce the complexity of interpolation, the process of constructing a set of polynomials that obey constraints imposed by each test-vector. By first considering the equivalent indices, a polynomial common to all test-vectors is constructed. The required set of polynomials is then produced by interpolating the final ¿ dissimilar indices utilizing a binary-tree structure. In the second decoding step ( factorization ) a candidate message is extracted from each interpolation polynomial such that one may be chosen as the decoded message. Although an expression for the direct evaluation of each candidate message is provided, carrying out this computation for each polynomial is extremely complex. Thus, a novel, reduced-complexity, methodology is also given. Although suboptimal, simulation results affirm that the loss in performance incurred by this procedure is decreasing with increasing code length n , and negligible for long (n > 100) codes. Significant coding gains are shown to be achievable over traditional hard-in hard-out decoding procedures (e.g., Berlekamp-Massey) at an equivalent (and, in some cases, lower) computational complexity. Furthermore, these gains are shown to be similar to the recently proposed soft-in-hard-out algebraic techniques (e.g., Sudan, Ko¿tter-Vardy) that bear significantly more complex implementations than the proposed algorithm.
Bibliografie:	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23
ISSN:	0018-9448 1557-9654
DOI:	10.1109/TIT.2009.2039073