SIMD implementation of interpolation in algebraic soft-decision Reed-Solomon decoding

The Koetter-Vardy algorithm is an algebraic soft-decision decoding algorithm for Reed-Solomon codes. Software implementations of the Koetter-Vardy algorithm are considered as part of a redecoding architecture that augments a hardware hard-decision decoder with soft-decision decoding software on an e...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE Workshop on Signal Processing Systems Design and Implementation, 2005 s. 750 - 755
Hlavní autoři: Boulianne, L., Gross, W.J.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 2005
Témata:
Computer architecture
Decoding
Digital signal processing
Embedded software
Galois fields
Interpolation
Polynomials
Reed-Solomon codes
Software algorithms
Very large scale integration
ISBN:9780780393332, 0780393333
ISSN:2162-3562
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í:The Koetter-Vardy algorithm is an algebraic soft-decision decoding algorithm for Reed-Solomon codes. Software implementations of the Koetter-Vardy algorithm are considered as part of a redecoding architecture that augments a hardware hard-decision decoder with soft-decision decoding software on an embedded processor. In this paper we investigate the implementation of the interpolation step of the Koetter-Vardy algorithm on SIMD processor architectures. A parallelization of the algorithm is given using the K'th order Horner's rule for parallel polynomial evaluation. The SIMD algorithm has a running time 2.5 to 4 times faster than a serial implementation on a DSP processor. To gain further speedup we propose a merged-SIMD architecture that calculates the Hasse derivative in parallel with the polynomial updates.
ISBN:9780780393332
0780393333
ISSN:2162-3562
DOI:10.1109/SIPS.2005.1579965