algorithm - KissFFT and Power of Two -


I have read in many different places, that an FFT algorithm requires input array size, which is two Has the power, like 512 or 1024. I found a number of different algorithms that calculate FFT such as Quli-Tucci and BlueSteen (also works with numbers that follow key factors like 2,3,5,7).

Well, I'm using KissFFT and I'm entering an array of length 200. Why is this working? Does anyone know what is happening in this case? Is it minimizing 128 (2 ^ 7) size, or maybe using another algorithm? If it is using other algorithms, does it still give the correct answer, but just takes longer to calculate? (In this case, time is not really a problem for me.)

Here, here it goes:

  • First, the Koli and Tuke algorithms

  • Second, MATLAB: "Next to the pad You can use the Strip 2 signal that passes through FFT, by doing so, the calculation of FFT can accelerate when the signal length does not have the exact power of 2. "

All of you Thanks


Comments

Popular posts from this blog

java - Can't add JTree to JPanel of a JInternalFrame -

javascript - data.match(var) not working it seems -

javascript - How can I pause a jQuery .each() loop, while waiting for user input? -