Fast matrix solver in GF(2)

In this paper a parallel and piplined fast matrix equation solver in GF(2) is proposed where the elements are 0s or 1s. The solver employing the iterative logic circuits which are suitable for VLSI implementation can be realized by the conventional Gauss Jordan Elimination Method. O(n) gate stages in the pipeline and O(n³) total gates are required for solving A X = b where A is a matrix of n×n, X and b are vectors respectively. The organization of the solver is discussed in this paper.