jkl1337/EcgSynKit
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Squashed 'FFTS/Sources/FFTS/' content from commit d11c3e7

Browse Source 
git-subtree-dir: FFTS/Sources/FFTS
git-subtree-split: d11c3e76200e619d35e2d898a28a1c5641a366f4
This commit is contained in:
John K. Luebs
2024-10-25 21:05:50 -05:00
commit 535f02ff99
152 changed files with 88392 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

192
tests/test.c Normal file
View File

@@ -0,0 +1,192 @@
/*
This file is part of FFTS.
Copyright (c) 2012, Anthony M. Blake
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 "../include/ffts.h"
#include "../src/ffts_attributes.h"
#ifdef __ARM_NEON__
#endif
#ifdef HAVE_SSE
#include <xmmintrin.h>
#endif
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#ifndef M_PI
#define M_PI 3.1415926535897932384626433832795028841971693993751058209
#endif
static float impulse_error(int N, int sign, float *data)
{
#ifdef __ANDROID__
double delta_sum = 0.0f;
double sum = 0.0f;
#else
long double delta_sum = 0.0f;
long double sum = 0.0f;
#endif
int i;
for (i = 0; i < N; i++) {
#ifdef __ANDROID__
double re, im;
if (sign < 0) {
re = cos(2 * M_PI * (double) i / (double) N);
im = -sin(2 * M_PI * (double) i / (double) N);
} else {
re = cos(2 * M_PI * (double) i / (double) N);
im = sin(2 * M_PI * (double) i / (double) N);
}
#else
long double re, im;
if (sign < 0) {
re = cosl(2 * M_PI * (long double) i / (long double) N);
im = -sinl(2 * M_PI * (long double) i / (long double) N);
} else {
re = cosl(2 * M_PI * (long double) i / (long double) N);
im = sinl(2 * M_PI * (long double) i / (long double) N);
}
#endif
sum += re * re + im * im;
re = re - data[2*i];
im = im - data[2*i+1];
delta_sum += re * re + im * im;
}
#ifdef __ANDROID__
return (float) (sqrt(delta_sum) / sqrt(sum));
#else
return (float) (sqrtl(delta_sum) / sqrtl(sum));
#endif
}
int test_transform(int n, int sign)
{
ffts_plan_t *p;
#ifdef HAVE_SSE
float FFTS_ALIGN(32) *input = _mm_malloc(2 * n * sizeof(float), 32);
float FFTS_ALIGN(32) *output = _mm_malloc(2 * n * sizeof(float), 32);
#else
float FFTS_ALIGN(32) *input = valloc(2 * n * sizeof(float));
float FFTS_ALIGN(32) *output = valloc(2 * n * sizeof(float));
#endif
int i;
for (i = 0; i < n; i++) {
input[2*i + 0] = 0.0f;
input[2*i + 1] = 0.0f;
}
input[2] = 1.0f;
p = ffts_init_1d(i, sign);
if (!p) {
printf("Plan unsupported\n");
return 0;
}
ffts_execute(p, input, output);
printf(" %3d | %9d | %10E\n", sign, n, impulse_error(n, sign, output));
ffts_free(p);
return 1;
}
int main(int argc, char *argv[])
{
if (argc == 3) {
ffts_plan_t *p;
int i;
/* test specific transform with test pattern and display output */
int n = atoi(argv[1]);
int sign = atoi(argv[2]);
#ifdef HAVE_SSE
float FFTS_ALIGN(32) *input = _mm_malloc(2 * n * sizeof(float), 32);
float FFTS_ALIGN(32) *output = _mm_malloc(2 * n * sizeof(float), 32);
#else
float FFTS_ALIGN(32) *input = valloc(2 * n * sizeof(float));
float FFTS_ALIGN(32) *output = valloc(2 * n * sizeof(float));
#endif
for (i = 0; i < n; i++) {
input[2*i + 0] = (float) i;
input[2*i + 1] = 0.0f;
}
/* input[2] = 1.0f; */
p = ffts_init_1d(i, sign);
if (!p) {
printf("Plan unsupported\n");
return 0;
}
ffts_execute(p, input, output);
for (i = 0; i < n; i++)
printf("%d %d %f %f\n", i, sign, output[2*i], output[2*i+1]);
ffts_free(p);
#ifdef HAVE_SSE
_mm_free(input);
_mm_free(output);
#else
free(input);
free(output);
#endif
} else {
int n, power2;
/* test various sizes and display error */
printf(" Sign | Size | L2 Error\n");
printf("------+-----------+-------------\n");
for (n = 1, power2 = 2; n <= 18; n++, power2 <<= 1) {
test_transform(power2, -1);
}
for (n = 1, power2 = 2; n <= 18; n++, power2 <<= 1) {
test_transform(power2, 1);
}
}
return 0;
}