|
|
@@ -174,5 +174,210 @@ struct TExponentialSlewLimiter { |
|
|
|
typedef TExponentialSlewLimiter<> ExponentialSlewLimiter; |
|
|
|
|
|
|
|
|
|
|
|
template <typename T = float> |
|
|
|
struct TBiquadFilter { |
|
|
|
/** input state */ |
|
|
|
T x[2]; |
|
|
|
/** output state */ |
|
|
|
T y[2]; |
|
|
|
|
|
|
|
/** transfer function denominator coefficients: a_1, a_2 |
|
|
|
a_0 is fixed to 1. |
|
|
|
*/ |
|
|
|
float a[2]; |
|
|
|
/** transfer function numerator coefficients: b_0, b_1, b_2 */ |
|
|
|
float b[3]; |
|
|
|
|
|
|
|
enum Type { |
|
|
|
LOWPASS_1POLE, |
|
|
|
HIGHPASS_1POLE, |
|
|
|
LOWPASS, |
|
|
|
HIGHPASS, |
|
|
|
LOWSHELF, |
|
|
|
HIGHSHELF, |
|
|
|
BANDPASS, |
|
|
|
PEAK, |
|
|
|
NOTCH, |
|
|
|
NUM_TYPES |
|
|
|
}; |
|
|
|
Type type = LOWPASS; |
|
|
|
|
|
|
|
TBiquadFilter() { |
|
|
|
reset(); |
|
|
|
setParameters(0.f, 0.f, 1.f); |
|
|
|
} |
|
|
|
|
|
|
|
void reset() { |
|
|
|
std::memset(x, 0, sizeof(x)); |
|
|
|
std::memset(y, 0, sizeof(y)); |
|
|
|
} |
|
|
|
|
|
|
|
T process(T in) { |
|
|
|
// Advance IIR |
|
|
|
T out = |
|
|
|
b[0] * in |
|
|
|
+ b[1] * x[0] |
|
|
|
+ b[2] * x[1] |
|
|
|
- a[0] * y[0] |
|
|
|
- a[1] * y[1]; |
|
|
|
// Push input |
|
|
|
x[1] = x[0]; |
|
|
|
x[0] = in; |
|
|
|
// Push output |
|
|
|
y[1] = y[0]; |
|
|
|
y[0] = out; |
|
|
|
return out; |
|
|
|
} |
|
|
|
|
|
|
|
/** Calculates and sets the biquad transfer function coefficients. |
|
|
|
f: normalized frequency (cutoff frequency / sample rate), must be less than 0.5 |
|
|
|
Q: quality factor |
|
|
|
V: gain |
|
|
|
*/ |
|
|
|
void setParameters(float f, float Q, float V) { |
|
|
|
float K = std::tan(M_PI * f); |
|
|
|
switch (type) { |
|
|
|
case LOWPASS_1POLE: { |
|
|
|
a[0] = -std::exp(-2.f * M_PI * f); |
|
|
|
a[1] = 0.f; |
|
|
|
b[0] = 1.f + a[0]; |
|
|
|
b[1] = 0.f; |
|
|
|
b[2] = 0.f; |
|
|
|
} break; |
|
|
|
|
|
|
|
case HIGHPASS_1POLE: { |
|
|
|
a[0] = std::exp(-2.f * M_PI * (0.5f - f)); |
|
|
|
a[1] = 0.f; |
|
|
|
b[0] = 1.f - a[0]; |
|
|
|
b[1] = 0.f; |
|
|
|
b[2] = 0.f; |
|
|
|
} break; |
|
|
|
|
|
|
|
case LOWPASS: { |
|
|
|
float norm = 1.f / (1.f + K / Q + K * K); |
|
|
|
b[0] = K * K * norm; |
|
|
|
b[1] = 2.f * b[0]; |
|
|
|
b[2] = b[0]; |
|
|
|
a[0] = 2.f * (K * K - 1.f) * norm; |
|
|
|
a[1] = (1.f - K / Q + K * K) * norm; |
|
|
|
} break; |
|
|
|
|
|
|
|
case HIGHPASS: { |
|
|
|
float norm = 1.f / (1.f + K / Q + K * K); |
|
|
|
b[0] = norm; |
|
|
|
b[1] = -2.f * b[0]; |
|
|
|
b[2] = b[0]; |
|
|
|
a[0] = 2.f * (K * K - 1.f) * norm; |
|
|
|
a[1] = (1.f - K / Q + K * K) * norm; |
|
|
|
|
|
|
|
} break; |
|
|
|
|
|
|
|
case LOWSHELF: { |
|
|
|
float sqrtV = std::sqrt(V); |
|
|
|
if (V >= 1.f) { |
|
|
|
float norm = 1.f / (1.f + M_SQRT2 * K + K * K); |
|
|
|
b[0] = (1.f + M_SQRT2 * sqrtV * K + V * K * K) * norm; |
|
|
|
b[1] = 2.f * (V * K * K - 1.f) * norm; |
|
|
|
b[2] = (1.f - M_SQRT2 * sqrtV * K + V * K * K) * norm; |
|
|
|
a[0] = 2.f * (K * K - 1.f) * norm; |
|
|
|
a[1] = (1.f - M_SQRT2 * K + K * K) * norm; |
|
|
|
} |
|
|
|
else { |
|
|
|
float norm = 1.f / (1.f + M_SQRT2 / sqrtV * K + K * K / V); |
|
|
|
b[0] = (1.f + M_SQRT2 * K + K * K) * norm; |
|
|
|
b[1] = 2.f * (K * K - 1) * norm; |
|
|
|
b[2] = (1.f - M_SQRT2 * K + K * K) * norm; |
|
|
|
a[0] = 2.f * (K * K / V - 1.f) * norm; |
|
|
|
a[1] = (1.f - M_SQRT2 / sqrtV * K + K * K / V) * norm; |
|
|
|
} |
|
|
|
} break; |
|
|
|
|
|
|
|
case HIGHSHELF: { |
|
|
|
float sqrtV = std::sqrt(V); |
|
|
|
if (V >= 1.f) { |
|
|
|
float norm = 1.f / (1.f + M_SQRT2 * K + K * K); |
|
|
|
b[0] = (V + M_SQRT2 * sqrtV * K + K * K) * norm; |
|
|
|
b[1] = 2.f * (K * K - V) * norm; |
|
|
|
b[2] = (V - M_SQRT2 * sqrtV * K + K * K) * norm; |
|
|
|
a[0] = 2.f * (K * K - 1.f) * norm; |
|
|
|
a[1] = (1.f - M_SQRT2 * K + K * K) * norm; |
|
|
|
} |
|
|
|
else { |
|
|
|
float norm = 1.f / (1.f / V + M_SQRT2 / sqrtV * K + K * K); |
|
|
|
b[0] = (1.f + M_SQRT2 * K + K * K) * norm; |
|
|
|
b[1] = 2.f * (K * K - 1.f) * norm; |
|
|
|
b[2] = (1.f - M_SQRT2 * K + K * K) * norm; |
|
|
|
a[0] = 2.f * (K * K - 1.f / V) * norm; |
|
|
|
a[1] = (1.f / V - M_SQRT2 / sqrtV * K + K * K) * norm; |
|
|
|
} |
|
|
|
} break; |
|
|
|
|
|
|
|
case BANDPASS: { |
|
|
|
float norm = 1.f / (1.f + K / Q + K * K); |
|
|
|
b[0] = K / Q * norm; |
|
|
|
b[1] = 0.f; |
|
|
|
b[2] = -b[0]; |
|
|
|
a[0] = 2.f * (K * K - 1.f) * norm; |
|
|
|
a[1] = (1.f - K / Q + K * K) * norm; |
|
|
|
} break; |
|
|
|
|
|
|
|
case PEAK: { |
|
|
|
if (V >= 1.f) { |
|
|
|
float norm = 1.f / (1.f + K / Q + K * K); |
|
|
|
b[0] = (1.f + K / Q * V + K * K) * norm; |
|
|
|
b[1] = 2.f * (K * K - 1.f) * norm; |
|
|
|
b[2] = (1.f - K / Q * V + K * K) * norm; |
|
|
|
a[0] = b[1]; |
|
|
|
a[1] = (1.f - K / Q + K * K) * norm; |
|
|
|
} |
|
|
|
else { |
|
|
|
float norm = 1.f / (1.f + K / Q / V + K * K); |
|
|
|
b[0] = (1.f + K / Q + K * K) * norm; |
|
|
|
b[1] = 2.f * (K * K - 1.f) * norm; |
|
|
|
b[2] = (1.f - K / Q + K * K) * norm; |
|
|
|
a[0] = b[1]; |
|
|
|
a[1] = (1.f - K / Q / V + K * K) * norm; |
|
|
|
} |
|
|
|
} break; |
|
|
|
|
|
|
|
case NOTCH: { |
|
|
|
float norm = 1.f / (1.f + K / Q + K * K); |
|
|
|
b[0] = (1.f + K * K) * norm; |
|
|
|
b[1] = 2.f * (K * K - 1.f) * norm; |
|
|
|
b[2] = b[0]; |
|
|
|
a[0] = b[1]; |
|
|
|
a[1] = (1.f - K / Q + K * K) * norm; |
|
|
|
} break; |
|
|
|
|
|
|
|
default: break; |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
/** Computes the gain of a particular frequency |
|
|
|
f: normalized frequency |
|
|
|
*/ |
|
|
|
float getFrequencyResponse(float f) { |
|
|
|
float br = b[0]; |
|
|
|
float bi = 0.f; |
|
|
|
float ar = 1.f; |
|
|
|
float ai = 0.f; |
|
|
|
for (int i = 1; i < 3; i++) { |
|
|
|
float er = std::cos(2 * M_PI * -i * f); |
|
|
|
float ei = std::sin(2 * M_PI * -i * f); |
|
|
|
br += b[i] * er; |
|
|
|
bi += b[i] * ei; |
|
|
|
ar += a[i - 1] * er; |
|
|
|
ai += a[i - 1] * ei; |
|
|
|
} |
|
|
|
// Compute |b / a| |
|
|
|
float cr = (br * ar + bi * ai) / (ar * ar + ai * ai); |
|
|
|
float ci = (bi * ar - br * ai) / (ar * ar + ai * ai); |
|
|
|
return std::hypot(cr, ci); |
|
|
|
} |
|
|
|
}; |
|
|
|
|
|
|
|
typedef TBiquadFilter<> BiquadFilter; |
|
|
|
|
|
|
|
|
|
|
|
} // namespace dsp |
|
|
|
} // namespace rack |