Re: Time Partitioned FFT

2022-08-07 Thread Daniel Estévez
Hi all, Reading between lines, I think that what the original poster wants is just to be able to compute FFTs that overlap by 1/4 of the FFT size. So, essentially what JM suggests: fft2=fft(x(P+1:P+Q)) fft3=fft(x(2*P+1:2*P+Q)) fft4=fft(x(3*P+1:3*P+Q)) How to do this in GNU Radio? You can "

Re: Time Partitioned FFT

2022-08-07 Thread Elmore's
Daniel, Thanks for the explanation of how to implement JM’s solution in GNU Radio. And thanks to JM for the discussion. This should get me over my initial stumbling block to get started. Jim -- This email has been checked for viruses by AVG. https://www.avg.com