-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmatrix.c
78 lines (68 loc) · 1.47 KB
/
matrix.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
#include <stdint.h>
#include <string.h>
#include "matrix.h"
void multMat(uint8_t m, uint8_t n, const uint8_t A[m][n], uint8_t p,
const uint8_t B[n][p], uint8_t C[m][p]) {
int i, j, k;
for (i = 0; i < m; i++) {
for (j = 0; j < p; j++) {
C[i][j] = 0;
for (k = 0; k < n; k++) {
C[i][j] ^= A[i][k] & B[k][j];
}
}
}
}
void multVector(uint8_t n, const uint8_t A[n], uint8_t m,
const uint8_t B[n][m], uint8_t C[m]){
uint8_t i, j;
for (i = 0; i < m; i++) {
C[i] = 0;
for(j = 0; j < n; j++)
C[i] ^= A[j] & B[j][i];
}
}
void getSinverse(uint8_t S[4][4]) {
uint8_t i, j, k;
uint8_t factor;
int8_t pivot;
uint8_t temp;
uint8_t gauss[4][8];
for (i =0; i<4; i++) {
for (j=0; j<4; j++) {
gauss[i][j] = S[i][j];
gauss[i][j+4] = (i==j)? 1 : 0;
}
}
for (i = 0; i<4; i++) {
pivot = -1;
for (j = i; j<4; j++) {
if (gauss[j][i] == 1) {
pivot = j;
break;
}
}
if (pivot != -1) {
// Swap rows
for (j = 0; j<8; j++) {
temp = gauss[i][j];
gauss[i][j] = gauss[pivot][j];
gauss[pivot][j] = temp;
}
// Row operations
for (j = 0; j<4; j++) {
if (j != i) {
factor = gauss[j][i];
for (k = 0; k<8; k++) {
gauss[j][k] = gauss[j][k] ^ (factor & gauss[i][k]);
}
}
}
}
}
for(i =0; i<4; i++) {
for(j=4; j<8; j++) {
S[i][j-4] = gauss[i][j];
}
}
}