annotate ext/kissfft/test/test_real.c @ 409:1f1999b0f577

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