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.

151 lines
4.9KB

  1. /*
  2. * Delay Locked Loop based time filter
  3. * Copyright (c) 2009 Samalyse
  4. * Copyright (c) 2009 Michael Niedermayer
  5. * Author: Olivier Guilyardi <olivier samalyse com>
  6. * Michael Niedermayer <michaelni gmx at>
  7. *
  8. * This file is part of Libav.
  9. *
  10. * Libav is free software; you can redistribute it and/or
  11. * modify it under the terms of the GNU Lesser General Public
  12. * License as published by the Free Software Foundation; either
  13. * version 2.1 of the License, or (at your option) any later version.
  14. *
  15. * Libav is distributed in the hope that it will be useful,
  16. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  17. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  18. * Lesser General Public License for more details.
  19. *
  20. * You should have received a copy of the GNU Lesser General Public
  21. * License along with Libav; if not, write to the Free Software
  22. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  23. */
  24. #include "libavutil/common.h"
  25. #include "libavutil/mem.h"
  26. #include "config.h"
  27. #include "timefilter.h"
  28. struct TimeFilter {
  29. // Delay Locked Loop data. These variables refer to mathematical
  30. // concepts described in: http://www.kokkinizita.net/papers/usingdll.pdf
  31. double cycle_time;
  32. double feedback2_factor;
  33. double feedback3_factor;
  34. double clock_period;
  35. int count;
  36. };
  37. TimeFilter *ff_timefilter_new(double clock_period,
  38. double feedback2_factor,
  39. double feedback3_factor)
  40. {
  41. TimeFilter *self = av_mallocz(sizeof(TimeFilter));
  42. if (!self)
  43. return NULL;
  44. self->clock_period = clock_period;
  45. self->feedback2_factor = feedback2_factor;
  46. self->feedback3_factor = feedback3_factor;
  47. return self;
  48. }
  49. void ff_timefilter_destroy(TimeFilter *self)
  50. {
  51. av_freep(&self);
  52. }
  53. void ff_timefilter_reset(TimeFilter *self)
  54. {
  55. self->count = 0;
  56. }
  57. double ff_timefilter_update(TimeFilter *self, double system_time, double period)
  58. {
  59. self->count++;
  60. if (self->count == 1) {
  61. self->cycle_time = system_time;
  62. } else {
  63. double loop_error;
  64. self->cycle_time += self->clock_period * period;
  65. loop_error = system_time - self->cycle_time;
  66. self->cycle_time += FFMAX(self->feedback2_factor, 1.0 / self->count) * loop_error;
  67. self->clock_period += self->feedback3_factor * loop_error / period;
  68. }
  69. return self->cycle_time;
  70. }
  71. #ifdef TEST
  72. #include "libavutil/lfg.h"
  73. #define LFG_MAX ((1LL << 32) - 1)
  74. int main(void)
  75. {
  76. AVLFG prng;
  77. double n0, n1;
  78. #define SAMPLES 1000
  79. double ideal[SAMPLES];
  80. double samples[SAMPLES];
  81. for (n0 = 0; n0 < 40; n0 = 2 * n0 + 1) {
  82. for (n1 = 0; n1 < 10; n1 = 2 * n1 + 1) {
  83. double best_error = 1000000000;
  84. double bestpar0 = 1;
  85. double bestpar1 = 0.001;
  86. int better, i;
  87. av_lfg_init(&prng, 123);
  88. for (i = 0; i < SAMPLES; i++) {
  89. ideal[i] = 10 + i + n1 * i / (1000);
  90. samples[i] = ideal[i] + n0 * (av_lfg_get(&prng) - LFG_MAX / 2) / (LFG_MAX * 10LL);
  91. }
  92. do {
  93. double par0, par1;
  94. better = 0;
  95. for (par0 = bestpar0 * 0.8; par0 <= bestpar0 * 1.21; par0 += bestpar0 * 0.05) {
  96. for (par1 = bestpar1 * 0.8; par1 <= bestpar1 * 1.21; par1 += bestpar1 * 0.05) {
  97. double error = 0;
  98. TimeFilter *tf = ff_timefilter_new(1, par0, par1);
  99. if (!tf) {
  100. printf("Could not allocate memory for timefilter.\n");
  101. exit(1);
  102. }
  103. for (i = 0; i < SAMPLES; i++) {
  104. double filtered;
  105. filtered = ff_timefilter_update(tf, samples[i], 1);
  106. error += (filtered - ideal[i]) * (filtered - ideal[i]);
  107. }
  108. ff_timefilter_destroy(tf);
  109. if (error < best_error) {
  110. best_error = error;
  111. bestpar0 = par0;
  112. bestpar1 = par1;
  113. better = 1;
  114. }
  115. }
  116. }
  117. } while (better);
  118. #if 0
  119. double lastfil = 9;
  120. TimeFilter *tf = ff_timefilter_new(1, bestpar0, bestpar1);
  121. for (i = 0; i < SAMPLES; i++) {
  122. double filtered;
  123. filtered = ff_timefilter_update(tf, samples[i], 1);
  124. printf("%f %f %f %f\n", i - samples[i] + 10, filtered - samples[i],
  125. samples[FFMAX(i, 1)] - samples[FFMAX(i - 1, 0)], filtered - lastfil);
  126. lastfil = filtered;
  127. }
  128. ff_timefilter_destroy(tf);
  129. #else
  130. printf(" [%f %f %9f]", bestpar0, bestpar1, best_error);
  131. #endif
  132. }
  133. printf("\n");
  134. }
  135. return 0;
  136. }
  137. #endif