FFT algorithm routines in Labview

[fefelove]

Hello,

Real FFT.vi uses the fast radix-2 FFT routines or a mixed radix cooley-tukey algorithm in Labview.

Do these kinds of routines have the 2N-point real FFT method?

2N-point real FFT method is to utilize the single complex FFT by processing  two seperated N points (even index data- real N-points input, odd index data-imaginary N-points input in single complex FFT routine)

And what are differences between radix-2 FFT and fast radix-2 FFT routines?

And  what are differences between cooley-tukey algorithm and mixed radix cooley-tukey algorithm ?

[altenbach]

---

fefelove wrote:

2N-point real FFT method is to utilize the single complex FFT by processing  two seperated N points (even index data- real N-points input, odd index data-imaginary N-points input in single complex FFT routine)

---

If I understand you right, you could just typecast your interlaced array into a complex array of half the lenght before feeding it to the complex FFT.

Can you explain your concerns about the algorithms. Maybe wikipedia will help?