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.

274 lines
6.2KB

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