#fft #numerics #dsp #mathematics

chfft

Fastest Fourier Transform library implemented with pure Rust

11 releases

0.3.4 Jun 18, 2020
0.3.2 Sep 16, 2019
0.2.4 May 26, 2018
0.2.3 Mar 23, 2018
0.1.1 Aug 31, 2017

#58 in Math

Download history 86/week @ 2021-01-15 99/week @ 2021-01-22 53/week @ 2021-01-29 101/week @ 2021-02-05 177/week @ 2021-02-12 72/week @ 2021-02-19 84/week @ 2021-02-26 98/week @ 2021-03-05 110/week @ 2021-03-12 202/week @ 2021-03-19 103/week @ 2021-03-26 87/week @ 2021-04-02 74/week @ 2021-04-09 148/week @ 2021-04-16 79/week @ 2021-04-23 103/week @ 2021-04-30

369 downloads per month
Used in 5 crates

MPL-2.0 license

105KB
2.5K SLoC

chfft

crates.io badge Build Status docs.rs Coverage Status

Fastest Fourier Transform library implemented with pure Rust.

How-to Use

See the crate documentation for more details.

Features

  • CFft1D - Perform a complex-to-complex one-dimensional Fourier transform.

  • CFft2D - Perform a complex-to-complex two-dimensional Fourier transform.

  • Dct1D - Perform a discrete cosine transform.

  • RFft1D - Perform a real-to-complex one-dimensional Fourier transform.

  • Mdct1D - Perform a Modified discrete cosine transform.

Examples

use num_complex::Complex;
use chfft::CFft1D;

fn main() {
    let input = [Complex::new(2.0, 0.0), Complex::new(1.0, 1.0),
                 Complex::new(0.0, 3.0), Complex::new(2.0, 4.0)];
    let mut fft = CFft1D::<f64>::with_len(input.len());
    let output = fft.forward(&input);
    println!("the transform of {:?} is {:?}", input, output);
}

Dependencies

~240KB