-
Notifications
You must be signed in to change notification settings - Fork 36
/
test.html
171 lines (123 loc) · 4.33 KB
/
test.html
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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
<!DOCTYPE html>
<head>
<title>fft.js</title>
<script src='lib/real.js'></script>
<script src='lib/complex.js'></script>
<script>
function kahanDiff(x, xOffset, xStride, y, yOffset, yStride, n, run) {
var sum = 0.0, compensation = 0.0
for (var i = 0; i < x.length / run / xStride; i++) {
for (var j = 0; j < run; j++) {
var v = Math.abs(x[xOffset + run * xStride * i + j] - y[yOffset + run * yStride * i + j] / n) - compensation
var t = sum + v
compensation = (t - sum) - v
sum = t
if (isNaN(sum)) {
debugger
}
}
}
return sum
}
function kahanStrideDiff(x, xOffset, xStride, run) {
var sum = 0.0, compensation = 0.0
for (var i = 0; i < x.length / run / xStride; i++) {
for (var j = run; j < run * xStride; j++) {
var v = Math.abs(x[xOffset + run * xStride * i + j]) - compensation
var t = sum + v
compensation = (t - sum) - v
sum = t
if (isNaN(sum)) {
debugger
}
}
}
return sum
}
function kahanOffsetDiff(x, xOffset) {
var sum = 0.0, compensation = 0.0
for (var i = 0; i < xOffset; i++) {
var v = Math.abs(x[i]) - compensation
var t = sum + v
compensation = (t - sum) - v
sum = t
if (isNaN(sum)) {
debugger
}
}
return sum
}
function testComplex(n) {
var i = new Float64Array(2 * n), o1 = new Float64Array(2 * n), o2 = new Float64Array(2 * n)
var fft = new FFT.complex(n, false), ifft = new FFT.complex(n, true)
for (var j = 0; j < (2 * n); j++) {
i[j] = Math.random()
}
fft.process(o1, 0, 1, i, 0, 1)
ifft.process(o2, 0, 1, o1, 0, 1)
return kahanDiff(i, 0, 1, o2, 0, 1, n, 2)
}
function testComplexStride(n) {
var iStride = ~~(12 * Math.random()) + 1, o1Stride = ~~(16 * Math.random()) + 1, o2Stride = ~~(5 * Math.random()) + 1
var i = new Float64Array(2 * iStride * n), o1 = new Float64Array(2 * o1Stride * n), o2 = new Float64Array(2 * o2Stride * n)
var fft = new FFT.complex(n, false), ifft = new FFT.complex(n, true)
for (var j = 0; j < n; j++) {
i[2 * j * iStride + 0] = Math.random()
i[2 * j * iStride + 1] = Math.random()
}
fft.process(o1, 0, o1Stride, i, 0, iStride)
ifft.process(o2, 0, o2Stride, o1, 0, o1Stride)
return [kahanDiff(i, 0, iStride, o2, 0, o2Stride, n, 2), kahanStrideDiff(o2, 0, o2Stride, 2)]
}
function testRealToComplex(n) {
var i = new Float64Array(n), o1 = new Float64Array(2 * n), o2 = new Float64Array(2 * n)
var fft = new FFT.complex(n, false), ifft = new FFT.complex(n, true)
for (var j = 0; j < n; j++) {
i[j] = Math.random()
}
fft.simple(o1, i, 'real')
ifft.simple(o2, o1)
return [kahanDiff(i, 0, 1, o2, 0, 2, n, 1), kahanStrideDiff(o2, 2, 1)]
}
function testRealToComplexWithOffset(n) {
var iOffset = ~~(12 * Math.random()), o1Offset = ~~(12 * Math.random()), o2Offset = ~~(12 * Math.random())
var i = new Float64Array(iOffset + n), o1 = new Float64Array(o1Offset + 2 * n), o2 = new Float64Array(o2Offset + 2 * n)
var fft = new FFT.complex(n, false), ifft = new FFT.complex(n, true)
for (var j = 0; j < n; j++) {
i[iOffset + j] = Math.random()
}
fft.process(o1, o1Offset, 1, i, iOffset, 1, 'real')
ifft.process(o2, o2Offset, 1, o1, o1Offset, 1)
return [kahanDiff(i, 1, o2, 2, n, 1), kahanStrideDiff(o2, 2, 1), kahanOffsetDiff(o1, o1Offset), kahanOffsetDiff(o2, o2Offset)]
}
var count = 0
for (var i = 2; i < 100; i++) {
var v = testComplex(i)
if (isNaN(v) || v > 1e-12) {
console.log('Complex', i, v), count++
}
}
for (var i = 2; i < 100; i++) {
var v = testComplexStride(i)
if (isNaN(v[0]) || v[0] > 1e-12 || v[1] > 0) {
console.log('Complex Strided', i, v), count++
}
}
for (var i = 2; i < 100; i++) {
var v = testRealToComplex(i)
if (isNaN(v[0]) || isNaN(v[1]) || v[0] > 1e-12 || v[1] > 1e-12) {
console.log('Real to Complex', i, v), count++
}
}
for (var i = 2; i < 100; i++) {
var v = testRealToComplexWithOffset(i)
if (isNaN(v[0]) || isNaN(v[1]) || isNaN(v[2]) || isNaN(v[3]) || v[0] > 1e-12 || v[1] > 1e-12 || v[2] > 0 || v[3] > 0) {
console.log('Real to Complex Offset', i, v), count++
}
}
var f0 = new Float64Array(32), r0 = new Float64Array(64), fft = new FFT.complex(32, false); f0[0] = 1, f0[31] = 1
fft.simple(r0, f0, 'real')
console.log(r0)
console.log("Failcount", count)
</script>
</head>