u/xXBigboi69Xx42

For a school project I'm programming on an esp32 and I want to use a kd-tree (basically a binary search tree made for locating points in space). I can store the tree on an SD card no problem, but the problem is when searching it it's likely that it'd not fit into ram. For now I need to store around 630 points in it so it might fit in with a tight squeeze but even so I'd like to find an alternative.

Do I just implement some sorta pseudo-cache where I prefetch nodes in the tree from sd card when I search through the tree? Or is there a smarter way to do this?

I'm trying to write a program that reads a song, monophonic, and writes the notes for it. My current processor is using flux change detection to find note onsets and then grab the sample between two onsets and find out what note it is using the harmonic product (using fft to bring it into the frequency domain and then finding the frequency with the biggest amplitude product with its harmonic frequencies, overtones). Both in onset detection and pitch categorisation I use a Hann window before doing the fft.

However, my results so far have been not so great. What am I doing wrong? Is the approach itself just dumb? I'm new to sound processing so I'm unsure on how to proceed. Any advice appreciated (and I hope this is the sub for this question)

Thanks