论文信息 - A subspace method for the computation of the GCD of polynomials

A subspace method for the computation of the GCD of polynomials

For the problem of computing the greatest common divisor (GCD) of a set of polynomials, a subspace (SS) technique is introduced and compared with the matrix-pencil (MP) method proposed by Karcanias and Mitrouli. It is observed that the SS method is easier to implement and more robust to noise than the MP method.

[1] Björn E. Ottersten,et al. Sensor array processing based on subspace fitting , 1991, IEEE Trans. Signal Process..

[2] Eric Moulines,et al. Subspace methods for the blind identification of multichannel FIR filters , 1995, IEEE Trans. Signal Process..

[3] Hui Liu,et al. A deterministic approach to blind symbol estimation , 1994 .

[4] Yingbo Hua,et al. Previously Published Works Uc Riverside Title: Fast Maximum Likelihood for Blind Identification of Multiple Fir Channels Fast Maximum Likelihood for Blind Identification of Multiple Fir Channels , 2022 .

[5] T. Kailath,et al. A least-squares approach to blind channel identification , 1995, IEEE Trans. Signal Process..

[6] N. Karcanias,et al. A matrix pencil based numerical method for the computation of the GCD of polynomials , 1994, IEEE Trans. Autom. Control..