You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

278 lines
6.3KB

  1. /**
  2. * @file fft-test.c
  3. * FFT and MDCT tests.
  4. */
  5. #include "dsputil.h"
  6. #include <math.h>
  7. #include <unistd.h>
  8. #include <sys/time.h>
  9. int mm_flags;
  10. /* reference fft */
  11. #define MUL16(a,b) ((a) * (b))
  12. #define CMAC(pre, pim, are, aim, bre, bim) \
  13. {\
  14. pre += (MUL16(are, bre) - MUL16(aim, bim));\
  15. pim += (MUL16(are, bim) + MUL16(bre, aim));\
  16. }
  17. FFTComplex *exptab;
  18. void fft_ref_init(int nbits, int inverse)
  19. {
  20. int n, i;
  21. float c1, s1, alpha;
  22. n = 1 << nbits;
  23. exptab = av_malloc((n / 2) * sizeof(FFTComplex));
  24. for(i=0;i<(n/2);i++) {
  25. alpha = 2 * M_PI * (float)i / (float)n;
  26. c1 = cos(alpha);
  27. s1 = sin(alpha);
  28. if (!inverse)
  29. s1 = -s1;
  30. exptab[i].re = c1;
  31. exptab[i].im = s1;
  32. }
  33. }
  34. void fft_ref(FFTComplex *tabr, FFTComplex *tab, int nbits)
  35. {
  36. int n, i, j, k, n2;
  37. float tmp_re, tmp_im, s, c;
  38. FFTComplex *q;
  39. n = 1 << nbits;
  40. n2 = n >> 1;
  41. for(i=0;i<n;i++) {
  42. tmp_re = 0;
  43. tmp_im = 0;
  44. q = tab;
  45. for(j=0;j<n;j++) {
  46. k = (i * j) & (n - 1);
  47. if (k >= n2) {
  48. c = -exptab[k - n2].re;
  49. s = -exptab[k - n2].im;
  50. } else {
  51. c = exptab[k].re;
  52. s = exptab[k].im;
  53. }
  54. CMAC(tmp_re, tmp_im, c, s, q->re, q->im);
  55. q++;
  56. }
  57. tabr[i].re = tmp_re;
  58. tabr[i].im = tmp_im;
  59. }
  60. }
  61. void imdct_ref(float *out, float *in, int n)
  62. {
  63. int k, i, a;
  64. float sum, f;
  65. for(i=0;i<n;i++) {
  66. sum = 0;
  67. for(k=0;k<n/2;k++) {
  68. a = (2 * i + 1 + (n / 2)) * (2 * k + 1);
  69. f = cos(M_PI * a / (double)(2 * n));
  70. sum += f * in[k];
  71. }
  72. out[i] = -sum;
  73. }
  74. }
  75. /* NOTE: no normalisation by 1 / N is done */
  76. void mdct_ref(float *output, float *input, int n)
  77. {
  78. int k, i;
  79. float a, s;
  80. /* do it by hand */
  81. for(k=0;k<n/2;k++) {
  82. s = 0;
  83. for(i=0;i<n;i++) {
  84. a = (2*M_PI*(2*i+1+n/2)*(2*k+1) / (4 * n));
  85. s += input[i] * cos(a);
  86. }
  87. output[k] = s;
  88. }
  89. }
  90. float frandom(void)
  91. {
  92. return (float)((random() & 0xffff) - 32768) / 32768.0;
  93. }
  94. int64_t gettime(void)
  95. {
  96. struct timeval tv;
  97. gettimeofday(&tv,NULL);
  98. return (int64_t)tv.tv_sec * 1000000 + tv.tv_usec;
  99. }
  100. void check_diff(float *tab1, float *tab2, int n)
  101. {
  102. int i;
  103. for(i=0;i<n;i++) {
  104. if (fabsf(tab1[i] - tab2[i]) >= 1e-3) {
  105. printf("ERROR %d: %f %f\n",
  106. i, tab1[i], tab2[i]);
  107. }
  108. }
  109. }
  110. void help(void)
  111. {
  112. printf("usage: fft-test [-h] [-s] [-i] [-n b]\n"
  113. "-h print this help\n"
  114. "-s speed test\n"
  115. "-m (I)MDCT test\n"
  116. "-i inverse transform test\n"
  117. "-n b set the transform size to 2^b\n"
  118. );
  119. exit(1);
  120. }
  121. int main(int argc, char **argv)
  122. {
  123. FFTComplex *tab, *tab1, *tab_ref;
  124. FFTSample *tabtmp, *tab2;
  125. int it, i, c;
  126. int do_speed = 0;
  127. int do_mdct = 0;
  128. int do_inverse = 0;
  129. FFTContext s1, *s = &s1;
  130. MDCTContext m1, *m = &m1;
  131. int fft_nbits, fft_size;
  132. mm_flags = 0;
  133. fft_nbits = 9;
  134. for(;;) {
  135. c = getopt(argc, argv, "hsimn:");
  136. if (c == -1)
  137. break;
  138. switch(c) {
  139. case 'h':
  140. help();
  141. break;
  142. case 's':
  143. do_speed = 1;
  144. break;
  145. case 'i':
  146. do_inverse = 1;
  147. break;
  148. case 'm':
  149. do_mdct = 1;
  150. break;
  151. case 'n':
  152. fft_nbits = atoi(optarg);
  153. break;
  154. }
  155. }
  156. fft_size = 1 << fft_nbits;
  157. tab = av_malloc(fft_size * sizeof(FFTComplex));
  158. tab1 = av_malloc(fft_size * sizeof(FFTComplex));
  159. tab_ref = av_malloc(fft_size * sizeof(FFTComplex));
  160. tabtmp = av_malloc(fft_size / 2 * sizeof(FFTSample));
  161. tab2 = av_malloc(fft_size * sizeof(FFTSample));
  162. if (do_mdct) {
  163. if (do_inverse)
  164. printf("IMDCT");
  165. else
  166. printf("MDCT");
  167. ff_mdct_init(m, fft_nbits, do_inverse);
  168. } else {
  169. if (do_inverse)
  170. printf("IFFT");
  171. else
  172. printf("FFT");
  173. ff_fft_init(s, fft_nbits, do_inverse);
  174. fft_ref_init(fft_nbits, do_inverse);
  175. }
  176. printf(" %d test\n", fft_size);
  177. /* generate random data */
  178. for(i=0;i<fft_size;i++) {
  179. tab1[i].re = frandom();
  180. tab1[i].im = frandom();
  181. }
  182. /* checking result */
  183. printf("Checking...\n");
  184. if (do_mdct) {
  185. if (do_inverse) {
  186. imdct_ref((float *)tab_ref, (float *)tab1, fft_size);
  187. ff_imdct_calc(m, tab2, (float *)tab1, tabtmp);
  188. check_diff((float *)tab_ref, tab2, fft_size);
  189. } else {
  190. mdct_ref((float *)tab_ref, (float *)tab1, fft_size);
  191. ff_mdct_calc(m, tab2, (float *)tab1, tabtmp);
  192. check_diff((float *)tab_ref, tab2, fft_size / 2);
  193. }
  194. } else {
  195. memcpy(tab, tab1, fft_size * sizeof(FFTComplex));
  196. ff_fft_permute(s, tab);
  197. ff_fft_calc(s, tab);
  198. fft_ref(tab_ref, tab1, fft_nbits);
  199. check_diff((float *)tab_ref, (float *)tab, fft_size * 2);
  200. }
  201. /* do a speed test */
  202. if (do_speed) {
  203. int64_t time_start, duration;
  204. int nb_its;
  205. printf("Speed test...\n");
  206. /* we measure during about 1 seconds */
  207. nb_its = 1;
  208. for(;;) {
  209. time_start = gettime();
  210. for(it=0;it<nb_its;it++) {
  211. if (do_mdct) {
  212. if (do_inverse) {
  213. ff_imdct_calc(m, (float *)tab, (float *)tab1, tabtmp);
  214. } else {
  215. ff_mdct_calc(m, (float *)tab, (float *)tab1, tabtmp);
  216. }
  217. } else {
  218. memcpy(tab, tab1, fft_size * sizeof(FFTComplex));
  219. ff_fft_calc(s, tab);
  220. }
  221. }
  222. duration = gettime() - time_start;
  223. if (duration >= 1000000)
  224. break;
  225. nb_its *= 2;
  226. }
  227. printf("time: %0.1f us/transform [total time=%0.2f s its=%d]\n",
  228. (double)duration / nb_its,
  229. (double)duration / 1000000.0,
  230. nb_its);
  231. }
  232. if (do_mdct) {
  233. ff_mdct_end(m);
  234. } else {
  235. ff_fft_end(s);
  236. }
  237. return 0;
  238. }