octagonal/rdsp-experiments
1
1
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

I'm gonna rewrite everything : IFFT ISN'T JUST REVERSING THE TERMS RETARD

Browse Source
This commit is contained in:
Albin Chaboissier
2025-09-23 21:37:40 +02:00
parent 399d7852ac
commit d191b912b0
7 changed files with 4902 additions and 4839 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
src/fft/rader.rs
View File

@ -14,7 +14,7 @@ pub struct RaderFFT {
permutations: Box<[usize]>,
convolution_op: Box<[Complex32]>,
conv_fft: Box<dyn DFT>,
conv_fft: Box<NaiveDFT>,
size: usize,
}
@ -26,9 +26,10 @@ impl DFT for RaderFFT {
{
assert!(is_prime(size));
let g = compute_prime_primitive_root(size);
let permutations: Box<[usize]> = (0..(size - 1)).map(|i| exp_mod(g, i, size)).collect();
let permutations: Box<[usize]> = (0..(size - 1)).map(|i| exp_mod(g, i + 1, size)).collect();
let mut conv_fft = Box::new(NaiveDFT::create(size - 1));
//let mut conv_fft = create_fft(size - 1);
conv_fft
.get_input()
.iter_mut()
@ -53,7 +54,7 @@ impl DFT for RaderFFT {
fn execute(&mut self, window: fn(f32) -> f32) {
// Compute fft of input signal
for i in 0..(self.size - 1) {
let k = self.permutations[i];
let k = self.permutations[self.size - 1 - i - 1];
self.conv_fft.get_input()[i] = self.input_buffer[k];
}
@ -61,12 +62,12 @@ impl DFT for RaderFFT {
for i in 0..(self.size - 1) {
self.output_buffer[i] =
self.conv_fft.get_output()[self.size - 1 - i - 1] * self.convolution_op[i];
self.conv_fft.get_output()[i] * self.convolution_op[i];
}
for i in 0..(self.size - 1) {
//self.conv_fft.get_input()[i] = self.output_buffer[self.size - 1 - i - 1];
self.conv_fft.get_input()[i] = self.output_buffer[i];
//self.conv_fft.get_input()[i] = self.output_buffer[i];
self.conv_fft.get_input()[i] = -self.output_buffer[self.size - 1 - i - 1];
}
self.conv_fft.execute(windows::rectanguar);