scirs2-fft 0.4.2

Fast Fourier Transform module for SciRS2 (scirs2-fft)
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87

//! Simple benchmark example to test FFT performance

use scirs2_core::Complex64;
use scirs2_fft::{fft, frft, rfft};
use std::f64::consts::PI;
use std::time::Instant;

#[allow(dead_code)]
fn main() {
    println!("Simple FFT Benchmark");
    println!("===================");

    // Test different sizes
    let sizes = vec![64, 256, 1024, 4096];

    for &size in &sizes {
        println!("\nSize: {size}");

        // Generate test signal
        let signal: Vec<f64> = (0..size)
            .map(|i| (2.0 * PI * 10.0 * i as f64 / size as f64).sin())
            .collect();

        // Complex signal
        let complex_signal: Vec<Complex64> =
            signal.iter().map(|&x| Complex64::new(x, 0.0)).collect();

        // Benchmark FFT
        let start = Instant::now();
        let _ = fft(&complex_signal, None).expect("Operation failed");
        let fft_time = start.elapsed();
        println!("  FFT:  {fft_time:?}");

        // Benchmark RFFT
        let start = Instant::now();
        let _ = rfft(&signal, None).expect("Operation failed");
        let rfft_time = start.elapsed();
        println!("  RFFT: {rfft_time:?}");

        // Benchmark FrFT
        let start = Instant::now();
        let _ = frft(&signal, 0.5, None).expect("Operation failed");
        let frft_time = start.elapsed();
        println!("  FrFT: {frft_time:?}");
    }

    // Compare with memory-efficient versions
    use scirs2_fft::memory_efficient::{fft_inplace, FftMode};

    println!("\n\nMemory-Efficient Comparison (size=4096)");
    println!("======================================");

    let size = 4096;
    let mut complex_signal: Vec<Complex64> = (0..size)
        .map(|i| {
            let x = (2.0 * PI * 10.0 * i as f64 / size as f64).sin();
            Complex64::new(x, 0.0)
        })
        .collect();

    // Regular FFT
    let signal_copy = complex_signal.clone();
    let start = Instant::now();
    let _ = fft(&signal_copy, None).expect("Operation failed");
    let regular_time = start.elapsed();
    println!("Regular FFT: {regular_time:?}");

    // In-place FFT
    let mut output_buffer = vec![Complex64::new(0.0, 0.0); size];
    let start = Instant::now();
    fft_inplace(
        &mut complex_signal,
        &mut output_buffer,
        FftMode::Forward,
        false,
    )
    .expect("Operation failed");
    let inplace_time = start.elapsed();
    println!("In-place FFT: {inplace_time:?}");

    let speedup = regular_time.as_secs_f64() / inplace_time.as_secs_f64();
    if speedup > 1.0 {
        println!("\nIn-place is {speedup:.2}x faster");
    } else {
        println!("\nRegular is {:.2}x faster", 1.0 / speedup);
    }
}