A fast transversal filter for the numerical factorization of polynomials is presented. When all zeros of a polynomial are of different modulus, this algorithm can be used for the simultaneous determination of all zeros. The main feature of this method is that it is globally convergent and can be modified to compute all zeros of any given polynomial by shifting the zeros. The numerical efficiency of the proposed method is inherited from the reduced computational cost associated with certain implementation of transversal filters, which require only O(N) operations per sample, where N is the order of the filter. The behavior of the algorithm is demonstrated through several examples.
|Original language||English (US)|
|Number of pages||3|
|Journal||IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing|
|State||Published - Dec 2000|