Systolic Gaussian elimination over GF(p) with partial pivoting
Authors:
- B. HochetBHB. Hochet
- P. QuintonPQP. Quinton
- Y. RobertYRY. Robert
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 38 (9) , 1321-1324
Abstract
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 with partial pivoting, although the operation of the array remains purely systolic. Extension of the array to the complete solution of a linear system Ax=b over GF(p) is also considered.Keywords
This publication has 10 references indexed in Scilit:
- Systolic solution of linear systems over GF(p) with partial pivoting1987
- The design of special purpose hardware are to factor large integersComputer Physics Communications, 1985
- A compact algorithm for Gaussian elimination over GF(2) implemented on highly parallel computersParallel Computing, 1984
- Wafer-scale integration and two-level pipelined implementations of systolic arraysJournal of Parallel and Distributed Computing, 1984
- A Computer Algorithm for Calculating the Product AB Modulo MIEEE Transactions on Computers, 1983
- Partitioned Matrix Algorithms for VLSI Arithmetic SystemsIEEE Transactions on Computers, 1982
- Why systolic architectures?Computer, 1982
- Highly concurrent computing structures for matrix arithmetic and signal processingComputer, 1982
- Linear prediction: A tutorial reviewProceedings of the IEEE, 1975
- A Method of Factoring and the Factorization of F 7Mathematics of Computation, 1975