annotate constant-q-cpp/src/ext/kissfft/test/test_real.c @ 372:af71cbdab621 tip

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