Article

A Parametric Approach to List Decoding of Reed-Solomon Codes Using Interpolation

Dept. of Electr. & Electron. Eng., Univ. of Melbourne, Melbourne, VIC, Australia
IEEE Transactions on Information Theory (Impact Factor: 2.62). 11/2011; DOI: 10.1109/TIT.2011.2165803
Source: arXiv

ABSTRACT In this paper, we present a minimal list decoding algorithm for Reed-Solomon (RS) codes. Minimal list decoding for a code C refers to list decoding with radius L, where L is the minimum of the distances between the received word r and any codeword in C. We consider the problem of determining the value of L as well as determining all the codewords at distance L. Our approach involves a parametrization of interpolating polynomials of a minimal Gröbner basis G . We present two efficient ways to compute G. We also show that so-called re-encoding can be used to further reduce the complexity. We then demonstrate how our parametric approach can be solved by a computationally feasible rational curve fitting solution from a recent paper by Wu. Besides, we present an algorithm to compute the minimum multiplicity as well as the optimal values of the parameters associated with this multiplicity, which results in overall savings in both memory and computation.

0 Bookmarks
 · 
94 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we present a progressive interpolation approach in Guruswami-Sudan (GS) decoding of Reed-Solomon (RS) codes. The objective of the interpolation is to construct the minimal polynomial Q(x, y) by the progressive approach with increasing multiplicities until the roots of Q(x, y) give the correct message. Then the error-correction capability can be adaptively obtained by assigning a suitable multiplicity according to the number of errors occurred in the channel. We present an efficient way to update the polynomial set utilizing the previous computational results in the interpolation step. It enables the decoder to adjust its decoding complexity to the needed level. Simulation results suggest that the average decoding complexity of GS algorithm can be significantly reduced by the progressive approach for RS codes.
    Communication Technology (ICCT), 2012 IEEE 14th International Conference on; 01/2012
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The construction of shortest feedback shift registers for a finite sequence S_1,...,S_N is considered over the finite ring Z_{p^r}. A novel algorithm is presented that yields a parametrization of all shortest feedback shift registers for the sequence of numbers S_1,...,S_N, thus solving an open problem in the literature. The algorithm iteratively processes each number, starting with S_1, and constructs at each step a particular type of minimal Gr\"obner basis. The construction involves a simple update rule at each step which leads to computational efficiency. It is shown that the algorithm simultaneously computes a similar parametrization for the reciprocal sequence S_N,...,S_1.
    01/2012;
  • [Show abstract] [Hide abstract]
    ABSTRACT: Minimal list decoding for a code C refers to list decoding with radius L(y), where L(y) is the minimum of the distances between the received word y and any codeword in C. In this paper we present a minimal list decoding algorithm for Reed- Solomon (RS) codes. Our approach involves a parametrization of the interpolating polynomials of a minimal Gr¨ obner basis G. We then demonstrate that our parametric approach can be solved by a computationally efficient rational curve fitting solution from a recent paper by Wu. Besides, we present an algorithm to compute the minimum multiplicity as well as the associated optimal values of the parameters. Use of these optimal parameters in the rational interpolation step results in computational as well as memory efficiency.
    01/2011;

Full-text (2 Sources)

View
2 Downloads
Available from