[Mike Betts]

I'm not at home right now, so I'll defer answering until I get back to my "library" (in about a week).

From my increasingly faulty memory, the FT and IFT (Inverse FT) are unique whereas the FFT (Fast FT) and IFFT (inverse FFT) may not be.

The algorithm you have outlined will probably not work. Nice try though...

The FFT uses a "butterfly" algorithm which lends itself well to computers.

I'm not sure how to attack the DFT (discrete FT) without talking about continuous and discrete domains... This gets messy fast...

Like I said, I'll get back to you next week. I have a lot of references at home and don't want to say the wrong thing here...