2 * Copyright (C) 2016 Robin Gareus <robin@gareus.org>
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License
6 * as published by the Free Software Foundation; either version 2
7 * of the License, or (at your option) any later version.
9 * This program 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
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write to the Free Software
16 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
23 #include "ardour/dB.h"
24 #include "ardour/dsp_filter.h"
28 #define isfinite_local(val) (bool)_finite((double)val)
30 #define isfinite_local std::isfinite
34 #define M_PI 3.14159265358979323846
37 using namespace ARDOUR::DSP;
40 ARDOUR::DSP::memset (float *data, const float val, const uint32_t n_samples) {
41 for (uint32_t i = 0; i < n_samples; ++i) {
47 ARDOUR::DSP::mmult (float *data, float *mult, const uint32_t n_samples) {
48 for (uint32_t i = 0; i < n_samples; ++i) {
54 ARDOUR::DSP::log_meter (float power) {
55 // compare to gtk2_ardour/logmeter.h
56 static const float lower_db = -192.f;
57 static const float upper_db = 0.f;
58 static const float non_linearity = 8.0;
59 return (power < lower_db ? 0.0 : powf ((power - lower_db) / (upper_db - lower_db), non_linearity));
63 ARDOUR::DSP::log_meter_coeff (float coeff) {
64 if (coeff <= 0) return 0;
65 return log_meter (fast_coefficient_to_dB (coeff));
69 ARDOUR::DSP::peaks (float *data, float &min, float &max, uint32_t n_samples) {
70 for (uint32_t i = 0; i < n_samples; ++i) {
71 if (data[i] < min) min = data[i];
72 if (data[i] > max) max = data[i];
76 LowPass::LowPass (double samplerate, float freq)
84 LowPass::set_cutoff (float freq)
86 _a = 1.f - expf (-2.f * M_PI * freq / _rate);
90 LowPass::proc (float *data, const uint32_t n_samples)
95 for (uint32_t i = 0; i < n_samples; ++i) {
96 data[i] += a * (data[i] - z);
100 if (!isfinite_local (_z)) { _z = 0; }
104 LowPass::ctrl (float *data, const float val, const uint32_t n_samples)
106 // localize variables
109 for (uint32_t i = 0; i < n_samples; ++i) {
110 data[i] += a * (val - z);
116 ///////////////////////////////////////////////////////////////////////////////
118 Biquad::Biquad (double samplerate)
130 Biquad::Biquad (const Biquad &other)
131 : _rate (other._rate)
143 Biquad::run (float *data, const uint32_t n_samples)
145 for (uint32_t i = 0; i < n_samples; ++i) {
146 const float xn = data[i];
147 const float z = _b0 * xn + _z1;
148 _z1 = _b1 * xn - _a1 * z + _z2;
149 _z2 = _b2 * xn - _a2 * z;
153 if (!isfinite_local (_z1)) { _z1 = 0; }
154 if (!isfinite_local (_z2)) { _z2 = 0; }
158 Biquad::configure (double a1, double a2, double b0, double b1, double b2)
168 Biquad::compute (Type type, double freq, double Q, double gain)
170 if (Q <= .001) { Q = 0.001; }
171 if (freq <= 1.) { freq = 1.; }
172 if (freq >= _rate) { freq = _rate; }
174 /* Compute biquad filter settings.
175 * Based on 'Cookbook formulae for audio EQ biquad filter coefficents'
176 * by Robert Bristow-Johnson
178 const double A = pow (10.0, (gain / 40.0));
179 const double W0 = (2.0 * M_PI * freq) / _rate;
180 const double sinW0 = sin (W0);
181 const double cosW0 = cos (W0);
182 const double alpha = sinW0 / (2.0 * Q);
183 const double beta = sqrt (A) / Q;
189 _b0 = (1.0 - cosW0) / 2.0;
191 _b2 = (1.0 - cosW0) / 2.0;
198 _b0 = (1.0 + cosW0) / 2.0;
199 _b1 = -(1.0 + cosW0);
200 _b2 = (1.0 + cosW0) / 2.0;
206 case BandPassSkirt: /* Constant skirt gain, peak gain = Q */
215 case BandPass0dB: /* Constant 0 dB peak gain */
243 _b0 = 1.0 + (alpha * A);
245 _b2 = 1.0 - (alpha * A);
246 _a0 = 1.0 + (alpha / A);
248 _a2 = 1.0 - (alpha / A);
252 _b0 = A * ((A + 1) - ((A - 1) * cosW0) + (beta * sinW0));
253 _b1 = (2.0 * A) * ((A - 1) - ((A + 1) * cosW0));
254 _b2 = A * ((A + 1) - ((A - 1) * cosW0) - (beta * sinW0));
255 _a0 = (A + 1) + ((A - 1) * cosW0) + (beta * sinW0);
256 _a1 = -2.0 * ((A - 1) + ((A + 1) * cosW0));
257 _a2 = (A + 1) + ((A - 1) * cosW0) - (beta * sinW0);
261 _b0 = A * ((A + 1) + ((A - 1) * cosW0) + (beta * sinW0));
262 _b1 = -(2.0 * A) * ((A - 1) + ((A + 1) * cosW0));
263 _b2 = A * ((A + 1) + ((A - 1) * cosW0) - (beta * sinW0));
264 _a0 = (A + 1) - ((A - 1) * cosW0) + (beta * sinW0);
265 _a1 = 2.0 * ((A - 1) - ((A + 1) * cosW0));
266 _a2 = (A + 1) - ((A - 1) * cosW0) - (beta * sinW0);
269 abort(); /*NOTREACHED*/
281 Biquad::dB_at_freq (float freq) const
283 const double W0 = (2.0 * M_PI * freq) / _rate;
284 const float c1 = cosf (W0);
285 const float s1 = sinf (W0);
287 const float A = _b0 + _b2;
288 const float B = _b0 - _b2;
289 const float C = 1.0 + _a2;
290 const float D = 1.0 - _a2;
292 const float a = A * c1 + _b1;
293 const float b = B * s1;
294 const float c = C * c1 + _a1;
295 const float d = D * s1;
297 #define SQUARE(x) ( (x) * (x) )
298 float rv = 20.f * log10f (sqrtf ((SQUARE(a) + SQUARE(b)) * (SQUARE(c) + SQUARE(d))) / (SQUARE(c) + SQUARE(d)));
299 if (!isfinite_local (rv)) { rv = 0; }
300 return std::min (120.f, std::max(-120.f, rv));
304 Glib::Threads::Mutex FFTSpectrum::fft_planner_lock;
306 FFTSpectrum::FFTSpectrum (uint32_t window_size, double rate)
309 init (window_size, rate);
312 FFTSpectrum::~FFTSpectrum ()
315 Glib::Threads::Mutex::Lock lk (fft_planner_lock);
316 fftwf_destroy_plan (_fftplan);
318 fftwf_free (_fft_data_in);
319 fftwf_free (_fft_data_out);
325 FFTSpectrum::init (uint32_t window_size, double rate)
327 Glib::Threads::Mutex::Lock lk (fft_planner_lock);
329 _fft_window_size = window_size;
330 _fft_data_size = window_size / 2;
331 _fft_freq_per_bin = rate / _fft_data_size / 2.f;
333 _fft_data_in = (float *) fftwf_malloc (sizeof(float) * _fft_window_size);
334 _fft_data_out = (float *) fftwf_malloc (sizeof(float) * _fft_window_size);
335 _fft_power = (float *) malloc (sizeof(float) * _fft_data_size);
339 _fftplan = fftwf_plan_r2r_1d (_fft_window_size, _fft_data_in, _fft_data_out, FFTW_R2HC, FFTW_MEASURE);
341 hann_window = (float *) malloc(sizeof(float) * window_size);
344 for (uint32_t i = 0; i < window_size; ++i) {
345 hann_window[i] = 0.5f - (0.5f * (float) cos (2.0f * M_PI * (float)i / (float)(window_size)));
346 sum += hann_window[i];
348 const double isum = 2.0 / sum;
349 for (uint32_t i = 0; i < window_size; ++i) {
350 hann_window[i] *= isum;
355 FFTSpectrum::reset ()
357 for (uint32_t i = 0; i < _fft_data_size; ++i) {
360 for (uint32_t i = 0; i < _fft_window_size; ++i) {
361 _fft_data_out[i] = 0;
366 FFTSpectrum::set_data_hann (float const * const data, uint32_t n_samples, uint32_t offset)
368 assert(n_samples + offset <= _fft_window_size);
369 for (uint32_t i = 0; i < n_samples; ++i) {
370 _fft_data_in[i + offset] = data[i] * hann_window[i + offset];
375 FFTSpectrum::execute ()
377 fftwf_execute (_fftplan);
379 _fft_power[0] = _fft_data_out[0] * _fft_data_out[0];
381 #define FRe (_fft_data_out[i])
382 #define FIm (_fft_data_out[_fft_window_size - i])
383 for (uint32_t i = 1; i < _fft_data_size - 1; ++i) {
384 _fft_power[i] = (FRe * FRe) + (FIm * FIm);
385 //_fft_phase[i] = atan2f (FIm, FRe);
392 FFTSpectrum::power_at_bin (const uint32_t b, const float norm) const {
393 assert (b >= 0 && b < _fft_data_size);
394 const float a = _fft_power[b] * norm;
395 return a > 1e-12 ? 10.0 * fast_log10 (a) : -INFINITY;