Posts Tagged fast

The FFT definitively explained by me, a signal processing expert

The Fourier TransformHere’s how to properly explain the fast Fourier transform, or FFT: Okay, it’s a Fourier transform, or FT, right, but while you’re doing it, you fold the buckets and the coefficients like origami, see, yes, basically like a unicorn, so you have to cut the code here, and here, and here so the head will come out right, yes, that’s it, and this code over here, it only runs if the unicorn is facing south, plus, you pull its tail so it makes little unicorn poops,uni and those have to go back into the unicorn’s little feed bin for next time around, because otherwise, the feedbin is too sweet, see, and the buckets are all funny-like and time goes back to being partially frequency. And you don’t want that.

So that’s it, yeah, and I’ll need your code example by tomorrow morning. Class dismissed.

Tags: , , , , , , — awesome and easy web pages with Python

I do a lot of generating web pages using Python. Python because I think Python 2.7 is awesome, and web pages because I do lots of work with various web sites that require dynamic results. Python is a very useful tool for me to get those dynamic results. It’s server-side (at least, the way I use it, it is, because I really try not to embed client-side resource usurping things), it is fast and efficient, and it is what I am comfortable with.

The thing is, web pages — generally speaking — aren’t all that simple if you really do them right. You can’t just throw a few tags together, test them on one browser, and hope you’re golden. Because you won’t be, I can pretty much promise you.
Read the rest of this entry »

Tags: , , , , , , , , ,