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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory Jg. 56; H. 3; S. 945 - 959
Hauptverfasser:	Bellorado, J., Kavcic, A.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY IEEE 01.03.2010 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!