| Crates.io | chfft |
| lib.rs | chfft |
| version | 0.3.4 |
| created_at | 2017-08-30 23:17:45.549726+00 |
| updated_at | 2020-06-18 21:47:52.159362+00 |
| description | Fastest Fourier Transform library implemented with pure Rust. |
| homepage | |
| repository | https://github.com/chalharu/chfft |
| max_upload_size | |
| id | 29951 |
| size | 124,705 |
Fastest Fourier Transform library implemented with pure Rust.
See the crate documentation for more details.
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.
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);
}