12

I need to multiply two polynomials each having small integral coefficients. I need a fast FFT routine in C/C++ which can convolve them. I have seen several libraries but they seem to be too large spread over multiple files. What is important is I need code which is not too long and can be very easily used and compiled in a single .c/.cpp file.

  1. FFT should be optimized for real inputs at least if not small integers.
  2. Radix 4 implementation if available would be fine too.
  3. Compiling it should take no special compilation flags as compilation of program has to be done in external environment which I can't control.

One that very well matches my needs is here. But I need something twice as fast.

4

3 回答 3

17

要获得直接且易于使用的 FFT 实现,请尝试KissFFT。如果您需要绝对的最大性能,并且不介意有点复杂,那么它必须是FFTW

于 2011-03-10T08:24:13.600 回答
2

我已经根据我过去的需求调整了DspDimensionsmbFft上这个示例中的函数。

于 2011-03-10T04:49:47.173 回答