diff options
author | dcherednik <dcherednik@white> | 2018-10-31 01:36:50 +0300 |
---|---|---|
committer | Daniil Cherednik <dan.cherednik@gmail.com> | 2018-11-02 01:54:36 +0300 |
commit | ea08660cc9e28a44a1512a5a56f85e7258d9832d (patch) | |
tree | afce45813f3d0816326a6e12fb2cb996c5bb2d82 /src/3rd/kissfft/test/test_vs_dft.c | |
download | libgha-ea08660cc9e28a44a1512a5a56f85e7258d9832d.tar.gz |
First commit
- Method to get parameters of one harmonic
Diffstat (limited to 'src/3rd/kissfft/test/test_vs_dft.c')
-rw-r--r-- | src/3rd/kissfft/test/test_vs_dft.c | 81 |
1 files changed, 81 insertions, 0 deletions
diff --git a/src/3rd/kissfft/test/test_vs_dft.c b/src/3rd/kissfft/test/test_vs_dft.c new file mode 100644 index 0000000..9a44129 --- /dev/null +++ b/src/3rd/kissfft/test/test_vs_dft.c @@ -0,0 +1,81 @@ +/* + * Copyright (c) 2003-2010, Mark Borgerding. All rights reserved. + * This file is part of KISS FFT - https://github.com/mborgerding/kissfft + * + * SPDX-License-Identifier: BSD-3-Clause + * See COPYING file for more information. + */ +#include "kiss_fft.h" + + +void check(kiss_fft_cpx * in,kiss_fft_cpx * out,int nfft,int isinverse) +{ + int bin,k; + double errpow=0,sigpow=0; + + for (bin=0;bin<nfft;++bin) { + double ansr = 0; + double ansi = 0; + double difr; + double difi; + + for (k=0;k<nfft;++k) { + double phase = -2*M_PI*bin*k/nfft; + double re = cos(phase); + double im = sin(phase); + if (isinverse) + im = -im; + +#ifdef FIXED_POINT + re /= nfft; + im /= nfft; +#endif + + ansr += in[k].r * re - in[k].i * im; + ansi += in[k].r * im + in[k].i * re; + } + difr = ansr - out[bin].r; + difi = ansi - out[bin].i; + errpow += difr*difr + difi*difi; + sigpow += ansr*ansr+ansi*ansi; + } + printf("nfft=%d inverse=%d,snr = %f\n",nfft,isinverse,10*log10(sigpow/errpow) ); +} + +void test1d(int nfft,int isinverse) +{ + size_t buflen = sizeof(kiss_fft_cpx)*nfft; + + kiss_fft_cpx * in = (kiss_fft_cpx*)malloc(buflen); + kiss_fft_cpx * out= (kiss_fft_cpx*)malloc(buflen); + kiss_fft_cfg cfg = kiss_fft_alloc(nfft,isinverse,0,0); + int k; + + for (k=0;k<nfft;++k) { + in[k].r = (rand() % 65536) - 32768; + in[k].i = (rand() % 65536) - 32768; + } + + kiss_fft(cfg,in,out); + + check(in,out,nfft,isinverse); + + free(in); + free(out); + free(cfg); +} + +int main(int argc,char ** argv) +{ + if (argc>1) { + int k; + for (k=1;k<argc;++k) { + test1d(atoi(argv[k]),0); + test1d(atoi(argv[k]),1); + } + }else{ + test1d(32,0); + test1d(32,1); + } + return 0; +} |