FFT-based fast polynomial rooting

Electronics Letters

Volumn 35, Issue 12, 1999, Pages 965-966

  Hoteit, L ^a,b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b SCHLUMBERGER CAMBRIDGE RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; EIGENVALUES AND EIGENFUNCTIONS; FAST FOURIER TRANSFORMS; ITERATIVE METHODS; MATRIX ALGEBRA;

FACTORIZATION; POLYNOMIAL ROOTING TECHNIQUES;

POLYNOMIALS;

EID: 0032675723     PISSN: 00135194     EISSN: None     Source Type: Journal    
DOI: 10.1049/el:19990658     Document Type: Article

References (3)

1. OPPENHEIM, A., and SCHAFER, R.: 'Discrete time signal processing' (Prentice Hall, 1989), Chap. 12
2. STATHAKI, T.: 'Cumulant-based and algebraic techniques for signal modelling', PhD Thesis, Imperial College, 1994
3. POLYDOROS, A., and FAM, A.T.: 'The differential cepstrum definition and properties', Proc. IEEE Int. Symp. Circuits and Systems, 1981, pp. 77-80