std :: dsp::fft
#include <std/dsp/fft.h> source ยท definition
#include <std/dsp/fft.h>
int fft_batch([]Complex data, unsigned long n, int inverse)
'batch' independent length-n transforms stored back to back (row r at data[r*n]), spread over the thread pool. inverse != 0 runs ifft.