Git-Mirrors/portapack-mayhem
1
0
Fork 0
mirror of https://github.com/eried/portapack-mayhem.git synced 2024-09-20 16:15:51 +00:00
Code Issues Packages Projects Releases Wiki Activity

FFT twiddles can be used for all K <= table length.

Browse Source 
Change assert to allow FFTs < 8.
This commit is contained in:
Jared Boone 2016-01-03 20:25:31 -08:00
parent 54e59cc224
commit 963b6e257a
1 changed files with 3 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
firmware/common/dsp_fft.hpp
View File

@ -111,8 +111,9 @@ void fft_c_preswapped(std::array<T, N>& data) {
static_assert(power_of_two(N), "only defined for N == power of two");
constexpr auto K = log_2(N);
static_assert(N == 256, "lame that I've hard-coded a table for K=8");
static constexpr std::array<std::complex<float>, K> wp_table { {
constexpr size_t K_max = 8;
static_assert(K <= K_max, "No FFT twiddle factors for K > 8");
static constexpr std::array<std::complex<float>, K_max> wp_table { {
{ -2.00000000000000000000000000000000f, 0.00000000000000000000000000000000f },
{ -1.00000000000000000000000000000000f, -1.00000000000000000000000000000000f },
{ -0.29289321881345242726268907063059f, -0.70710678118654746171500846685376f },