So far I think I have the code working, I have currently an array of DFT "bins" 32 of them, 40hz to approx 200hz in 5hz increments... I call the BPM algo by first populating the vector with the bins 1 2 3 ... 32 32 ... 3 2 1... this is correct, I am faking out the FFT vector :-)
I get quality scores that climb as the music is played sometimes in excess of 50,000, is this OK?
The winner # seems to be 10X too big and the winner_lo seems OK, but just is delayed compared to winner...
But in the scenario of printing out the BPM to the screen, how to determine when the time is right and the BPM is currently solid and valid.
So far I think I have the code working, I have currently an array of DFT "bins" 32 of them, 40hz to approx 200hz in 5hz increments... I call the BPM algo by first populating the vector with the bins 1 2 3 ... 32 32 ... 3 2 1... this is correct, I am faking out the FFT vector :-)
I get quality scores that climb as the music is played sometimes in excess of 50,000, is this OK?
The winner # seems to be 10X too big and the winner_lo seems OK, but just is delayed compared to winner...
But in the scenario of printing out the BPM to the screen, how to determine when the time is right and the BPM is currently solid and valid.
Thanks for the awesome code!
RichardS