annotate src/ext/kissfft/test/test_real.c @ 196:da283326bcd3 tip master

Update plugin versions in RDF
author Chris Cannam <cannam@all-day-breakfast.com>
date Fri, 28 Feb 2020 09:43:02 +0000
parents 5ed6e970541b
children
rev   line source
c@174 1 #include "kiss_fftr.h"
c@174 2 #include "_kiss_fft_guts.h"
c@174 3 #include <sys/times.h>
c@174 4 #include <time.h>
c@174 5 #include <unistd.h>
c@174 6
c@174 7 static double cputime(void)
c@174 8 {
c@174 9 struct tms t;
c@174 10 times(&t);
c@174 11 return (double)(t.tms_utime + t.tms_stime)/ sysconf(_SC_CLK_TCK) ;
c@174 12 }
c@174 13
c@174 14 static
c@174 15 kiss_fft_scalar rand_scalar(void)
c@174 16 {
c@174 17 #ifdef USE_SIMD
c@174 18 return _mm_set1_ps(rand()-RAND_MAX/2);
c@174 19 #else
c@174 20 kiss_fft_scalar s = (kiss_fft_scalar)(rand() -RAND_MAX/2);
c@174 21 return s/2;
c@174 22 #endif
c@174 23 }
c@174 24
c@174 25 static
c@174 26 double snr_compare( kiss_fft_cpx * vec1,kiss_fft_cpx * vec2, int n)
c@174 27 {
c@174 28 int k;
c@174 29 double sigpow=1e-10,noisepow=1e-10,err,snr,scale=0;
c@174 30
c@174 31 #ifdef USE_SIMD
c@174 32 float *fv1 = (float*)vec1;
c@174 33 float *fv2 = (float*)vec2;
c@174 34 for (k=0;k<8*n;++k) {
c@174 35 sigpow += *fv1 * *fv1;
c@174 36 err = *fv1 - *fv2;
c@174 37 noisepow += err*err;
c@174 38 ++fv1;
c@174 39 ++fv2;
c@174 40 }
c@174 41 #else
c@174 42 for (k=0;k<n;++k) {
c@174 43 sigpow += (double)vec1[k].r * (double)vec1[k].r +
c@174 44 (double)vec1[k].i * (double)vec1[k].i;
c@174 45 err = (double)vec1[k].r - (double)vec2[k].r;
c@174 46 noisepow += err * err;
c@174 47 err = (double)vec1[k].i - (double)vec2[k].i;
c@174 48 noisepow += err * err;
c@174 49
c@174 50 if (vec1[k].r)
c@174 51 scale +=(double) vec2[k].r / (double)vec1[k].r;
c@174 52 }
c@174 53 #endif
c@174 54 snr = 10*log10( sigpow / noisepow );
c@174 55 scale /= n;
c@174 56 if (snr<10) {
c@174 57 printf( "\npoor snr, try a scaling factor %f\n" , scale );
c@174 58 exit(1);
c@174 59 }
c@174 60 return snr;
c@174 61 }
c@174 62
c@174 63 #ifndef NUMFFTS
c@174 64 #define NUMFFTS 10000
c@174 65 #endif
c@174 66
c@174 67
c@174 68 int main(int argc,char ** argv)
c@174 69 {
c@174 70 int nfft = 8*3*5;
c@174 71 double ts,tfft,trfft;
c@174 72 int i;
c@174 73 if (argc>1)
c@174 74 nfft = atoi(argv[1]);
c@174 75 kiss_fft_cpx cin[nfft];
c@174 76 kiss_fft_cpx cout[nfft];
c@174 77 kiss_fft_cpx sout[nfft];
c@174 78 kiss_fft_cfg kiss_fft_state;
c@174 79 kiss_fftr_cfg kiss_fftr_state;
c@174 80
c@174 81 kiss_fft_scalar rin[nfft+2];
c@174 82 kiss_fft_scalar rout[nfft+2];
c@174 83 kiss_fft_scalar zero;
c@174 84 memset(&zero,0,sizeof(zero) ); // ugly way of setting short,int,float,double, or __m128 to zero
c@174 85
c@174 86 srand(time(0));
c@174 87
c@174 88 for (i=0;i<nfft;++i) {
c@174 89 rin[i] = rand_scalar();
c@174 90 cin[i].r = rin[i];
c@174 91 cin[i].i = zero;
c@174 92 }
c@174 93
c@174 94 kiss_fft_state = kiss_fft_alloc(nfft,0,0,0);
c@174 95 kiss_fftr_state = kiss_fftr_alloc(nfft,0,0,0);
c@174 96 kiss_fft(kiss_fft_state,cin,cout);
c@174 97 kiss_fftr(kiss_fftr_state,rin,sout);
c@174 98 /*
c@174 99 printf(" results from kiss_fft : (%f,%f), (%f,%f), (%f,%f) ...\n "
c@174 100 , (float)cout[0].r , (float)cout[0].i
c@174 101 , (float)cout[1].r , (float)cout[1].i
c@174 102 , (float)cout[2].r , (float)cout[2].i);
c@174 103 printf(" results from kiss_fftr: (%f,%f), (%f,%f), (%f,%f) ...\n "
c@174 104 , (float)sout[0].r , (float)sout[0].i
c@174 105 , (float)sout[1].r , (float)sout[1].i
c@174 106 , (float)sout[2].r , (float)sout[2].i);
c@174 107 */
c@174 108
c@174 109 printf( "nfft=%d, inverse=%d, snr=%g\n",
c@174 110 nfft,0, snr_compare(cout,sout,(nfft/2)+1) );
c@174 111 ts = cputime();
c@174 112 for (i=0;i<NUMFFTS;++i) {
c@174 113 kiss_fft(kiss_fft_state,cin,cout);
c@174 114 }
c@174 115 tfft = cputime() - ts;
c@174 116
c@174 117 ts = cputime();
c@174 118 for (i=0;i<NUMFFTS;++i) {
c@174 119 kiss_fftr( kiss_fftr_state, rin, cout );
c@174 120 /* kiss_fftri(kiss_fftr_state,cout,rin); */
c@174 121 }
c@174 122 trfft = cputime() - ts;
c@174 123
c@174 124 printf("%d complex ffts took %gs, real took %gs\n",NUMFFTS,tfft,trfft);
c@174 125
c@174 126 free(kiss_fft_state);
c@174 127 free(kiss_fftr_state);
c@174 128
c@174 129 kiss_fft_state = kiss_fft_alloc(nfft,1,0,0);
c@174 130 kiss_fftr_state = kiss_fftr_alloc(nfft,1,0,0);
c@174 131
c@174 132 memset(cin,0,sizeof(cin));
c@174 133 #if 1
c@174 134 for (i=1;i< nfft/2;++i) {
c@174 135 //cin[i].r = (kiss_fft_scalar)(rand()-RAND_MAX/2);
c@174 136 cin[i].r = rand_scalar();
c@174 137 cin[i].i = rand_scalar();
c@174 138 }
c@174 139 #else
c@174 140 cin[0].r = 12000;
c@174 141 cin[3].r = 12000;
c@174 142 cin[nfft/2].r = 12000;
c@174 143 #endif
c@174 144
c@174 145 // conjugate symmetry of real signal
c@174 146 for (i=1;i< nfft/2;++i) {
c@174 147 cin[nfft-i].r = cin[i].r;
c@174 148 cin[nfft-i].i = - cin[i].i;
c@174 149 }
c@174 150
c@174 151 kiss_fft(kiss_fft_state,cin,cout);
c@174 152 kiss_fftri(kiss_fftr_state,cin,rout);
c@174 153 /*
c@174 154 printf(" results from inverse kiss_fft : (%f,%f), (%f,%f), (%f,%f), (%f,%f), (%f,%f) ...\n "
c@174 155 , (float)cout[0].r , (float)cout[0].i , (float)cout[1].r , (float)cout[1].i , (float)cout[2].r , (float)cout[2].i , (float)cout[3].r , (float)cout[3].i , (float)cout[4].r , (float)cout[4].i
c@174 156 );
c@174 157
c@174 158 printf(" results from inverse kiss_fftr: %f,%f,%f,%f,%f ... \n"
c@174 159 ,(float)rout[0] ,(float)rout[1] ,(float)rout[2] ,(float)rout[3] ,(float)rout[4]);
c@174 160 */
c@174 161 for (i=0;i<nfft;++i) {
c@174 162 sout[i].r = rout[i];
c@174 163 sout[i].i = zero;
c@174 164 }
c@174 165
c@174 166 printf( "nfft=%d, inverse=%d, snr=%g\n",
c@174 167 nfft,1, snr_compare(cout,sout,nfft/2) );
c@174 168 free(kiss_fft_state);
c@174 169 free(kiss_fftr_state);
c@174 170
c@174 171 return 0;
c@174 172 }