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