We propose a systolic architecture for the triangularization via the Gauss elimination algorithm of large dense n x n matrices over GF@), where p is a prime number. The solution of large dense linear systems over GF(p) is the major computational step in various algorithms issued from arithmetic number theory and computer algebra. The proposed architecture implements the elimination with partial pivoting, although the operation of the array remains purely systolic. Extension of the array to the

more »

... omplete solution of a linear system A x = b over G F @ ) is also considered. Index Terms-Finite fields, Gaussian triangularization, partial pivoting, solution of linear systems, systolic arrays.