![]() (As far as I understood, academically this sort of algorithm is known as Short Time Fourier Transform).Ĭurrently, here's what I'm doing, how does this sound to you? I've spent almost two days researching the net, and I have found sources that state that the FFT results should be averaged, while others state that the overlapping results should simply be summed. The algorithm description I possess doesn't state exactly how I'm supposed to average or weight the overlapping FFT results together. (The frame is weighted by a hamming window before the FFT computation) The frame length is 2048 samples and the frame hop size for each iteration is just 64 samples (the overlap factor is huge!).Īt each iteration, I'm required to compute the PSD (power spectral density) by means of a fast fourier transform. I am re-implementing a sound processing algorithm that requires a stream of real audio data to be framed into overlapping windows. I am looking for some advice from you more experienced fellows on how to proceed, ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |