TIME-MINIMAL LINEAR SYSTOLIC ARRAYS FOR THE TOEPLITZ SYSTEM OF LINEAR EQUATIONS
Gabriel Okša · Parallel Processing Letters · 1995
In this paper, two linear systolic arrays for the solution of general, strongly regular Toeplitz system of equations are presented. They arise from systolization of the efficient serial Schur-like algorithm. Both arrays are time-minimal and they complete the solution in 3n – 4 time cycles (without the initialization and the retrieval of results). The first array requires 2n – 2 processors, and the second one uses only n – 1 processors.