A fast transversal filter for the numerical factorization of polynomials

Author

Hasan, Abdulkadhum A. ; Hasan, Mohammed A.

Author_Institution

Coll. of Electron. Eng., Bani Waleed, Libya

Volume

3

fYear

1996

fDate

7-10 May 1996

Firstpage

1299

Abstract

A fast transversal filter (FTF) for the numerical factorization of polynomials having zeros of different modulus is presented. When all zeros of a polynomial are of different modulus, this algorithm can be used for the simultaneous determination of all zeros. This method is globally convergent in that it does not require initial conditions to start. Additionally, this can be modified to compute all zeros of any given polynomial by shifting the zeros. The numerical efficiency of this algorithm is inherited from the reduced computational cost associated with the transversal filters which require O(N) operations per sample and N is the order of the filter

Keywords

convergence of numerical methods; digital filters; filtering theory; matrix algebra; poles and zeros; polynomials; computational cost reduction; fast transversal filter; globally convergent method; matrix; modulus; numerical efficiency; numerical factorization; polynomials; zeros; Computational geometry; Computer graphics; Convergence; Costs; Curve fitting; Difference equations; Ear; Educational institutions; Polynomials; Transversal filters;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 1996. ICASSP-96. Conference Proceedings., 1996 IEEE International Conference on

Conference_Location

Atlanta, GA

ISSN

1520-6149

Print_ISBN

0-7803-3192-3

Type

conf

DOI

10.1109/ICASSP.1996.543664

Filename

543664