Hi, Victor.
I literally never work with FFT and all I know dates back to a decade or so
ago when I studied it for my master: I don't remember much. Sorry in
advance for clueless questions.
If we had primitives performing FFT and IFFT, would it be possible to do
the overlapping stages in Faust with delayed signals?
Something like this, for example?
import("stdfaust.lib");
hann(size) = sin((ba.period(size) / size) * ma.PI) ^ 2.0;
hann_overlap(size, factor) = sum(i, factor, hann(size) @ ((size * i) /
factor)) / (factor / 2);
process = hann_overlap(1024, 8);
Ciao,
Dario
On Sun, 2 May 2021 at 14:52, Victor Lazzarini <victor.lazzar...@mu.ie>
wrote:
> Because it's been so many years since I remember discussing this, and
> because there's so many clever and knowledgeable people working on the
> Faust sources, I am supposing the hopping issue has no solution.
>
> Is that right?
>
> I was reminded of it by an user asking about the question here last week.
> My answer, which went directly to him, is that as far as I knew hopping was
> out of question, but that Julius had written an FFT, but to apply it to a
> stream, it had to be done on sample-by-sample basis. Julius then confirmed
> it here.
>
> Just curious to know the status of this.
>
> Prof. Victor Lazzarini
> Maynooth University
> Ireland
>
> _______________________________________________
> Faudiostream-users mailing list
> Faudiostream-users@lists.sourceforge.net
> https://lists.sourceforge.net/lists/listinfo/faudiostream-users
>
_______________________________________________
Faudiostream-users mailing list
Faudiostream-users@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/faudiostream-users
