Progressive algebraic Chase decoding algorithms for Reed–Solomon codes

This study proposes a progressive algebraic Chase decoding (PACD) algorithm for Reed–Solomon (RS) codes. On the basis of the received information, 2η (η > 0) interpolation test-vectors are constructed for the interpolation-based algebraic Chase decoding. A test-vector reliability function is defi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IET communications Jg. 10; H. 12; S. 1416 - 1427
Hauptverfasser: Zhao, Jiancheng, Chen, Li, Ma, Xiao, Johnston, Martin
Format: Journal Article
Sprache:Englisch
Veröffentlicht: The Institution of Engineering and Technology 11.08.2016
Schlagworte:
ABP decoding
adaptive belief propagation
Algebra
algebraic Chase decoding
algebraic codes
Algorithms
Complexity
Coupling
Decoding
intended message
Interpolation
interpolation information
interpolation test vectors
Messages
PACD algorithm
progressive algebraic chase decoding algorithms
received information
Reed‐Solomon codes
RS codes
Strategy
test vector reliability function
RS codes
progressive algebraic chase decoding algorithms
ABP decoding
received information
adaptive belief propagation
interpolation test vectors
decoding
intended message
Reed-Solomon codes
PACD algorithm
interpolation
interpolation information
test vector reliability function
algebraic Chase decoding
algebraic codes
ISSN:1751-8628, 1751-8636
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This study proposes a progressive algebraic Chase decoding (PACD) algorithm for Reed–Solomon (RS) codes. On the basis of the received information, 2η (η > 0) interpolation test-vectors are constructed for the interpolation-based algebraic Chase decoding. A test-vector reliability function is defined to assess their potential for yielding the intended message. The algebraic Chase decoding will then be performed progressively granting priority to decode the test-vectors that are more likely to yield the message, and is then terminated once it is found. Consequently, the decoding complexity can be adapted to the quality of the received information. An enhanced-PACD (E-PACD) algorithm is further proposed by coupling the PACD algorithm with the adaptive belief propagation (ABP) decoding. The ABP decoding generates new test-vectors for the PACD algorithm by enhancing the received information. It improves the Chase decoding performance without increasing the decoding complexity exponentially. It is shown that the E-PACD algorithm's complexity can be significantly reduced by utilising the existing interpolation information of the previous Chase decodings'. Our performance evaluations show that the two proposed decoders outperform a number of existing algebraic decoding approaches. Complexity and memory analyses of the PACD algorithm are also presented, demonstrating that this is an efficient RS decoding strategy.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1751-8628
1751-8636
DOI:10.1049/iet-com.2015.0873