) the error is
distributed more evenly.
I've consider trying to make an nD version of it, but tbh, the prospect
frightens me a bit.
Do you think it would be worth while?
Cheers,
Bart.
___
Faudiostream-users mailing list
Faudiostream-users
Hi Oleg,
this? this is not what I meant...
So what *did* you mean?
It is not that I think that taylor() makes any real sense.
Why is that? Remember, I don't know what taylor is.
Cheers,
Bart.
___
Faudiostream-users mailing list
, whatever)
I'd love to get some more feedback on it as I have no idea if it's
correct what I'm doing, I just made it all up. :)
Cheers,
Bart.
---
On 2023-05-09 22:46, Oleg Nesterov wrote:
On 05/09, Oleg Nesterov wrote:
See the attached test-case. If you want to compile it, you need
that helps.
Is your WIP also online already?
Cheers,
Bart.
---
On 2022-08-17 22:42, Robin Gareus wrote:
On 8/17/22 22:12, Hermann Meyer wrote:
were you could put anything you like into the filterbank, when
defined,
while set frequency at runtime.
process= _: geq: ( dist5s , dist4s
Hi Jean-Louis,
Pattern matching is done at compile time, not run-time.
So if you call `lut(2)`, you will get `3` as an output, but if you give
it a variable input like in your example, it will use `lut(n)`.
Hope that helps.
Feel free to ask for clarification if needed!
Cheers,
Bart
Not sure what a better name would be.
Cheers,
Bart.
Oleg Nesterov writes:
Hi Bart,
The recent commit 7ee9bcf4459ac833bc adds parallelOp() which
looks
obviously wrong:
parallelOp(op,1) = _;
parallelOp(op,2) = op;
parallelOp(op,n) = (parallelOp(n-1),_):op;
the last
Hi Stéphane,
How could I have missed that, BufferLength is defined in the dsp!
:/
For me the CPU cost was around 13% but it took 4GB of RAM.
And it still doesn't output a pitch here... :(
Any ideas?
Cheers,
Bart.
Stéphane Letz writes:
With BufferLength = 300 the generated C
Thanks Julius,
That one works great!
What license is it under?
Got any more of these gems gathering dust on your HD? ;)
Cheers,
Bart.
Julius Smith writes:
In case anyone might be interested to build on it, attached is a
similar
function I wrote some years ago.
- Julius
On Thu, May 7
at results.
I'd love to see it implemented in faust, but I can't make heads
nor tails of the explanation.
Maybe something for the future?
Cheers,
Bart.
Nicolas Gravillon writes:
Hi Bart,
Glad you like it. I guess this is something quite expected as it
gives access to so many applicati
,
Bart.
Julius Smith writes:
Hi Bart,
Julius's solution didn't work for me,
I tried it and it just now and it compiled just fine! What
error do you
get? This is looking like a platform-dependent compiler
problem.
Thanks,
Julius
On Thu, May 7, 2020 at 6:48 AM Bart Brouns
wrote
point, so it doesn't run into the min clause?
That would happen after 1e9/48000/60/60 = almost 6 hours at 48k
SR, right?
Cheers,
Bart
Julius Smith writes:
Hi Nicolas,
It looks like you are asking for unbounded correlation lags.
Try limiting
it with something like i = min(1e8,+(1)) ~_ ;
nce, sorry!
Someone with access, please revert that commit!
And again, Oleg, sorry for the noise!
Cheers,
Bart.
Oleg Nesterov writes:
Hi Bart,
I am not sure I understand you, but I'll try to answer anyway ;)
Please correct me.
On 04/16, Bart Brouns wrote:
Somehow the initial value of `u
?
Why was this osc twice as loud as os.osc?
Is that what you mean by "more precise"?
How is the generated code worse?
Cheers,
Bart.
Oleg Nesterov writes:
Bart,
could you explain the commit 4fb8849b833629 ("Fixup quadosc") ?
It looks absolutely wrong.
- It re
that helps, let me know if you have any other questions!
Cheers,
Bart.
Benoit Delemps writes:
Hello everyone,
i am trying to build the additive synthesis module like
illustrated in this
example.
https://faust.grame.fr/doc/tutorials/#additive-synthesis
The thing is that the normalization
"$f" -o "$f.cpp"
So, I was wondering what that means.
It means the code took too long to compile and timed out.
You can set unlimited time by adding
-t 0
to your compile command.
Cheers,
Bart.
--
Mykle Hansen <my...@mykle.com> writes:
Is there any metadata I can add to change that ordering?
Sure, you can do:
parameter1 = vslider("[1]one" , 0, 0, 1, 0.001);
parameter2 = vslider("[2]two" , 0, 0, 1, 0.001);
parameter3 = vslider("[3]three",
I tested it, and unfortunately it is very sensitive to harmonics, causing it to
output s too high frequency.
On 1 mei 2017, at 13:35, Oliver Larkin wrote:
> There is a tutorial explaining how to make a zero crossing based frequency
> counter/pitch tracker in the
On 9 okt. 2016, at 07:18, Michael Olsen <intui...@gmail.com> wrote:
> I've finally got my FOF code up online.
Thats great news, thanks!
Cheers,
Bart
--
Check out the vibrant tech community on one of the wor
/master/.travis.yml#L16
to 1, so it builds the dependencies.
On subsequent runs, set it back to 0, so it builds and tests the dsps.
Hope that's useful to someone!
Cheers,
Bart.
--
What NetFlow Analyzer can do for you
ignore last mail
Reply-To:
In-Reply-To:
going on?
Cheers,
Bart.
On Tue, Jun 21, 2016 at 07:01:09PM +0200, Yann Orlarey wrote:
>We have pushed on the master branch an experimental extension to Faust: the
>`letrec{...}` construction. It is somehow similar to `with{...}`, but for
>_difference equations_ instead of regular de
me it still looks like the underlying problem is that the compiler
scales badly with complex dsp's.
I've seen the problem in some of my other code too.
Cheers,
Bart.
--
What NetFlow Analyzer can do for you? Monitors netw
different of these beasts, so
it'd be nice if they could compile quicker! ;)
Many thanks,
Bart.
On Wed, Jun 15, 2016 at 04:14:08PM -0700, Julius Smith wrote:
>Hi Bart,
>
>Actually I am on the master branch.
>
>6 minutes is still very long for a compile time! If any minimized
>
Hi Pierre,
You're looking for:
interleave(3,2)
Cheers,
Bart
On Thu, Jun 16, 2016 at 11:33:50AM -0400, Pierre Lecomte wrote:
>Hello,
>
>I'm wondering if it's possible to do some merge or split composition between A
>and B when the numbers of outputs of A is equal to number of
een in
FOFvocpder.dsp
PAFvocoder.dsp
czVocoder.dsp
and probably others.
This is with faust 1 from git 4 days ago.
Thanks,
Bart.
On Tue, Jun 14, 2016 at 06:59:05AM +, Julius Smith wrote:
>Hi Bart,
>
>How big is N when you compile it? The signal processing looks fine.
>
>- Julius
>
>On
,fc) = _;
lphpr(O,N,fc) = lphpr((O-2),N,fc) : tf2snp(1,0,0,a1s,1,w1) with {
parity = N % 2;
S = (O-parity)/2; // current section number
a1s = -2*cos(-PI + (1-parity)*PI/(2*N) + (S-1+parity)*PI/N);
w1 = 2*PI*fc;
};
};
Thanks,
Bart
Hi Julius,
I just noticed, in oscillator.lib, sawN still uses the old saw algo.
Cheers,
Bart.
On Thu, Jun 02, 2016 at 07:32:17AM +0200, Bart Brouns wrote:
>Thanks!
>
>On 2 jun. 2016, at 03:00, Julius Smith <j...@ccrma.stanford.edu> wrote:
>
>> Yes, the two cases behave
Thanks Julius.
OK, the build got a bit further but then started complaining about llvm.
Since I'm building faust1, I double-checked which commit I'm building
of, and (re-)discovered that I'm stupid.
Actual latest git builds fine...
Sorry for the noise,
Bart.
On Fri, Jun 03, 2016 at 01:27
Thanks Steve.
I'm already doing that.
But IIUC that defines where the output of the build goes, and my problem
is that the build doesn't find it's headers.
Cheers,
Bart.
On Fri, Jun 03, 2016 at 05:23:43PM -0300, Stephen Sinclair wrote:
>Would it help to use,
>
> make prefix=/my/pa
/gui/JSONUI.h compiler/generator/faust/gui/
It now finds that file, but:
generator/faust/gui/JSONUI.h:34:26: fatal error: faust/gui/UI.h: No such
file or directory
I'm sure I could patch that up too, but isn't this something that should
be fixed upstream?
- Bart.
PS: I still don't *really
Hi,
I'm trying to build the latest git, and I get:
http://nixpaste.lbr.uno/raw/6GlRm2v9
Any ideas?
Cheers,
Bart.
--
What NetFlow Analyzer can do for you? Monitors network bandwidth and traffic
patterns at an interface
ooth waveform oscillator between 0 and 1
> lf_sawpos(freq) = frac ~ +(freq/ml.SR) with { // Bart Brouns version
> frac(x) = x - floor(x);
> };
>
> Please let me know if you'd like to see anything written differently.
>
> Thanks,
> - Julius
>
> On Tue, May 31, 2016 at 4
es to compile, even
with a fixed nr of samples.
Thanks for listening!
Bart.
--
What NetFlow Analyzer can do for you? Monitors network bandwidth and traffic
patterns at an interface-level. Reveals which users, apps, and proto
Hi Julius,
I just tested with moving frequencies and the difference becomes even
bigger:
(par(i, 1000, my_lf_sawpos(abs((i+10) *lfo) )):>_)/1000
(par(i, 1000, lf_sawpos( (i+10) *lfo )):>_)/1000
take 30 and 65 % respectively, even with the (usually unneeded) abs.
Cheers
) ):>_)/1000
takes 30%, and:
(par(i, 1000, lf_sawpos(i+10 ) ):>_)/1000
takes 45%.
Cheers,
Bart.
On Mon, May 30, 2016 at 07:49:28PM +, Julius Smith wrote:
>Hi Bart,
>
>As can be seen from its implementation:
>
>// --- lf_sawpos ---
>// simple sawtooth waveform oscillator be
Hi Mike,
Great!
Looking forward to it!
Cheers,
Bart.
On 24 mei 2016, at 07:00, Michael Olsen <intui...@gmail.com> wrote:
> Hi Bart,
>
> Romain was actually referring to a new algorithm that I've been working on.
> I'm in the process of finishing it up but as soon as I
On 23 mei 2016, at 12:08, Stéphane Letz <l...@grame.fr> wrote:
>
>>> Yes sound is normally working.
>>
>> Thanks.
>> Just to make sure we're not miscommunicating: you get sound when compiling
>> with faust 2 - sch?
>>
>> Cheers,
>&g
On 23 mei 2016, at 08:47, Stéphane Letz <l...@grame.fr> wrote:
>
>> Le 22 mai 2016 à 16:37, Bart Brouns <b...@magnetophon.nl> a écrit :
>>
>> Hi Stéphane,
>>
>> Thanks for looking in to it.
>> Does the -sch compile use huge amounts o
Hi Romain,
Thanks for the tip; unfortunately it doesn't help: I already based my code on
his, but I had to modify it to be used with dynamic parameters, see below.
Also, it would be good to find out why my code works with faust 1, but is
silent with faust 2 -sch.
Cheers,
Bart.
studio
d FOF function all is fine too:
git checkout a7bf8f3d22f6e38f23d9fcb40b1b6cbc5457cc03
Thanks,
Bart.
On Sun, May 22, 2016 at 12:44:22PM +0200, Stéphane Letz wrote:
>Answering part of your questions:
>
>- compiled onn MacBook Pro 4 cores 2,2 GHz : faust2jaqt scal and vec compile
>q
st as well have called it x.
It doesn't matter what the parameter is called, only what it's value is
in the context that you use it in.
Does that clear up your previous question as well?
Cheers,
Bart.
--
Mobile se
Hi Jimbo,
Looks as expected to me.
Did you use:
process(x) = snes_delay(x,0.3);
Cheers,
Bart.
On Fri, May 20, 2016 at 08:57:59PM -0700, jimbo1qaz wrote:
>I'm just starting out in Faust, and I believe I have discovered a bug.
>
>I was trying to write a feedback echo function with con
for the libs.
It's been tested by comparing it to reduce with a scope.
How can I test it more formally?
Would
https://hal-mines-paristech.archives-ouvertes.fr/hal-01251069/document
help?
Does anyone know if this is a known algorithm?
I imagine it is, but I don't know how to find out.
Thanks,
Bart
!
Steps to reproduce:
git clone https://github.com/magnetophon/VoiceOfFaust
cd VoiceOfFaust
git checkout a44c5784e55f48ef44b76bac2e628e7a941e2474
time /home/bart/.nix-profile/bin/faust2jack -t 9 -time -osc -sch
FOFvocoder.dsp
./FOFvocoder & sleep 2 && jack_connect syst
ector(position,i)*_);
Cheers,
Bart.
On Wed, Apr 13, 2016 at 07:22:04PM +0200, Simon Staudenmayer wrote:
>Hello Hermann,
>
>Thanks for the feedback, very interesting solution.
>I deliberately didn't want to use select2 or select3, since I need a more
>generic selector, which can choo
Hi Oli,
Nice presentation!
The tambura sounds great, I love the 303-sounding example on soundcloud!
I looked for it online, and google has the mdoc file generated by the online
compiler indexed, but it's not there anymore.
Any chance of shearing it!
Cheers,
Bart.
studio magnetophon
Bart
Hi Oli,
Thanks!
Looking forward to it!
Cheers,
Bart
studio magnetophon
Bart Brouns
Biesenwal 3
6211 AD Maastricht
0031-6-22919561
b...@magnetophon.nl
www.magnetophon.nl
On 22 mrt. 2016, at 16:30, Oliver Larkin <olilar...@googlemail.com> wrote:
> Hi Bart,
>
> It’s not quite re
Hi Oliver,
I mailed you a while ago about your SuperCollider preset morpher, using it with
faust.
I've also long wanted to use faust with a framework like JUCE or openFrameworks.
So: Wow, two dreams come (almost) true in one day.
Many thanks!
Hi Stéphane,
I fixed the name collision. Please try again.
Thanks,
Bart.
On Fri, 2014-09-19 at 17:37 +0300, Stéphane Letz wrote:
Trying to compile from your git version :
faust VocSynth.dsp
effect.lib:626 ERROR: redefinition of symbols are not allowed : vocoder
Are you using
. Listes wrote:
[ Oops, switched out of the list with last answer, back to it in case it
is of interest for the community ;) ]
Bart, yes I am linking that to the smallest number question, as it
allows you to get not only *small numbers* but numbers *as close to
zero* as you want, without
Hi Sarah,
What I mean is: I don't care how small the steps are.
It seems to work for faust2jack.
Does it give you problems on other architectures?
Are there other reasons for not doing this?
I did notice nobody else is doing it...
Cheers,
Bart.
On Wed, 2014-06-11 at 09:27 +0200, Sarah Denoux
you mean.
If those where your issues, they are solved now. :)
Otherwise, please explain.
Cheers,
Bart.
Date: Thu, 05 Jun 2014 08:41:17 -0500
From: sden...@grame.fr
Subject: Re: [Faudiostream-users] qompander: A great sounding
compressor/expander with fast response
To: faudiostream
Hi everybody,
I ported http://www.katjaas.nl/compander/compander.html to Faust.
It's a very nice sounding cross between an expander, compressor and
limiter.
Here it is: https://github.com/magnetophon/qompander
Enjoy, and let me know what you think of it!
Greetings,
Bart
Hi Julius,
Thanks for clearing that up!
Is this a common optimization, or did you come up with it yourself? Was it
tested/compared?
I'm looking forward to your feedback once you try the MBC.
Greetings,
Bart.
studio magnetophon
Bart Brouns
Biesenwal 3
6211 GZ Maastricht
0031-6-22919561
b
54 matches
Mail list logo