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

Full description

Saved in:
Bibliographic Details
Published in:IEEE Workshop on Signal Processing Systems Design and Implementation, 2005 pp. 750 - 755
Main Authors: Boulianne, L., Gross, W.J.
Format: Conference Proceeding
Language:English
Published: IEEE 2005
Subjects:
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
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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