Convenience function for inverse DFT (without normalization).

Convenience function for 2D split-complex inverse FFT with normalization.

Convenience function for 3D split-complex inverse FFT with normalization.

* One-shot inverse FFT (f32). * * # Arguments * * * `real` - Real part of input * * `imag` - Imaginary part of input * * # Returns * * Interl

* One-shot inverse FFT (f64). * * # Arguments * * * `real` - Real part of input * * `imag` - Imaginary part of input * * # Returns * * Interl

Convenience function for N-dimensional split-complex inverse FFT with normalization.

Convenience function for inverse FFT using DIT (without normalization).

Convenience function for in-place inverse FFT (without normalization).

Compute the inverse Fractional Fourier Transform. The inverse FrFT of order α is the FrFT of order -α. # Arguments `input` - Input signal (result o

Compute inverse FrFT with error handling. # Errors Returns `FrftError::InvalidSize` if `input` is empty, or `FrftError::PlanningFailed` if FFT plann

Import wisdom from a planner.

Create an input-pruned plan. # Arguments `n` - Transform size `input_indices` - Indices of non-zero inputs `flags` - Planning flags # Returns `Non

Execute inverse FFT. # Errors Returns `GpuError::SizeMismatch` if `input.len()` does not equal `size * batch_size`, or propagates backend execution

Execute inverse FFT (normalized).

* Execute inverse FFT. * * # Arguments * * * `real` - Real part of input (length must equal size) * * `imag` - Imaginary part

Execute a complex-to-real inverse FFT. `input` must have length `size/2 + 1`; `output` must have length `size`. # Errors - `GpuError::SizeMismatch`

Execute inverse FFT with interleaved input. # Arguments `interleaved` - Interleaved complex input [re0, im0, re1, im1, ...] # Returns Interleaved

* Execute inverse FFT with interleaved input. * * # Arguments * * * `interleaved` - Interleaved complex input [re0, im0, re1, im1,

Execute inverse FFT with pre-allocated output. # Errors Returns `GpuError::SizeMismatch` if `input` or `output` lengths do not equal `size * batch_s

Convenience function for 2D Complex-to-Real FFT with normalization. Takes n0×(n1/2+1) complex values and produces n0×n1 real values.

Convenience function for 3D Complex-to-Real FFT with normalization. Takes n0×n1×(n2/2+1) complex values and produces n0×n1×n2 real values.

Convenience function for N-dimensional Complex-to-Real FFT with normalization. Takes prefix×(last/2+1) complex values and produces product(dims) real

Check if a pointer is properly aligned for SIMD operations.

Check if this window satisfies the COLA (Constant Overlap-Add) condition. COLA ensures perfect reconstruction when using overlap-add synthesis.

Collision detection between two bucket observations. Returns true if the buckets likely contain multiple aliased frequencies.

Check if the result is empty.

Check if buffer is full.

Check if bucket contains multiple frequencies (multiton).

Check if sparse FFT is beneficial for this problem. Sparse FFT is generally beneficial when k << n. Returns false if standard FFT would be faster.

Check if the problem is valid.

Get expected sparsity.