Efficient Interpolation in Wu List Decoding Algorithm
نویسنده
چکیده
The interpolation step of Wu list decoding algorithm for Reed-Solomon codes is considered. The problem is reformulated as construction of a partially homogenized interpolation polynomial. A generalization of the binary interpolation algorithm, which is based on the novel formulation of the interpolation step, is provided. It enables complexity reducion both with respect to the Wu method based on the Iterative Interpolation Algorithm (IIA), as well as the Guruswami-Sudan method based on re-encoding and the binary interpolation algorithm.
منابع مشابه
Interpolation in list decoding of Reed-Solomon codes
The problem of efficient implementation of two-dimensional interpolation in the Guruswami-Sudan list decoding algorithm for Reed-Solomon codes is considered. It is shown that it can be implemented by computing the product of the ideals of interpolation polynomials constructed for subsets of interpolation points. A method for fast multiplication of zero-dimensional co-prime ideals product is pro...
متن کاملReduced List-Decoding of Reed-Solomon Codes Using Reliability Information
We decode Reed-Solomon codes using soft information provided at the receiver. The Extended Euclidean Algorithm (EEA) is considered as an initial step to obtain an intermediate result. The final decoding result is obtained by interpolating the output of the EEA at the least reliable positions of the received word. We refer to this decoding method as reduced list-decoding, since not all received ...
متن کاملEfficient Interpolation Architecture for Soft-Decision List Decoding of Reed- Solomon Codes
Recently, algebraic soft-decision decoding algorithm for RS codes that can correct the errors beyond the error correcting bound has been proposed. The main task in the algorithm is the weighted interpolation of a bivariate polynomial that requires intensive computations. In this paper, we propose an efficient architecture with low hardware complexity for interpolation in soft-decision list deco...
متن کاملAlgebraic List Decoding of Reed-Solomon product codes
The product code of two Reed-Solomon codes can be regarded as an evaluation codes of bivariate polynomials, whose degrees in each variable are bounded. We propose to decode these codes with a generalization of the Guruswami-Sudan interpolation-based list decoding algorithm. A relative decoding radius of 1 − 6 √4R is found, where is the rate of the product code. We also discuss a generalization ...
متن کاملAn Interpolation Algorithm for List Decoding of Reed-Solomon Codes
The interpolation step of Sudan’s list decoding of Reed-Solomon codes sets forth the problem of finding the minimal polynomial of the ideal of interpolating polynomials with respect to a certain monomial order. An efficient algorithm that solves the problem is presented based on the theory of Gröbner bases of modules. In a special case, this algorithm is shown to be equivalent with the Berlekam...
متن کامل