论文信息 - Comments on "A Simple and Accurate Algorithm for Barycentric Rational Interpolation"

Comments on "A Simple and Accurate Algorithm for Barycentric Rational Interpolation"

For original paper see L. Knockaert , ibid., vol.15, p.154-7, (2008). It is pointed out that the null space of Lowner matrices for the Barycentric rational interpolation can also be solved by an algebraic algorithm based on the Grobner basis theory. This algorithm is known for solving minimal rational interpolation problems in the context of system and coding theory.

Chingwo Ma

[1] Patrick Fitzpatrick. On the key equation , 1995, IEEE Trans. Inf. Theory.

[2] Simon R. Blackburn,et al. Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences , 1997, IEEE Trans. Inf. Theory.

[3] Athanasios C. Antoulas,et al. On the Scalar Rational Interpolation Problem , 1986 .

[4] Chingwo Ma. On cauchy matrices for remainder decoding of reed-solomon codes , 2009, IEEE Communications Letters.

[5] A. Ranga,et al. On the denominator values and barycentric weights of rational interpolants , 2007 .

[6] Zhiping Lin,et al. A Tutorial on GrÖbner Bases With Applications in Signals and Systems , 2008, IEEE Transactions on Circuits and Systems I: Regular Papers.

[7] Luc Knockaert,et al. A Simple and Accurate Algorithm for Barycentric Rational Interpolation , 2008, IEEE Signal Processing Letters.

[8] Simon R. Blackburn,et al. A Generalized Rational Interpolation Problem and the Solution of the Welch–Berlekamp Key Equation , 1997, Des. Codes Cryptogr..

[9] W. G. Chambers,et al. Algorithm for solving the Welch-Berlekamp key-equation, with a simplified proof , 1993 .