1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
|
/*
dsp/Delay.h
Copyright 2003-13 Tim Goetze <tim@quitte.de>
http://quitte.de/dsp/
delay lines with fractional (linear or cubic interpolation) lookup
and an allpass interpolating tap (which needs more work).
delay line storage is aligned to powers of two for simplified wrapping
checks (no conditional or modulo, binary 'and' suffices instead).
*/
/*
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 3
of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
02111-1307, USA or point your web browser to http://www.gnu.org.
*/
#ifndef _DSP_DELAY_H_
#define _DSP_DELAY_H_
#include <cstring> // for memset
#include "util.h"
#include "FPTruncateMode.h"
namespace DSP {
class Delay
{
public:
uint size;
sample_t * data;
uint read, write;
Delay() { read = write = 0; data = 0; }
~Delay() { free (data); }
void init (uint n)
{
size = next_power_of_2 (n);
assert (size <= (1 << 20));
data = (sample_t *) calloc (sizeof (sample_t), size);
--size; /* used as mask for confining access */
write = n;
}
void reset()
{
memset (data, 0, (size + 1) * sizeof (sample_t));
}
sample_t & operator [] (int i) { return data [(write - i) & size]; }
inline void put (sample_t x)
{
data [write] = x;
write = (write + 1) & size;
}
inline sample_t get()
{
sample_t x = data [read];
read = (read + 1) & size;
return x;
}
inline sample_t peek() { return data [read]; }
inline sample_t putget (sample_t x) {put(x); return get();}
/* fractional lookup, linear interpolation */
inline sample_t get_linear (float f)
{
int n;
fistp (f, n); /* read: i = (int) f; relies on FPTruncateMode */
f -= n;
return (1 - f) * (*this) [n] + f * (*this) [n + 1];
}
/* fractional lookup, cubic interpolation */
inline sample_t get_cubic (float f)
{
int n;
fistp (f, n); /* see FPTruncateMode */
f -= n;
sample_t x_1 = (*this) [n - 1];
sample_t x0 = (*this) [n];
sample_t x1 = (*this) [n + 1];
sample_t x2 = (*this) [n + 2];
/* sample_t (32bit) quicker than double here */
sample_t a = (3 * (x0 - x1) - x_1 + x2) * .5f;
sample_t b = 2 * x1 + x_1 - (5 * x0 + x2) * .5f;
sample_t c = (x1 - x_1) * .5f;
return x0 + (((a * f) + b) * f + c) * f;
}
};
class MovingAverage
: public Delay
{
public:
sample_t state, over_n;
void init (uint n)
{
this->Delay::init (n);
over_n = 1.f / n;
/* adjust write pointer so we have a full history of zeros */
write = (write + size + 1) & size;
state = 0;
}
void reset()
{
this->Delay::reset();
state = 0;
}
void process (sample_t x)
{
x *= over_n;
state -= this->Delay::get();
state += x;
this->Delay::put (x);
}
sample_t get() { return state; }
};
}; /* namespace DSP */
#endif /* _DSP_DELAY_H_ */
|
