Demystifying Filters Video Tutorial

Whoa. One of the best half hours I've spent in a while, that's for sure.

i believe sfv~ and slide~ are missing. :)

shouldn't it be x[0] and x[-1] because the delay outputs a number with a smaller index in the series? I actually would prefer the comnventional x[n] and x[n-1] but I see that 0 and 1/-1 is easier. Just saying because you introduce(really nicely) some of the "scary" vocabulary and this is also a very typical one.

@WOYTEG Yes, you are correct. When the video was rolling I was a little loose with the nomenclature. In the download of the patches that change was made (e.g. x[n] and x[n-1]). Thanks for catching!

Thanks so much for this Tim. Already demonstrates the power of gen in a way i didn't understand prior to watching. Would love to see this filter series continue with gen implementations :)

Excellent videos, thanks!

This is the mass.. And you're pape!! :) big thanks!!!!

Really excellent video. Thanks very much!

Thanks for the video! Still don't understand why doing 0.5 for both coefficients is averaging, is there anymore light you could shed on that?

To calculate the average of a set of numbers you add all of the numbers together and then divide the result by how many numbers there are. So to average two numbers we add them together and divide by 2 -- which is the same as adding two numbers together and multiplying by 0.5 -- which is also the same as multiplying each of the numbers by 0.5 first and then adding them together.

Hopefully that helps! Lots of ways to re-write the same basic math equations :-)

A lot to learn here for me - thanks for the exceptional tutorial.

i need help to understand

https://cycling74.com/forums/butterworth-problem-with-plot

hey i liked a lto that video, slowly filters are beeing demystified...and this video is excellent in that demystifying process, but i wish it was the beginning of a series :p edit : oops didnt see "crossove filter design". Dunno how much more like that there is ;)