# Does the fast Fourier transform have equivalents in other transforms?

I've seen the Mellin transform described as the "multiplicative" analogue to the Laplace transform, as well as the Fourier transform when $x\to\log y$.

Would a discrete Mellin transform be able to take advantage of any of the same optimizations that allow you to reduce the operations in a discrete Fourier transform?

• Does this paper help? they seem to get an algorithm directly expressed in terms of FFT which goes in the way of your question. researchgate.net/publication/… – tibL Mar 31 '17 at 14:17