 Prime-factor FFT algorithm

The Prime-factor Fast Fourier Transform (PFFFT) is an efficient algorithm used for computing the Discrete Fourier Transform (DFT) of a sequence. It is particularly useful when the length of the input sequence can be factored into two or more relatively prime integers. The PFFFT algorithm takes advantage of the mathematical properties of the DFT to reduce the computational complexity compared to a naive computation of the DFT.