Generalization of a FFT with powers of 3

528 Views Asked by At

I'm not satisfied with the current answers asked about this on MathSE. So I'm going to ask:

Describe the generalization of the FFT algorithm to the case in which n is a power of 3. What's the runtime?