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.

141 lines
3.5KB

  1. /*
  2. * (I)DCT Transforms
  3. * Copyright (c) 2009 Peter Ross <pross@xvid.org>
  4. * Copyright (c) 2010 Alex Converse <alex.converse@gmail.com>
  5. * Copyright (c) 2010 Vitor Sessak
  6. *
  7. * This file is part of FFmpeg.
  8. *
  9. * FFmpeg is free software; you can redistribute it and/or
  10. * modify it under the terms of the GNU Lesser General Public
  11. * License as published by the Free Software Foundation; either
  12. * version 2.1 of the License, or (at your option) any later version.
  13. *
  14. * FFmpeg is distributed in the hope that it will be useful,
  15. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  16. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  17. * Lesser General Public License for more details.
  18. *
  19. * You should have received a copy of the GNU Lesser General Public
  20. * License along with FFmpeg; if not, write to the Free Software
  21. * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  22. */
  23. /**
  24. * @file libavcodec/dct.c
  25. * (Inverse) Discrete Cosine Transforms. These are also known as the
  26. * type II and type III DCTs respectively.
  27. */
  28. #include <math.h>
  29. #include "libavutil/mathematics.h"
  30. #include "fft.h"
  31. av_cold int ff_dct_init(DCTContext *s, int nbits, int inverse)
  32. {
  33. int n = 1 << nbits;
  34. int i;
  35. s->nbits = nbits;
  36. s->inverse = inverse;
  37. ff_init_ff_cos_tabs(nbits+2);
  38. s->costab = ff_cos_tabs[nbits+2];
  39. s->csc2 = av_malloc(n/2 * sizeof(FFTSample));
  40. if (ff_rdft_init(&s->rdft, nbits, inverse) < 0) {
  41. av_free(s->csc2);
  42. return -1;
  43. }
  44. for (i = 0; i < n/2; i++)
  45. s->csc2[i] = 0.5 / sin((M_PI / (2*n) * (2*i + 1)));
  46. return 0;
  47. }
  48. /* sin((M_PI * x / (2*n)) */
  49. #define SIN(s,n,x) (s->costab[(n) - (x)])
  50. /* cos((M_PI * x / (2*n)) */
  51. #define COS(s,n,x) (s->costab[x])
  52. static void ff_dct_calc_c(DCTContext *ctx, FFTSample *data)
  53. {
  54. int n = 1 << ctx->nbits;
  55. int i;
  56. if (ctx->inverse) {
  57. float next = data[n - 1];
  58. float inv_n = 1.0f / n;
  59. for (i = n - 2; i >= 2; i -= 2) {
  60. float val1 = data[i ];
  61. float val2 = data[i - 1] - data[i + 1];
  62. float c = COS(ctx, n, i);
  63. float s = SIN(ctx, n, i);
  64. data[i ] = c * val1 + s * val2;
  65. data[i + 1] = s * val1 - c * val2;
  66. }
  67. data[1] = 2 * next;
  68. ff_rdft_calc(&ctx->rdft, data);
  69. for (i = 0; i < n / 2; i++) {
  70. float tmp1 = data[i ] * inv_n;
  71. float tmp2 = data[n - i - 1] * inv_n;
  72. float csc = ctx->csc2[i] * (tmp1 - tmp2);
  73. tmp1 += tmp2;
  74. data[i ] = tmp1 + csc;
  75. data[n - i - 1] = tmp1 - csc;
  76. }
  77. } else {
  78. float next;
  79. for (i=0; i < n/2; i++) {
  80. float tmp1 = data[i ];
  81. float tmp2 = data[n - i - 1];
  82. float s = SIN(ctx, n, 2*i + 1);
  83. s *= tmp1 - tmp2;
  84. tmp1 = (tmp1 + tmp2) * 0.5f;
  85. data[i ] = tmp1 + s;
  86. data[n-i-1] = tmp1 - s;
  87. }
  88. ff_rdft_calc(&ctx->rdft, data);
  89. next = data[1] * 0.5;
  90. data[1] *= -1;
  91. for (i = n - 2; i >= 0; i -= 2) {
  92. float inr = data[i ];
  93. float ini = data[i + 1];
  94. float c = COS(ctx, n, i);
  95. float s = SIN(ctx, n, i);
  96. data[i ] = c * inr + s * ini;
  97. data[i+1] = next;
  98. next += s * inr - c * ini;
  99. }
  100. }
  101. }
  102. void ff_dct_calc(DCTContext *s, FFTSample *data)
  103. {
  104. ff_dct_calc_c(s, data);
  105. }
  106. av_cold void ff_dct_end(DCTContext *s)
  107. {
  108. ff_rdft_end(&s->rdft);
  109. av_free(s->csc2);
  110. }