I don't think there is another one... I couldn't fint one either. Make a good one and you'll probably help many people who need that !
(Well, in fact, any discrete Fourier transform algorithm could be used on calc (not only FFT) : the difference between a O(n^2) naive algorithm and a O(n*log(n)) one will hardly be seen for dimensions <= 1000... and larger dimensions are not very often used on calc !)