Issue No. 09 - September (1989 vol. 38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.29471
A systolic architecture is proposed for the triangularization by means of the Gaussian elimination algorithm of large dense n*n matrices over GF(p), where p is a prime number. The solution of large dense linear systems over GF(p) is the major computational step in various algorithms issuing from arithmetic number theory and computer algebra. The proposed architecture implements the elimination
systolic Gaussian elimination; partial pivoting; systolic architecture; triangularization; prime number; large dense linear systems; arithmetic number theory; computer algebra; digital arithmetic; number theory; parallel architectures.
B. Hochet, P. Quinton and Y. Robert, "Systolic Gaussian Elimination Over GF(p) with Partial Pivoting," in IEEE Transactions on Computers, vol. 38, no. , pp. 1321-1324, 1989.