Systolic array for the quotient difference algorithm

The authors consider the problem of producing all the roots of a polynomial p(x)=a₀xⁿ+a₁x^n-1+. . .+a_n (where all the roots are distinct) by an iterative systolic array. Two basic arrays are considered, one where the position of the roots remain stationary and another where they are non-stationary. The former scheme requires O(n) basic cells, the latter O(z) cells with z(>0) a suitably chosen constant determining the number of root approximations on a single pass through the array. Finally an area efficient systolic ring is discussed requiring O(n/4) cells to compute an arbitrary number of root approximations.