Re: [Faudiostream-users] Implementing high order FIRs

CrocoDuck o'Ducks writes: Sometimes it seems to compile and work seemingly fine but often this happens instead when I issue faust2jackconsole: /usr/bin/faust2jackconsole: line 73: 3687 Alarm clock faust -i -a "$FAUSTLIB/jack-console.cpp" $OPTIONS "$f" -o "$f.cpp"

Re: [Faudiostream-users] Implementing high order FIRs

Greetings, The fir function is written as follows using pattern matching: fir((b0,bv)) = _ <: *(b0), R(1,bv) :> _ with { R(n,(bn,bv)) = (@(n):*(bn)), R(n+1,bv); R(n, bn) = (@(n):*(bn)); }; fir(b0) = *(b0); While very elegant, it requires a compiler evaluation for each

[Faudiostream-users] Implementing high order FIRs

Hi there! I currently have some Julia code producing 512 taps for an FIR filter. The Julia code also takes care of generating Faust code which uses ir.fir to implement the FIR. I then try to build the Faust FIR with faust2jackconsole. Sometimes it seems to compile and work seemingly fine