-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
4 changed files
with
32 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,5 @@ | ||
// | ||
// Created by Leon Paterson-Stephens on 17/01/2024. | ||
// | ||
|
||
#include "FFTDecomposition.h" |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,25 @@ | ||
#include <juce_dsp/juce_dsp.h> | ||
|
||
namespace FFTDecomposition | ||
{ | ||
inline void ForwardDecompositionRadix2 (std::complex<float> * data, | ||
std::size_t num_points, | ||
std::size_t num_steps, | ||
std::size_t current_step) | ||
{ | ||
jassert (num_points > 0 && juce::isPowerOfTwo (num_points)); | ||
jassert (num_steps > 0 && num_steps <= num_points && juce::isPowerOfTwo (num_steps)); | ||
jassert (current_step < num_steps); | ||
|
||
auto half_num_points = num_points / 2; | ||
for (auto point_index = 0u; point_index < half_num_points - 1u; ++point_index) | ||
{ | ||
auto a_n = data [point_index] + data [half_num_points]; | ||
auto b_n = data [point_index] - data [half_num_points]; | ||
} | ||
} | ||
|
||
inline void InverseDecompositionRadix2 () | ||
{ | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters