[−][src]Struct rustfft::algorithm::GoodThomasAlgorithmSmall
Implementation of the Good-Thomas Algorithm, specialized for smaller input sizes
This algorithm factors a size n FFT into n1 * n2, where GCD(n1, n2) == 1
Conceptually, this algorithm is very similar to MixedRadix, except because GCD(n1, n2) == 1 we can do some number theory trickery to reduce the number of floating point operations. It typically performs better than MixedRadixSmall, especially at the smallest sizes.
// Computes a forward FFT of size 56 using GoodThomasAlgorithmSmall use std::sync::Arc; use rustfft::algorithm::GoodThomasAlgorithmSmall; use rustfft::algorithm::butterflies::{Butterfly7, Butterfly8}; use rustfft::{Fft, FftDirection}; use rustfft::num_complex::Complex; let mut buffer = vec![Complex{ re: 0.0f32, im: 0.0f32 }; 56]; // we need to find an n1 and n2 such that n1 * n2 == 56 and GCD(n1, n2) == 1 // n1 = 7 and n2 = 8 satisfies this let inner_fft_n1 = Arc::new(Butterfly7::new(FftDirection::Forward)); let inner_fft_n2 = Arc::new(Butterfly8::new(FftDirection::Forward)); // the good-thomas FFT length will be inner_fft_n1.len() * inner_fft_n2.len() = 56 let fft = GoodThomasAlgorithmSmall::new(inner_fft_n1, inner_fft_n2); fft.process(&mut buffer);
Implementations
impl<T: FftNum> GoodThomasAlgorithmSmall<T>
[src]
pub fn new(width_fft: Arc<dyn Fft<T>>, height_fft: Arc<dyn Fft<T>>) -> Self
[src]
Creates a FFT instance which will process inputs/outputs of size width_fft.len() * height_fft.len()
GCD(width_fft.len(), height_fft.len())
must be equal to 1
Trait Implementations
impl<T: FftNum> Direction for GoodThomasAlgorithmSmall<T>
[src]
pub fn fft_direction(&self) -> FftDirection
[src]
impl<T: FftNum> Fft<T> for GoodThomasAlgorithmSmall<T>
[src]
pub fn process_outofplace_with_scratch(
&self,
input: &mut [Complex<T>],
output: &mut [Complex<T>],
scratch: &mut [Complex<T>]
)
[src]
&self,
input: &mut [Complex<T>],
output: &mut [Complex<T>],
scratch: &mut [Complex<T>]
)
pub fn process_with_scratch(
&self,
buffer: &mut [Complex<T>],
scratch: &mut [Complex<T>]
)
[src]
&self,
buffer: &mut [Complex<T>],
scratch: &mut [Complex<T>]
)
pub fn get_inplace_scratch_len(&self) -> usize
[src]
pub fn get_outofplace_scratch_len(&self) -> usize
[src]
pub fn process(&self, buffer: &mut [Complex<T>])
[src]
impl<T: FftNum> Length for GoodThomasAlgorithmSmall<T>
[src]
Auto Trait Implementations
impl<T> !RefUnwindSafe for GoodThomasAlgorithmSmall<T>
[src]
impl<T> Send for GoodThomasAlgorithmSmall<T>
[src]
impl<T> Sync for GoodThomasAlgorithmSmall<T>
[src]
impl<T> Unpin for GoodThomasAlgorithmSmall<T>
[src]
impl<T> !UnwindSafe for GoodThomasAlgorithmSmall<T>
[src]
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,