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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
|
/**
* This version is stamped on May 10, 2016
*
* Contact:
* Louis-Noel Pouchet <pouchet.ohio-state.edu>
* Tomofumi Yuki <tomofumi.yuki.fr>
*
* Web address: http://polybench.sourceforge.net
*/
/* covariance.c: this file is part of PolyBench/C */
#ifndef SYNTHESIS
#include <stdio.h>
#endif
#define plus(i) i = i + ONE
static
void init_array (int m, int n,
int *float_n,
int data[ 32 + 0][28 + 0])
{
int i, j;
int ONE = 1;
*float_n = (int)n;
for (i = 0; i < 32; plus(i))
for (j = 0; j < 28; plus(j))
data[i][j] = ((int) i*j) / (27+ONE);
}
static
int print_array(int m,
int cov[ 28 + 0][28 + 0])
{
int i, j;
int ONE = 1;
int res = 0;
for (i = 0; i < m; plus(i))
for (j = 0; j < m; plus(j)) {
res ^= cov[i][j];
}
#ifndef SYNTHESIS
printf("finished: %u\n", res);
#endif
return res;
}
static
void kernel_covariance(int m, int n,
int float_n,
int data[ 32 + 0][28 + 0],
int cov[ 28 + 0][28 + 0],
int mean[ 28 + 0])
{
int i, j, k;
int ONE = 1;
for (j = 0; j < m; plus(j))
{
mean[j] = 0;
for (i = 0; i < n; plus(i))
mean[j] += data[i][j];
mean[j] = mean[j] / float_n;
}
for (i = 0; i < n; plus(i))
for (j = 0; j < m; plus(j))
data[i][j] -= mean[j];
for (i = 0; i < m; plus(i))
for (j = i; j < m; plus(j))
{
cov[i][j] = 0;
for (k = 0; k < n; plus(k))
cov[i][j] += data[k][i] * data[k][j];
cov[i][j] = cov[i][j] / (float_n - ONE);
cov[j][i] = cov[i][j];
}
}
int main()
{
int n = 32;
int m = 28;
int float_n;
int data[32 + 0][28 + 0];
int mean[28 + 0];
int cov[28 + 0][28 + 0];
init_array (m, n, &float_n, data);
kernel_covariance (m, n, float_n,
data,
cov,
mean);
return print_array(m, cov);
}
|
