-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.cpp
75 lines (53 loc) · 2.14 KB
/
main.cpp
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
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, version 3 of the License.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
//
// Copyright 2016 Vegard Antun
//
#include "python/hadamardKernel.h" // Python interface
#include "hadamard.h"
#include "timer.h"
int main(int argc, char *argv[]) {
const unsigned long nu = 26;
const unsigned long N = powDyadic(nu);
const unsigned long M = powDyadic(nu);
const unsigned long MN = M*N;
int reps = 5;
timeit("Sequency ", reps, N, hadamardSequency<double>);
timeit("Paley ", reps, N, hadamardPaley<double>);
timeit("Ordinary ", reps, N, hadamardOrdinary<double>);
//double *x = new double[MN];
//double *y = new double[MN];
//for (int i = 0; i < MN; i++) {
// x[i] = i;
// y[i] = i;
//}
//
//x[4] = -30;
//y[4] = -30;
//x[3] = 50;
//y[3] = 50;
//hadamard2d<double>(x,N,M);
//hadamardTransform2d<double>(y,M,N, SEQUENCY);
//
//for (int i = 0; i < MN; i++) {
// std::cout << x[i] - y[i]
// << ", x: " << std::setw(10) << std::left << x[i]
// << ", y: " << std::setw(10) << std::left << y[i] << std::endl;
//}
}
//timeit("Sequency ", reps, N, hadamardSequency<double>);
//timeit("Paley ", reps, N, hadamardPaley<double>);
//timeit("Ordinary ", reps, N, hadamardOrdinary<double>);
//timeit("Recursive ", reps, N, hadamardRecursive<double>);
//timeit("Depth First ", reps, N, hadamardDepthFirst<double>);
//timeit("Arndt ", reps, N, hadamardArndt<double>);
//timeit("Parallel ", reps, N, hadamardParallel<double>);