Struct rustfft::algorithm::Radix4

pub struct Radix4<T> { /* fields omitted */ }

FFT algorithm optimized for power-of-two sizes

// Computes a forward FFT of size 4096
use rustfft::algorithm::Radix4;
use rustfft::{Fft, FftDirection};
use rustfft::num_complex::Complex;

let mut buffer = vec![Complex{ re: 0.0f32, im: 0.0f32 }; 4096];

let fft = Radix4::new(4096, FftDirection::Forward);
fft.process(&mut buffer);

Implementations

impl<T: FftNum> Radix4<T>

pub fn new(len: usize, direction: FftDirection) -> Self

Preallocates necessary arrays and precomputes necessary data to efficiently compute the power-of-two FFT

Trait Implementations

impl<T> Direction for Radix4<T>

pub fn fft_direction(&self) -> FftDirection

Returns FftDirection::Forward if this instance computes forward FFTs, or FftDirection::Inverse for inverse FFTs

impl<T: FftNum> Fft<T> for Radix4<T>

pub fn process_outofplace_with_scratch(
    &self,
    input: &mut [Complex<T>],
    output: &mut [Complex<T>],
    _scratch: &mut [Complex<T>]
)

Divides input and output into chunks of size self.len(), and computes a FFT on each chunk.

pub fn process_with_scratch(
    &self,
    buffer: &mut [Complex<T>],
    scratch: &mut [Complex<T>]
)

Divides buffer into chunks of size self.len(), and computes a FFT on each chunk.

pub fn get_inplace_scratch_len(&self) -> usize

Returns the size of the scratch buffer required by process_with_scratch

pub fn get_outofplace_scratch_len(&self) -> usize

Returns the size of the scratch buffer required by process_outofplace_with_scratch

pub fn process(&self, buffer: &mut [Complex<T>])

Computes a FFT in-place.

impl<T> Length for Radix4<T>

pub fn len(&self) -> usize

The FFT size that this algorithm can process