A systolic implementation of the Jacobi algorithm

An annihilation ordering scheme for the Jacobi algorithm and a belt structured systolic array are presented. The scheme allows a square matrix of length n to enter by rows directly to the array. The belt structure of the array performs n/2 elementary plane rotations simultaneously and permutes data rows automatically and cyclically. Thus, the computation is only repeated itself after n (n-1)/2 rotations. Data communication within the array is local and regular. The on-the-fly computation will be terminated when the desired numerical precision is met, with no consultation from the peripherals throughout