Polynomial matrix-chain interpolation in sudan-type reed-solomon decoders
Farzad Parvaresh, Alexander Vardy · 2004
The main computational steps in algebraic soft-decoding and/or Sudan-type list-decoding of Reed-Solomon codes are interpolation and factorization. The interpolation consists of computing a bivariate polynomial Q(X,Y) that passes through a prescribed set of points with prescribed multiplicities. Using the iterative algorithm of Koetter (1996), this computation can be accomplished in time O(N2), where N is the number of linear equations satisfied by the coefficients of Q(X,Y). Here, we recast the iterative interpolation procedure of (R. Koetter, 1996) as a computation of the product of a certain chain of polynomial matrices. We then derive a dynamic-programming algorithm which optimizes the multiplication order in computing this matrix chain. The resulting optimization reduces the number of finite-field operations required to compute Q(X,Y) by a factor of about two