Ok I'll give a try.so this is the actual filter algorithm:Here, if h is saved or not has no effect on the equation - it gets replaced first thing and no h[n-1] term is used. Storing h is actually not important at all afaiaa. If it's stored for any reason, I can't see it from the filter code. Maybe there is, but by all means, above algorithm is a Chamberlin SVFCode:
h[n] = in_val - l[n - 1] - Q * b[n - 1];b[n] = F * h[n] + b[n - 1];l[n] = F * b[n] + l[n - 1];
I've noticed that if the input signal goes above/below 1.0/-1.0f it introduces some weird glitches

But I'm not sure if its for some bugs or filter nature (for what I know this topology become unstable with higher freq, not higher level).
Statistics: Posted by Derozer — Wed Feb 07, 2024 9:52 am