Searched refs:FFT_N (Results 1 – 3 of 3) sorted by relevance
43 #define FFT_N (1 << FFT_NSHIFT) macro51 static fx32 gFFTCos[FFT_N], gFFTSin[FFT_N];52 static int gBitRevTable[FFT_N];191 static fx32 data[FFT_N * 2]; in FFTTest()192 static fx32 orig[FFT_N * 2]; in FFTTest()193 static fx16 sinTable[FFT_N - FFT_N / 4]; in FFTTest()194 static fx16 sinTable2[(FFT_N - FFT_N / 4) / 2]; in FFTTest()203 OS_TPrintf("N = %d\n", FFT_N); in FFTTest()206 for (i = 0; i < FFT_N; i++) in FFTTest()208 orig[i * 2] = data[i * 2] = FX_SinIdx((65536 / FFT_N) * i); in FFTTest()[all …]
57 #define FFT_N (1 << FFT_NSHIFT) macro95 static fx16 sinTable[FFT_N - FFT_N / 4];97 static fx16 sinTable2[(FFT_N - FFT_N / 4) / 2];98 static fx32 data[FFT_N];100 static fx32 data[FFT_N * 2];102 static s32 power[FFT_N/2+1];103 static s32 smoothedPower[FFT_N/2+1];624 p = (u16 *)((u32)address - (FFT_N-1)*2); in CheckMicData()630 for (i = 0; i < FFT_N; i++) in CheckMicData()656 for (i = 0; i <= FFT_N/2; i++) in CheckMicData()[all …]
43 #define FFT_N (1 << FFT_NSHIFT) // Number of samples on which an FFT will be appl… macro44 #define DRAW_STEP MATH_MAX(FFT_N/2/256,1) // Number of steps to render45 #define DRAW_MAX MATH_MIN(FFT_N/2/DRAW_STEP, 256) // Independent power values other than …138 static fx16 sinTable[FFT_N - FFT_N / 4];140 static fx16 sinTable2[(FFT_N - FFT_N / 4) / 2];141 static fx32 data[FFT_N];143 static fx32 data[FFT_N * 2];145 static s32 power[FFT_N/2+1];146 static s32 smoothedPower[FFT_N/2+1];840 p = (u16 *)((u32)address - (FFT_N-1)*2); in SetDrawData()[all …]