Hi Aaron,
Interesting example. It shows that we have some efficiency
problems with the current fir implementation. Here is an
alternative implementation :
fir((c,lc)) = _ <: *(c), R(1,lc) :> _ with {
R(n,(c,lc)) = (@(n):*(c)), R(n+1,lc);
Oops, forgot to CC the list.
Start weitergeleitete Nachricht:
Datum: Fri, 10 May 2013 16:52:02 +0200
Von: Marc Joliet
An: Orlarey Yann
Betreff: Re: [Faudiostream-users] Regalia-Mitra filter bank in FAUST
Am Thu, 09 May 2013 22:47:25 +0200
schrieb Orlarey Yann :
> Hi,
>
> I pushed some modif
Am Tue, 7 May 2013 23:11:40 +0200
schrieb Stéphane Letz :
> Hi Marc,
>
> Just answering some of your questions, hoping Yann will then follow...
>
> >
> > - Related to the above performance complaint: are the -cuda/-opencl options
> > in
> > FAUST2 related to code generation (parallelisation?)
Am Thu, 9 May 2013 21:31:44 +0200
schrieb Marc Joliet :
[...]
> Yes, rmfbd_syn was what I was writing about. Of course I forgot to mention
> that
> I was using -vec, with which I got one hour compilation time.
Actually, I just re-learned that compilation is mostly the same (usually just a
few se
Merged on faust2 and pushed.
Stéphane
Le 9 mai 2013 à 22:47, Orlarey Yann a écrit :
> Hi,
>
> I pushed some modifications (master branch only for the moment) that speeds
> up the propagation phase. Now it is negligible, For example for
> rmfbd_syn.dsp we now have :
>
> rmfbd_syn.dsp
> ===
