In previous tutorials, I provided a tour of filtering tools for Max users, and also discussed using Javascript for buffer access. In this 28-minute video, I'll build on those skills and build some filters from scratch in MSP and Gen, and examine their characteristics.
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 :)
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 :-)
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 ;)
one thing that im not very clear is that in gen~, the coefficient (b1) should be a negative number according to the formula; it is a negative number in the pole-zero comparison bit.
