oxifft 0.2.0

Pure Rust implementation of FFTW - the Fastest Fourier Transform in the West
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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105

//! RDFT problem definition.

use core::hash::{Hash, Hasher};

use crate::kernel::{Complex, Float, Problem, ProblemKind, Tensor};

/// Kind of real DFT.
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
#[non_exhaustive]
pub enum RdftKind {
    /// Real to Complex (forward real FFT)
    R2C,
    /// Complex to Real (inverse real FFT)
    C2R,
    /// Real to Half-Complex
    R2HC,
    /// Half-Complex to Real
    HC2R,
    /// Real to Real (DCT/DST type)
    R2R,
}

/// Real DFT problem.
#[derive(Debug, Clone)]
pub struct RdftProblem<T: Float> {
    /// Transform dimensions.
    pub sz: Tensor,
    /// Batch dimensions.
    pub vecsz: Tensor,
    /// Real input/output buffer.
    pub real_buf: *mut T,
    /// Complex input/output buffer (for R2C/C2R).
    pub complex_buf: *mut Complex<T>,
    /// Transform kind.
    pub kind: RdftKind,
}

// Safety: Pointers are only dereferenced during execution
unsafe impl<T: Float> Send for RdftProblem<T> {}
unsafe impl<T: Float> Sync for RdftProblem<T> {}

impl<T: Float> RdftProblem<T> {
    /// Create a 1D R2C problem.
    #[must_use]
    pub fn new_r2c_1d(n: usize, real_input: *mut T, complex_output: *mut Complex<T>) -> Self {
        Self {
            sz: Tensor::rank1(n),
            vecsz: Tensor::empty(),
            real_buf: real_input,
            complex_buf: complex_output,
            kind: RdftKind::R2C,
        }
    }

    /// Create a 1D C2R problem.
    #[must_use]
    pub fn new_c2r_1d(n: usize, complex_input: *mut Complex<T>, real_output: *mut T) -> Self {
        Self {
            sz: Tensor::rank1(n),
            vecsz: Tensor::empty(),
            real_buf: real_output,
            complex_buf: complex_input,
            kind: RdftKind::C2R,
        }
    }

    /// Get transform size.
    #[must_use]
    pub fn transform_size(&self) -> usize {
        self.sz.total_size()
    }

    /// Get complex buffer size for R2C/C2R.
    /// For real FFT of size n, complex output has n/2 + 1 elements.
    #[must_use]
    pub fn complex_size(&self) -> usize {
        self.transform_size() / 2 + 1
    }
}

impl<T: Float> Hash for RdftProblem<T> {
    fn hash<H: Hasher>(&self, state: &mut H) {
        self.sz.hash(state);
        self.vecsz.hash(state);
        self.kind.hash(state);
    }
}

impl<T: Float> Problem for RdftProblem<T> {
    fn kind(&self) -> ProblemKind {
        ProblemKind::Rdft
    }

    fn zero(&self) {
        // Zero appropriate buffer based on kind
    }

    fn total_size(&self) -> usize {
        self.sz.total_size() * self.vecsz.total_size().max(1)
    }

    fn is_inplace(&self) -> bool {
        self.real_buf as *const () == self.complex_buf as *const ()
    }
}