Struct rustdct::dct2::DCT2SplitRadix

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

DCT Type 2 implemention that recursively divides the problem in half. The problem size must be a power of two.

// Computes a DCT Type 2 of size 1024
use rustdct::dct2::{DCT2, DCT2SplitRadix};
use rustdct::DCTplanner;

let len = 1024;
let mut input:  Vec<f32> = vec![0f32; len];
let mut output: Vec<f32> = vec![0f32; len];

let mut planner = DCTplanner::new();
let quarter_dct = planner.plan_dct2(len / 4);
let half_dct = planner.plan_dct2(len / 2);

let dct = DCT2SplitRadix::new(half_dct, quarter_dct);
dct.process(&mut input, &mut output);

Methods

impl<T: DCTnum> DCT2SplitRadix<T>

pub fn new(half_dct: Arc<DCT2<T>>, quarter_dct: Arc<DCT2<T>>) -> Self

Creates a new DCT2 context that will process signals of length len

Trait Implementations

impl<T: DCTnum> DCT2<T> for DCT2SplitRadix<T>

fn process(&self, input: &mut [T], output: &mut [T])

Computes the DCT Type 2 on the input buffer and places the result in the output buffer.

impl<T> Length for DCT2SplitRadix<T>

fn len(&self) -> usize

The FFT size that this algorithm can process