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
|
/*
* Copyright (C) 2014 Andreas Steffen
* HSR Hochschule fuer Technik Rapperswil
*
* 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; either version 2 of the License, or (at your
* option) any later version. See <http://www.fsf.org/copyleft/gpl.txt>.
*
* 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.
*/
#include "test_suite.h"
#include <bliss_fft.h>
static bliss_fft_params_t *fft_params[] = {
&bliss_fft_17_8,
&bliss_fft_12289_512
};
START_TEST(test_bliss_fft_impulse)
{
bliss_fft_t *fft;
uint16_t n = fft_params[_i]->n;
uint32_t x[n], X[n];
int i;
for (i = 0; i < n; i++)
{
x[i] = 0;
}
x[0] = 1;
fft = bliss_fft_create(fft_params[_i]);
fft->transform(fft, x, X, FALSE);
for (i = 0; i < n; i++)
{
ck_assert(X[i] == 1);
}
fft->transform(fft, X, x, TRUE);
for (i = 0; i < n; i++)
{
ck_assert(x[i] == (i == 0));
}
fft->destroy(fft);
}
END_TEST
START_TEST(test_bliss_fft_wrap)
{
bliss_fft_t *fft;
uint16_t n = fft_params[_i]->n;
uint16_t q = fft_params[_i]->q;
uint32_t x[n],y[n], X[n], Y[n];
int i, j;
for (i = 0; i < n; i++)
{
x[i] = i;
y[i] = 0;
}
fft = bliss_fft_create(fft_params[_i]);
ck_assert(fft->get_size(fft) == n);
ck_assert(fft->get_modulus(fft) == q);
fft->transform(fft, x, X, FALSE);
for (j = 0; j < n; j++)
{
y[j] = 1;
fft->transform(fft, y, Y, FALSE);
for (i = 0; i < n; i++)
{
Y[i] = (X[i] * Y[i]) % q;
}
fft->transform(fft, Y, Y, TRUE);
for (i = 0; i < n; i++)
{
ck_assert(Y[i] == ( i < j ? q - n - i + j : i - j));
}
y[j] = 0;
}
fft->destroy(fft);
}
END_TEST
Suite *bliss_fft_suite_create()
{
Suite *s;
TCase *tc;
s = suite_create("bliss_fft");
tc = tcase_create("impulse");
tcase_add_loop_test(tc, test_bliss_fft_impulse, 0, countof(fft_params));
suite_add_tcase(s, tc);
tc = tcase_create("negative_wrap");
tcase_add_loop_test(tc, test_bliss_fft_wrap, 0, countof(fft_params));
suite_add_tcase(s, tc);
return s;
}
|
