Build a mel filterbank matrix of shape `[n_mels][n_freq_bins]`. Each row is a triangular filter covering a region of the FFT spectrum. Filters are no

Build a k-sparse complex signal of length n by planting k frequency sinusoids at deterministic but varied indices.

Build the twiddle table for DCT-II / DCT-III: twiddles[k] = exp(-j·π·k / (2N)) for k = 0..=N/2

Build the twiddle table for DCT-IV extraction: twiddles[k] = exp(-j·π·(2k+1) / (4N)) for k = 0..N

Build an f32 twiddle table for `n`-point DFT.

Build an f64 twiddle table for `n`-point DFT. `N` must equal `2 * n` (interleaved re/im for each of the `n` twiddle factors).

Butterfly operation: (a+b, a-b)

Get capacity.

Absolute difference between two complex numbers.

reason: compile-time check function is intentionally never called at runtime

Clear internal buffers.

Clear all cached buffers in the global GPU buffer pool. All GPU allocations held by the pool are freed. In-flight buffers (those currently acquired

Returns a reference to the column sub-communicator pool, if present. `None` for single-rank plans; set for multi-rank pencil decomposition.

Helper: check if two complex numbers are approximately equal.

Compare two complex numbers within tolerance.

Compare two complex numbers within tolerance (relative error).

Compute W_N^k = exp(2πik/N) for k = 0..N-1.

Create a constant (derivative is zero).

* Create a new WASM FFT wrapper. * * # Arguments * * * `size` - Transform size * @param {number} size