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>
8 * This file is part of Libav.
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.
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.
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
25 #include "libavutil/common.h"
26 #include "libavutil/mem.h"
28 #include "timefilter.h"
31 /// Delay Locked Loop data. These variables refer to mathematical
32 /// concepts described in: http://www.kokkinizita.net/papers/usingdll.pdf
34 double feedback2_factor;
35 double feedback3_factor;
40 TimeFilter *ff_timefilter_new(double clock_period,
41 double feedback2_factor,
42 double feedback3_factor)
44 TimeFilter *self = av_mallocz(sizeof(TimeFilter));
45 self->clock_period = clock_period;
46 self->feedback2_factor = feedback2_factor;
47 self->feedback3_factor = feedback3_factor;
51 void ff_timefilter_destroy(TimeFilter *self)
56 void ff_timefilter_reset(TimeFilter *self)
61 double ff_timefilter_update(TimeFilter *self, double system_time, double period)
64 if (self->count == 1) {
66 self->cycle_time = system_time;
69 self->cycle_time += self->clock_period * period;
70 /// calculate loop error
71 loop_error = system_time - self->cycle_time;
74 self->cycle_time += FFMAX(self->feedback2_factor, 1.0 / self->count) * loop_error;
75 self->clock_period += self->feedback3_factor * loop_error / period;
77 return self->cycle_time;
81 #include "libavutil/lfg.h"
82 #define LFG_MAX ((1LL << 32) - 1)
91 double ideal[SAMPLES];
92 double samples[SAMPLES];
94 for (n0 = 0; n0 < 40; n0 = 2 * n0 + 1) {
95 for (n1 = 0; n1 < 10; n1 = 2 * n1 + 1) {
102 double best_error = 1000000000;
104 double bestpar1 = 0.001;
107 av_lfg_init(&prng, 123);
108 for (i = 0; i < SAMPLES; i++) {
109 ideal[i] = 10 + i + n1 * i / (1000);
110 samples[i] = ideal[i] + n0 * (av_lfg_get(&prng) - LFG_MAX / 2) / (LFG_MAX * 10LL);
116 for (par0 = bestpar0 * 0.8; par0 <= bestpar0 * 1.21; par0 += bestpar0 * 0.05) {
117 for (par1 = bestpar1 * 0.8; par1 <= bestpar1 * 1.21; par1 += bestpar1 * 0.05) {
119 TimeFilter *tf = ff_timefilter_new(1, par0, par1);
120 for (i = 0; i < SAMPLES; i++) {
122 filtered = ff_timefilter_update(tf, samples[i], 1);
123 error += (filtered - ideal[i]) * (filtered - ideal[i]);
125 ff_timefilter_destroy(tf);
126 if (error < best_error) {
137 TimeFilter *tf = ff_timefilter_new(1, bestpar0, bestpar1);
138 for (i = 0; i < SAMPLES; i++) {
140 filtered = ff_timefilter_update(tf, samples[i], 1);
141 printf("%f %f %f %f\n", i - samples[i] + 10, filtered - samples[i],
142 samples[FFMAX(i, 1)] - samples[FFMAX(i - 1, 0)], filtered - lastfil);
145 ff_timefilter_destroy(tf);
147 printf(" [%f %f %9f]", bestpar0, bestpar1, best_error);