c@409: If you are reading this, it means you think you may be interested in using the SIMD extensions in kissfft c@409: to do 4 *separate* FFTs at once. c@409: c@409: Beware! Beyond here there be dragons! c@409: c@409: This API is not easy to use, is not well documented, and breaks the KISS principle. c@409: c@409: c@409: Still reading? Okay, you may get rewarded for your patience with a considerable speedup c@409: (2-3x) on intel x86 machines with SSE if you are willing to jump through some hoops. c@409: c@409: The basic idea is to use the packed 4 float __m128 data type as a scalar element. c@409: This means that the format is pretty convoluted. It performs 4 FFTs per fft call on signals A,B,C,D. c@409: c@409: For complex data, the data is interlaced as follows: c@409: rA0,rB0,rC0,rD0, iA0,iB0,iC0,iD0, rA1,rB1,rC1,rD1, iA1,iB1,iC1,iD1 ... c@409: where "rA0" is the real part of the zeroth sample for signal A c@409: c@409: Real-only data is laid out: c@409: rA0,rB0,rC0,rD0, rA1,rB1,rC1,rD1, ... c@409: c@409: Compile with gcc flags something like c@409: -O3 -mpreferred-stack-boundary=4 -DUSE_SIMD=1 -msse c@409: c@409: Be aware of SIMD alignment. This is the most likely cause of segfaults. c@409: The code within kissfft uses scratch variables on the stack. c@409: With SIMD, these must have addresses on 16 byte boundaries. c@409: Search on "SIMD alignment" for more info. c@409: c@409: c@409: c@409: Robin at Divide Concept was kind enough to share his code for formatting to/from the SIMD kissfft. c@409: I have not run it -- use it at your own risk. It appears to do 4xN and Nx4 transpositions c@409: (out of place). c@409: c@409: void SSETools::pack128(float* target, float* source, unsigned long size128) c@409: { c@409: __m128* pDest = (__m128*)target; c@409: __m128* pDestEnd = pDest+size128; c@409: float* source0=source; c@409: float* source1=source0+size128; c@409: float* source2=source1+size128; c@409: float* source3=source2+size128; c@409: c@409: while(pDest