A subspace method for the computation of the GCD of polynomials

Automatica

Volumn 33, Issue 4, 1997, Pages 741-743

  Qiu, Wanzhi ^a,b   Hua, Yingbo ^a   Abed Meraim, Karim ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b Motorola Australia   (Australia)

Author keywords

Greatest common divisor (GCD); Matrix pencil; Polynomials; Subspace

Indexed keywords

ALGORITHMS; CALCULATIONS; EIGENVALUES AND EIGENFUNCTIONS; MATRIX ALGEBRA; PROBLEM SOLVING; VECTORS;

COEFFICIENT VECTOR; GREATEST COMMON DIVISOR; MATRIX PENCIL METHOD; SUBSPACE METHOD;

POLYNOMIALS;

EID: 0031108628     PISSN: 00051098     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0005-1098(96)00244-0     Document Type: Article

References (7)

1. Bitmead, R. R., Kung, S.-Y. Anderson, B. D. O. and Kailath, T. (1978) GCD via generalized Sylvester and Bézout matrices. IEEE Trans. Autom. Control, AC-23, 1043-1047.
2. Hua, Y. (1996) Fast maximum likelihood for blind identification of multiple FIR channels. IEEE Trans. Sig. Process., March, pp. 661-672.
3. Karcanias, N. and Mitrouli, M. (1994) A matrix pencil based numerical method for the computation of the GCD of polynomials. IEEE Trans. Autom. Coontrol AC-39, 977-981.
4. Liu, H. and Xu, G. (1994) A deterministic approach to blind symbol estimation. IEEE Sig. Process. Lett. 1(12), pp. 205-207.
5. Moulines, E., Duhamel, P., Cardoso, J.-F. and Mayrargue, S. (1995) Subspace methods for the blind identification of multichannel FIR filters. IEEE Trans. Sig. Process. 43, Feb, pp. 516-525.
6. Viberg, M. and Ottersten, B. (1991) Sensor array processing based on subspace fitting. IEEE Trans. Sig. Process. SP-39, 1110-1121.
7. Xu, G., Liu, H., Tong, L. and Kailath, T. (1995) A least-squares approach to blind channel identification. IEEE Trans. Sig. Process., Dec, pp. 2982-2993.