305 {
308 const int numRawBins = fftSize / 2 + 1;
309
311 s.fftOut.resize(fftSize);
312 s.re.resize(numRawBins);
313 s.im.resize(numRawBins);
314 s.mag.resize(numRawBins);
315
317
318
319 deinterleave(s.fftOut.data(), s.re.data(), s.im.data(), numRawBins);
320 batchMag(s.re.data(), s.im.data(), s.mag.data(), numRawBins);
321
323
326
327 const int bands =
mCqCfg.bands;
328 fl::vector<float> &rawBins = out->raw_mut();
330 for (int i = 0; i < bands; ++i) {
331 i32 real = cq[i].r;
332 i32 imag = cq[i].i;
333#ifdef FIXED_POINT
334 rawBins[i] =
static_cast<float>(
fastMag(real, imag));
335#else
336 float r2 = float(real * real);
337 float i2 = float(imag * imag);
338 rawBins[i] =
sqrt(r2 + i2);
339#endif
340 }
341 }
#define FASTLED_STACK_ARRAY(TYPE, NAME, SIZE)
Stack-allocated array with automatic zero-initialization.
static void batchMag(const kiss_fft_scalar *re, const kiss_fft_scalar *im, u16 *mag, int n) FL_NO_EXCEPT
void computeLinearBins(const u16 *mag, int, Bins *out) FL_NO_EXCEPT
static u16 fastMag(i32 re, i32 im) FL_NO_EXCEPT
static FftScratch & scratch() FL_NO_EXCEPT
static void deinterleave(const kiss_fft_cpx *cpx, kiss_fft_scalar *re, kiss_fft_scalar *im, int n) FL_NO_EXCEPT
void resize(fl::size n) FL_NO_EXCEPT
void apply_kernels(kiss_fft_cpx fft[], kiss_fft_cpx cq[], struct sparse_arr kernels[], struct cq_kernel_cfg cfg)
void fl_fft_real_forward(kiss_fftr_cfg cfg, int N, const kiss_fft_scalar *in, kiss_fft_cpx *out) FL_NO_EXCEPT
Forward real-to-complex FFT.
constexpr enable_if< is_fixed_point< T >::value, T >::type sqrt(T x) FL_NO_EXCEPT