I'm working on expanding the functionality of go-dsp to work with transforms of sizes not a power of 2. I've implemented Bluestein's algorithm, since it's just one algorithm and I get support for all lengths (since, normally, you use mixed-radix for non-prime lengths and prime factor for prime lengths). It's working for the forward case, but I can't figure out which of the twiddle factors I need to invert or not invert, since the Bluestein algorithm has essentially two sets of twiddle factors. More thinking tomorrow.
Shared publiclyView activity