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.

48 lines
1.5KB

  1. /*
  2. * This file is part of Libav.
  3. *
  4. * Libav is free software; you can redistribute it and/or
  5. * modify it under the terms of the GNU Lesser General Public
  6. * License as published by the Free Software Foundation; either
  7. * version 2.1 of the License, or (at your option) any later version.
  8. *
  9. * Libav is distributed in the hope that it will be useful,
  10. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  12. * Lesser General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU Lesser General Public
  15. * License along with Libav; if not, write to the Free Software
  16. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  17. */
  18. #include <assert.h>
  19. #include "libavutil/mathematics.h"
  20. #include "libavutil/attributes.h"
  21. #include "kbdwin.h"
  22. #define BESSEL_I0_ITER 50 // default: 50 iterations of Bessel I0 approximation
  23. av_cold void ff_kbd_window_init(float *window, float alpha, int n)
  24. {
  25. int i, j;
  26. double sum = 0.0, bessel, tmp;
  27. double local_window[FF_KBD_WINDOW_MAX];
  28. double alpha2 = (alpha * M_PI / n) * (alpha * M_PI / n);
  29. assert(n <= FF_KBD_WINDOW_MAX);
  30. for (i = 0; i < n; i++) {
  31. tmp = i * (n - i) * alpha2;
  32. bessel = 1.0;
  33. for (j = BESSEL_I0_ITER; j > 0; j--)
  34. bessel = bessel * tmp / (j * j) + 1;
  35. sum += bessel;
  36. local_window[i] = sum;
  37. }
  38. sum++;
  39. for (i = 0; i < n; i++)
  40. window[i] = sqrt(local_window[i] / sum);
  41. }