Low-Complexity Chase Decoding of Reed-Solomon Codes Using Module

The interpolation based algebraic soft decoding yields a high decoding performance for Reed-Solomon (RS) codes with a polynomial-time complexity. Its computationally expensive interpolation can be facilitated using the module structure. The desired Gröbner basis can be achieved by reducing the basis...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on communications Ročník 68; číslo 10; s. 6012 - 6022
Hlavní autori:	Xing, Jiongyue, Chen, Li, Bossert, Martin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.10.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithms Basis reduction Codes Complexity Complexity theory Cost analysis Decoding Encoding Interpolation low-complexity Chase decoding Mathematical analysis Maximum likelihood decoding Modules Polynomials progressive decoding Reed-Solomon codes Transforms Vectors (mathematics)
ISSN:	0090-6778, 1558-0857
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!