2010 International Conference on Reconfigurable Computing and FPGAs 2010
DOI: 10.1109/reconfig.2010.86
|View full text |Cite
|
Sign up to set email alerts
|

An Improved GF(2) Matrix Inverter with Linear Time Complexity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0
1

Year Published

2012
2012
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(10 citation statements)
references
References 7 publications
0
9
0
1
Order By: Relevance
“…(1). Our implementation builds on earlier matrix inversion approaches in [15] and [16] and balances hardware complexity with the speed of inversion operation, as verified experimentally in Subsection III.A.…”
Section: Matrix Inversionmentioning
confidence: 99%
See 4 more Smart Citations
“…(1). Our implementation builds on earlier matrix inversion approaches in [15] and [16] and balances hardware complexity with the speed of inversion operation, as verified experimentally in Subsection III.A.…”
Section: Matrix Inversionmentioning
confidence: 99%
“…For the ith (i ≠ 1) row, if both entries in the first column are "1," then the ith row is replaced by the XOR of itself with the first row. Row swapping in [15,16] is done either by a search, at the expense of speed, or through the use of auxiliary memory, at the expense of complexity.…”
Section: Matrix Inversionmentioning
confidence: 99%
See 3 more Smart Citations