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
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
|
/*
This file is part of FFTS -- The Fastest Fourier Transform in the South
Copyright (c) 2012, Anthony M. Blake <amb@anthonix.com>
Copyright (c) 2012, The University of Waikato
Copyright (c) 2015, Jukka Ojanen <jukka.ojanen@kolumbus.fi>
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the organization nor the
names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL ANTHONY M. BLAKE BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "ffts_real.h"
#include "ffts_internal.h"
#ifdef HAVE_NEON
#include <arm_neon.h>
#elif HAVE_SSE
#include <xmmintrin.h>
#endif
static void
ffts_free_1d_real(ffts_plan_t *p)
{
if (p->B) {
ffts_aligned_free(p->B);
}
if (p->A) {
ffts_aligned_free(p->A);
}
if (p->buf) {
ffts_aligned_free(p->buf);
}
if (p->plans[0]) {
ffts_free(p->plans[0]);
}
free(p);
}
static void
ffts_execute_1d_real(ffts_plan_t *p, const void *input, void *output)
{
float *const FFTS_RESTRICT out =
(float *const FFTS_RESTRICT) FFTS_ASSUME_ALIGNED_16(output);
float *const FFTS_RESTRICT buf =
(float *const FFTS_RESTRICT) FFTS_ASSUME_ALIGNED_32(p->buf);
const float *const FFTS_RESTRICT A =
(const float *const FFTS_RESTRICT) FFTS_ASSUME_ALIGNED_32(p->A);
const float *const FFTS_RESTRICT B =
(const float *const FFTS_RESTRICT) FFTS_ASSUME_ALIGNED_32(p->B);
const int N = (const int) p->N;
int i;
#ifdef __ARM_NEON__
float *p_buf0 = buf;
float *p_buf1 = buf + N - 2;
float *p_out = out;
#endif
/* we know this */
FFTS_ASSUME(N/2 > 0);
p->plans[0]->transform(p->plans[0], input, buf);
buf[N + 0] = buf[0];
buf[N + 1] = buf[1];
#ifdef __ARM_NEON__
for (i = 0; i < N/2; i += 2) {
__asm__ __volatile__ (
"vld1.32 {q8}, [%[pa]]!\n\t"
"vld1.32 {q9}, [%[pb]]!\n\t"
"vld1.32 {q10}, [%[buf0]]!\n\t"
"vld1.32 {q11}, [%[buf1]]\n\t"
"sub %[buf1], %[buf1], #16\n\t"
"vdup.32 d26, d16[1]\n\t"
"vdup.32 d27, d17[1]\n\t"
"vdup.32 d24, d16[0]\n\t"
"vdup.32 d25, d17[0]\n\t"
"vdup.32 d30, d23[1]\n\t"
"vdup.32 d31, d22[1]\n\t"
"vdup.32 d28, d23[0]\n\t"
"vdup.32 d29, d22[0]\n\t"
"vmul.f32 q13, q13, q10\n\t"
"vmul.f32 q15, q15, q9\n\t"
"vmul.f32 q12, q12, q10\n\t"
"vmul.f32 q14, q14, q9\n\t"
"vrev64.f32 q13, q13\n\t"
"vrev64.f32 q15, q15\n\t"
"vtrn.32 d26, d27\n\t"
"vtrn.32 d30, d31\n\t"
"vneg.f32 d26, d26\n\t"
"vneg.f32 d31, d31\n\t"
"vtrn.32 d26, d27\n\t"
"vtrn.32 d30, d31\n\t"
"vadd.f32 q12, q12, q14\n\t"
"vadd.f32 q13, q13, q15\n\t"
"vadd.f32 q12, q12, q13\n\t"
"vst1.32 {q12}, [%[pout]]!\n\t"
: [pa] "+r" (A), [pb] "+r" (B), [buf0] "+r" (p_buf0), [buf1] "+r" (p_buf1),
[pout] "+r" (p_out)
:
: "memory", "q8", "q9", "q10", "q11", "q12", "q13", "q14", "q15"
);
}
#elif HAVE_SSE
if (N < 8) {
for (i = 0; i < N/2; i++) {
out[2*i + 0] =
buf[ 2*i + 0] * A[2*i + 0] - buf[ 2*i + 1] * A[2*i + 1] +
buf[N - 2*i + 0] * B[2*i + 0] + buf[N - 2*i + 1] * B[2*i + 1];
out[2*i + 1] =
buf[ 2*i + 1] * A[2*i + 0] + buf[ 2*i + 0] * A[2*i + 1] +
buf[N - 2*i + 0] * B[2*i + 1] - buf[N - 2*i + 1] * B[2*i + 0];
}
} else {
const __m128 c0 = _mm_set_ps(0.0f, -0.0f, 0.0f, -0.0f);
__m128 t0 = _mm_load_ps(buf);
for (i = 0; i < N; i += 8) {
__m128 t1 = _mm_load_ps(buf + i);
__m128 t2 = _mm_load_ps(buf + N - i - 4);
__m128 t3 = _mm_load_ps(A + i);
__m128 t4 = _mm_load_ps(B + i);
_mm_store_ps(out + i, _mm_add_ps(_mm_add_ps(_mm_add_ps(
_mm_mul_ps(t1, _mm_shuffle_ps(t3, t3, _MM_SHUFFLE(2,2,0,0))),
_mm_mul_ps(_mm_shuffle_ps(t1, t1, _MM_SHUFFLE(2,3,0,1)),
_mm_xor_ps(_mm_shuffle_ps(t3, t3, _MM_SHUFFLE(3,3,1,1)), c0))),
_mm_mul_ps(_mm_shuffle_ps(t0, t2, _MM_SHUFFLE(2,2,0,0)), t4)),
_mm_mul_ps(_mm_shuffle_ps(t0, t2, _MM_SHUFFLE(3,3,1,1)),
_mm_shuffle_ps(_mm_xor_ps(t4, c0), _mm_xor_ps(t4, c0),
_MM_SHUFFLE(2,3,0,1)))));
t0 = _mm_load_ps(buf + N - i - 8);
t1 = _mm_load_ps(buf + i + 4);
t3 = _mm_load_ps(A + i + 4);
t4 = _mm_load_ps(B + i + 4);
_mm_store_ps(out + i + 4, _mm_add_ps(_mm_add_ps(_mm_add_ps(
_mm_mul_ps(t1, _mm_shuffle_ps(t3, t3, _MM_SHUFFLE(2,2,0,0))),
_mm_mul_ps(_mm_shuffle_ps(t1, t1, _MM_SHUFFLE(2,3,0,1)),
_mm_xor_ps(_mm_shuffle_ps(t3, t3, _MM_SHUFFLE(3,3,1,1)), c0))),
_mm_mul_ps(_mm_shuffle_ps(t2, t0, _MM_SHUFFLE(2,2,0,0)), t4)),
_mm_mul_ps(_mm_shuffle_ps(t2, t0, _MM_SHUFFLE(3,3,1,1)),
_mm_shuffle_ps(_mm_xor_ps(t4, c0), _mm_xor_ps(t4, c0),
_MM_SHUFFLE(2,3,0,1)))));
}
}
#else
for (i = 0; i < N/2; i++) {
out[2*i + 0] =
buf[ 2*i + 0] * A[2*i + 0] - buf[ 2*i + 1] * A[2*i + 1] +
buf[N - 2*i + 0] * B[2*i + 0] + buf[N - 2*i + 1] * B[2*i + 1];
out[2*i + 1] =
buf[ 2*i + 1] * A[2*i + 0] + buf[ 2*i + 0] * A[2*i + 1] +
buf[N - 2*i + 0] * B[2*i + 1] - buf[N - 2*i + 1] * B[2*i + 0];
}
#endif
out[N + 0] = buf[0] - buf[1];
out[N + 1] = 0.0f;
}
static void
ffts_execute_1d_real_inv(ffts_plan_t *p, const void *input, void *output)
{
float *const FFTS_RESTRICT in =
(float *const FFTS_RESTRICT) FFTS_ASSUME_ALIGNED_16(input);
float *const FFTS_RESTRICT buf =
(float *const FFTS_RESTRICT) FFTS_ASSUME_ALIGNED_32(p->buf);
const float *const FFTS_RESTRICT A =
(const float *const FFTS_RESTRICT) FFTS_ASSUME_ALIGNED_32(p->A);
const float *const FFTS_RESTRICT B =
(const float *const FFTS_RESTRICT) FFTS_ASSUME_ALIGNED_32(p->B);
const int N = (const int) p->N;
int i;
#ifdef __ARM_NEON__
float *p_buf0 = in;
float *p_buf1 = in + N - 2;
float *p_out = buf;
#endif
/* we know this */
FFTS_ASSUME(N/2 > 0);
#ifdef __ARM_NEON__
for (i = 0; i < N/2; i += 2) {
__asm__ __volatile__ (
"vld1.32 {q8}, [%[pa]]!\n\t"
"vld1.32 {q9}, [%[pb]]!\n\t"
"vld1.32 {q10}, [%[buf0]]!\n\t"
"vld1.32 {q11}, [%[buf1]]\n\t"
"sub %[buf1], %[buf1], #16\n\t"
"vdup.32 d26, d16[1]\n\t"
"vdup.32 d27, d17[1]\n\t"
"vdup.32 d24, d16[0]\n\t"
"vdup.32 d25, d17[0]\n\t"
"vdup.32 d30, d23[1]\n\t"
"vdup.32 d31, d22[1]\n\t"
"vdup.32 d28, d23[0]\n\t"
"vdup.32 d29, d22[0]\n\t"
"vmul.f32 q13, q13, q10\n\t"
"vmul.f32 q15, q15, q9\n\t"
"vmul.f32 q12, q12, q10\n\t"
"vmul.f32 q14, q14, q9\n\t"
"vrev64.f32 q13, q13\n\t"
"vrev64.f32 q15, q15\n\t"
"vtrn.32 d26, d27\n\t"
"vtrn.32 d28, d29\n\t"
"vneg.f32 d27, d27\n\t"
"vneg.f32 d29, d29\n\t"
"vtrn.32 d26, d27\n\t"
"vtrn.32 d28, d29\n\t"
"vadd.f32 q12, q12, q14\n\t"
"vsub.f32 q13, q13, q15\n\t"
"vadd.f32 q12, q12, q13\n\t"
"vst1.32 {q12}, [%[pout]]!\n\t"
: [pa] "+r" (A), [pb] "+r" (B), [buf0] "+r" (p_buf0), [buf1] "+r" (p_buf1),
[pout] "+r" (p_out)
:
: "memory", "q8", "q9", "q10", "q11", "q12", "q13", "q14", "q15"
);
}
#elif HAVE_SSE
if (N < 8) {
for (i = 0; i < N/2; i++) {
buf[2*i + 0] =
in[ 2*i + 0] * A[2*i + 0] + in[ 2*i + 1] * A[2*i + 1] +
in[N - 2*i + 0] * B[2*i + 0] - in[N - 2*i + 1] * B[2*i + 1];
buf[2*i + 1] =
in[ 2*i + 1] * A[2*i + 0] - in[ 2*i + 0] * A[2*i + 1] -
in[N - 2*i + 0] * B[2*i + 1] - in[N - 2*i + 1] * B[2*i + 0];
}
} else {
const __m128 c0 = _mm_set_ps(-0.0f, 0.0f, -0.0f, 0.0f);
__m128 t0 = _mm_loadl_pi(_mm_setzero_ps(), (const __m64*) &in[N]);
for (i = 0; i < N; i += 8) {
__m128 t1 = _mm_load_ps(in + i);
__m128 t2 = _mm_load_ps(in + N - i - 4);
__m128 t3 = _mm_load_ps(A + i);
__m128 t4 = _mm_load_ps(B + i);
_mm_store_ps(buf + i, _mm_add_ps(_mm_sub_ps(_mm_add_ps(
_mm_mul_ps(t1, _mm_shuffle_ps(t3, t3, _MM_SHUFFLE(2,2,0,0))),
_mm_mul_ps(_mm_shuffle_ps(t1, t1, _MM_SHUFFLE(2,3,0,1)),
_mm_xor_ps(_mm_shuffle_ps(t3, t3, _MM_SHUFFLE(3,3,1,1)), c0))),
_mm_mul_ps(_mm_shuffle_ps(t0, t2, _MM_SHUFFLE(3,3,1,1)),
_mm_shuffle_ps(t4, t4, _MM_SHUFFLE(2,3,0,1)))),
_mm_mul_ps(_mm_shuffle_ps(t0, t2, _MM_SHUFFLE(2,2,0,0)),
_mm_xor_ps(t4, c0))));
t0 = _mm_load_ps(in + N - i - 8);
t1 = _mm_load_ps(in + i + 4);
t3 = _mm_load_ps(A + i + 4);
t4 = _mm_load_ps(B + i + 4);
_mm_store_ps(buf + i + 4, _mm_add_ps(_mm_sub_ps(_mm_add_ps(
_mm_mul_ps(t1, _mm_shuffle_ps(t3, t3, _MM_SHUFFLE(2,2,0,0))),
_mm_mul_ps(_mm_shuffle_ps(t1, t1, _MM_SHUFFLE(2,3,0,1)),
_mm_xor_ps(_mm_shuffle_ps(t3, t3, _MM_SHUFFLE(3,3,1,1)), c0))),
_mm_mul_ps(_mm_shuffle_ps(t2, t0, _MM_SHUFFLE(3,3,1,1)),
_mm_shuffle_ps(t4, t4, _MM_SHUFFLE(2,3,0,1)))),
_mm_mul_ps(_mm_shuffle_ps(t2, t0, _MM_SHUFFLE(2,2,0,0)),
_mm_xor_ps(t4, c0))));
}
}
#else
for (i = 0; i < N/2; i++) {
buf[2*i + 0] =
in[ 2*i + 0] * A[2*i + 0] + in[ 2*i + 1] * A[2*i + 1] +
in[N - 2*i + 0] * B[2*i + 0] - in[N - 2*i + 1] * B[2*i + 1];
buf[2*i + 1] =
in[ 2*i + 1] * A[2*i + 0] - in[ 2*i + 0] * A[2*i + 1] -
in[N - 2*i + 0] * B[2*i + 1] - in[N - 2*i + 1] * B[2*i + 0];
}
#endif
p->plans[0]->transform(p->plans[0], buf, output);
}
ffts_plan_t*
ffts_init_1d_real(size_t N, int sign)
{
ffts_plan_t *p;
size_t i;
p = (ffts_plan_t*) calloc(1, sizeof(*p) + sizeof(*p->plans));
if (!p) {
return NULL;
}
if (sign < 0) {
p->transform = &ffts_execute_1d_real;
} else {
p->transform = &ffts_execute_1d_real_inv;
}
p->destroy = &ffts_free_1d_real;
p->N = N;
p->rank = 1;
p->plans = (ffts_plan_t**) &p[1];
p->plans[0] = ffts_init_1d(N/2, sign);
if (!p->plans[0]) {
goto cleanup;
}
p->buf = ffts_aligned_malloc(2 * ((N/2) + 1) * sizeof(float));
if (!p->buf) {
goto cleanup;
}
p->A = (float*) ffts_aligned_malloc(N * sizeof(float));
if (!p->A) {
goto cleanup;
}
p->B = (float*) ffts_aligned_malloc(N * sizeof(float));
if (!p->B) {
goto cleanup;
}
if (sign < 0) {
for (i = 0; i < N/2; i++) {
p->A[2 * i + 0] = (float) (0.5 * ( 1.0 - sin(2.0 * M_PI / (double) N * (double) i)));
p->A[2 * i + 1] = (float) (0.5 * (-1.0 * cos(2.0 * M_PI / (double) N * (double) i)));
p->B[2 * i + 0] = (float) (0.5 * ( 1.0 + sin(2.0 * M_PI / (double) N * (double) i)));
p->B[2 * i + 1] = (float) (0.5 * ( 1.0 * cos(2.0 * M_PI / (double) N * (double) i)));
}
} else {
for (i = 0; i < N/2; i++) {
p->A[2 * i + 0] = (float) (1.0 * ( 1.0 - sin(2.0 * M_PI / (double) N * (double) i)));
p->A[2 * i + 1] = (float) (1.0 * (-1.0 * cos(2.0 * M_PI / (double) N * (double) i)));
p->B[2 * i + 0] = (float) (1.0 * ( 1.0 + sin(2.0 * M_PI / (double) N * (double) i)));
p->B[2 * i + 1] = (float) (1.0 * ( 1.0 * cos(2.0 * M_PI / (double) N * (double) i)));
}
}
return p;
cleanup:
ffts_free_1d_real(p);
return NULL;
}
|
