On computing the syndrome polynomial in Reed-Solomon decoder

On computing the syndrome polynomial in Reed-Solomon decoder

Application of the cyclotomic fast Fourier transform (FFT) algorithm to the syndrome evaluation problem in classical Reed–Solomon decoders is described. A number of complexity reduction tricks is suggested. Application of the algorithm leads to significant reductions in the complexity of syndrome ev...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European transactions on telecommunications 2004-07, Vol.15 (4), p.337-342
Hauptverfasser: Costa, Elena, Fedorenko, Sergei Valentinovich, Trifonov, Peter Vladimirovich
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Application of the cyclotomic fast Fourier transform (FFT) algorithm to the syndrome evaluation problem in classical Reed–Solomon decoders is described. A number of complexity reduction tricks is suggested. Application of the algorithm leads to significant reductions in the complexity of syndrome evaluation. Moreover, automatic generation of the program code implementing the described algorithm is possible. Copyright © 2004 AEI
ISSN:1124-318X
1541-8251
DOI:10.1002/ett.982