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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
#![cfg_attr(all(feature = "bench", test), feature(test))]
extern crate num;
mod butterflies;
use num::{Complex, Zero, One, Float, Num, FromPrimitive, Signed};
use num::traits::cast;
use std::f32;
use butterflies::{butterfly_2, butterfly_3, butterfly_4, butterfly_5};
pub struct FFT<T> {
factors: Vec<(usize, usize)>,
twiddles: Vec<Complex<T>>,
scratch: Vec<Complex<T>>,
inverse: bool,
}
impl<T> FFT<T> where T: Signed + FromPrimitive + Copy {
pub fn new(len: usize, inverse: bool) -> Self {
let dir = if inverse { 1 } else { -1 };
let factors = factor(len);
let max_fft_len = factors.iter().map(|&(a, _)| a).max();
let scratch = match max_fft_len {
None | Some(0...5) => vec![Zero::zero(); 0],
Some(l) => vec![Zero::zero(); l],
};
FFT {
factors: factor(len),
twiddles: (0..len)
.map(|i| dir as f32 * i as f32 * 2.0 * f32::consts::PI / len as f32)
.map(|phase| Complex::from_polar(&1.0, &phase))
.map(|c| Complex {re: FromPrimitive::from_f32(c.re).unwrap(),
im: FromPrimitive::from_f32(c.im).unwrap()})
.collect(),
scratch: scratch,
inverse: inverse,
}
}
pub fn process(&mut self, signal: &[Complex<T>], spectrum: &mut [Complex<T>]) {
assert!(signal.len() == spectrum.len());
assert!(signal.len() == self.twiddles.len());
cooley_tukey(signal, spectrum, 1, &self.twiddles[..], &self.factors[..],
&mut self.scratch, self.inverse);
}
}
fn cooley_tukey<T>(signal: &[Complex<T>],
spectrum: &mut [Complex<T>],
stride: usize,
twiddles: &[Complex<T>],
factors: &[(usize, usize)],
scratch: &mut [Complex<T>],
inverse: bool) where T: Signed + FromPrimitive + Copy {
if let Some(&(n1, n2)) = factors.first() {
if n2 == 1 {
let mut spectrum_idx = 0usize;
let mut signal_idx = 0usize;
while signal_idx < signal.len() {
unsafe { *spectrum.get_unchecked_mut(spectrum_idx) =
*signal.get_unchecked(signal_idx); }
spectrum_idx += 1;
signal_idx += stride;
}
} else {
for i in 0..n1 {
cooley_tukey(&signal[i * stride..],
&mut spectrum[i * n2..],
stride * n1, twiddles, &factors[1..],
scratch, inverse);
}
}
match n1 {
5 => unsafe { butterfly_5(spectrum, stride, twiddles, n2) },
4 => unsafe { butterfly_4(spectrum, stride, twiddles, n2, inverse) },
3 => unsafe { butterfly_3(spectrum, stride, twiddles, n2) },
2 => unsafe { butterfly_2(spectrum, stride, twiddles, n2) },
_ => butterfly(spectrum, stride, twiddles, n2, n1, &mut scratch[..n1]),
}
}
}
fn butterfly<T: Num + Copy>(data: &mut [Complex<T>], stride: usize,
twiddles: &[Complex<T>], num_ffts: usize,
fft_len: usize, scratch: &mut [Complex<T>]) {
for fft_idx in 0..num_ffts {
let mut data_idx = fft_idx;
for s in scratch.iter_mut() {
*s = unsafe { *data.get_unchecked(data_idx) };
data_idx += num_ffts;
}
let mut data_idx = fft_idx;
while data_idx < fft_len * num_ffts {
let out_sample = unsafe { data.get_unchecked_mut(data_idx) };
*out_sample = Zero::zero();
let mut twiddle_idx = 0usize;
for in_sample in scratch.iter() {
let twiddle = unsafe { twiddles.get_unchecked(twiddle_idx) };
*out_sample = *out_sample + in_sample * twiddle;
twiddle_idx += stride * data_idx;
if twiddle_idx >= twiddles.len() { twiddle_idx -= twiddles.len() }
}
data_idx += num_ffts;
}
}
}
pub fn dft<T: Float>(signal: &[Complex<T>], spectrum: &mut [Complex<T>]) {
for (k, spec_bin) in spectrum.iter_mut().enumerate() {
let mut sum = Zero::zero();
for (i, &x) in signal.iter().enumerate() {
let angle = cast::<_, T>(-1 * (i * k) as isize).unwrap()
* cast(2.0 * f32::consts::PI).unwrap()
/ cast(signal.len()).unwrap();
let twiddle = Complex::from_polar(&One::one(), &angle);
sum = sum + twiddle * x;
}
*spec_bin = sum;
}
}
fn factor(n: usize) -> Vec<(usize, usize)> {
let mut factors = Vec::new();
let mut next = n;
while next > 1 {
for div in 2..next + 1 {
if next % div == 0 {
next = next / div;
factors.push((div, next));
break;
}
}
}
return factors;
}