Hello Fellow Faustians,
First of all many thanks to the developers and documentation writers:
due to their efforts, I was able to quickly write a plugin I had been
dreaming about for years, while getting my first taste of functional
programming.
Here is a simplified version, to explain what I did
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-22919
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 Sarah,
Sorry for the late reply, I was subscribed to the digest and only got
your message today. Fixed that.
Unfortunately I also don't see what's unclear about the order.
There was some unused code, and I used [1] trough [4] instead of [0]
trough [3], but other than that I don't know what you
Hi Sarah,
Sorry for the late reply, I was subscribed to the digest and only got
your message today. Fixed that.
Unfortunately I also don't see what's unclear about the order.
There was some unused code, and I used [1] trough [4] instead of [0]
trough [3], but other than that I don't know what you
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 wr
> null steps. We are discussing what to do with them, but for now, I think you
> should better specify a non-null step.
>
> Cheers,
> Sarah
>
> Le 11 juin 2014 à 09:34, Bart Brouns a écrit :
>
> > Hi Sarah,
> >
> > What I mean is: I don't
> zero* as you want, without dividing by zero. You can eventually set a
> max clipping value to the inverse parameter to avoid the
> rounding-to-zero-when-number-is-really-too-close-to-zero. Did I miss
> your point ?
> Le 13/06/2014 21:03, Bart Brouns a écrit :
> > Hi
Hi Everybody,
I made a delay where you don't tap in a tempo but an actual rhythm.
https://github.com/magnetophon/RhythmDelay
The 'much more' refers to ways of manipulating the sound of the
delay-taps.
In the studio, I find that I almost never use a straight delay.
It sounds way to clean and
Hi,
I'm developing a voice controlled synthesizer, that is: a synth that
follows the melody and spectrum of your voice.
https://github.com/magnetophon/VoiceOfFaust
It's working out great, except I'm having trouble compiling in some
cases:
-in faust 0.9.67 faust2jack with any .dsp gives me:
/
> Are you using the "vocoder" from the effect lib? (that was recently added in
> guess), or you own version? In this case, could you possibly correct naming
> in your DSP code?
>
> Thanks.
>
> Stéphane
>
>
> Le 19 sept. 2014 à 16:49, Bart Brouns a écrit
Now that JUCE has come up: has anyone taken a look at openframeworks yet?
http://www.openframeworks.cc/
On 7 dec. 2014, at 11:45, Albert Graef wrote:
> On Sun, Dec 7, 2014 at 11:12 AM, Kjetil Matheussen
> wrote:
>> Another alternative could be make a JUCE architecture file, then you'll get
Hi,
I'm trying to join the Faust Award, but my mail don't end up in my sent
items box.
Just to make sure, here is another try to get the pdf in your hands.
Cheers,
Bart.
VoicOfFaust.pdf
Description: Adobe PDF document
---
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 everybody,
I'm announcing the first release of my lookahead limiter: LazyLimiter v0.3.01
https://magnetophon.github.io/LazyLimiter/
This is my attempt of a clean yet fast brick-wall limiter.
Thanks to Sampo Savolainen for providing the initial inspiration.
Very special thanks to Yann Orlare
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 wrote:
> Hi Bart,
>
> It’s not quite ready for sharing yet but I wil
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
Hi Simon,
Is this what you meant?
// crossfade between multiple inputs (just the gain)
xfadeSelector(sel,nr) =
(((sel<=nr)*((sel-nr)+1):max(0))
+ ((sel>nr)*((nr-sel)+1):max(0))
);
srces = 3;
position =hslider("position", 0, 0, srces , 0.1);
process = par(i, srces, xfadeSelector(position,i)*_);
Hi,
I made some compressors, and a supporting library.
https://github.com/magnetophon/faustCompressors
I hope some of it is generally useful, and can be included in the
official libraries.
Features:
- Any number of channels
- Can work as a hard limiter, and beyond.
- Adjustable link, from mul
Hi,
I'm porting Forme d'Onde Formantique (FOF) to faust. [1] [2]
It's based on [3], but can be used with dynamic parameters.
[3] creates a single enveloped sine, and feeds it into a delay with full
feedback, so it never changes.
My version has everything synced to a master lf_rawsaw, so it
con
Hi,
I made a highly optimised sliding version of reduce.
You can find it here:
https://github.com/magnetophon/faustCompressors/blob/master/slidingReduce.lib
The output is updated each sample, unlike reduce, where the output is
constant for the duration of a block.
I hope it's useful for the l
Hi Jimbo,
I think you are looking for subseq in math.lib.
Usage example:
process = seq(i, 2, f(subseq((val1,val2),i,1)));
Hope that helps,
Bart.
On Fri, May 20, 2016 at 09:45:30PM -0700, jimbo1qaz wrote:
>New user of Faust here. I'm trying to call a function using arguments taken
>from a list.
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 configurable st
On Fri, May 20, 2016 at 10:25:54PM -0700, jimbo1qaz wrote:
>Another bug related to handling named parameters:
>
>func(x) = x^2 + x + 1;
>process = func(_); // I didn't test "process=func"
I suggest you test that! ;)
or:
process(y) = func(y);
I used y here, but I could just as well have called i
I would like that too. Maybe a github?
On 22 mei 2016, at 12:42, jimbo1qaz wrote:
> Does Faust currently have a bug tracker system? This mailing list seems a bit
> disorganized.
> --
> Mobile security can be enabling, n
uite fast, sch takes 24 mins. DSP CPU used with JACK 1024 frames:
>
>- scal ==> 98%
>
>- vec ==> 79%
>
>- sch ==> 30% and is works OK compiled with faust2. I guess you are on Linux,
>so is the problem with -sch mode reproductible with simpler .dsp ?
>
>Thanks.
tudio magnetophon
Bart Brouns
Biesenwal 3
6211 AD Maastricht
0031-6-22919561
b...@magnetophon.nl
www.magnetophon.nl
On 23 mei 2016, at 10:35, Romain Michon wrote:
> Hi Bart,
>
> I know that Michael Olsen (cc'ed) recently worked on a new approach for
> implementing FOF in Faust, may
On 23 mei 2016, at 08:47, Stéphane Letz wrote:
>
>> Le 22 mai 2016 à 16:37, Bart Brouns a écrit :
>>
>> Hi Stéphane,
>>
>> Thanks for looking in to it.
>> Does the -sch compile use huge amounts of RAM for you too?
>
> I have a 16 GO MacBook her
On 23 mei 2016, at 12:08, Stéphane Letz 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,
>> Bart.
>
> Yes on OSX. So my question is : does -sch mode correctly works w
Hi Mike,
Great!
Looking forward to it!
Cheers,
Bart.
On 24 mei 2016, at 07:00, Michael Olsen 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 have everything up on
> github, I'll send t
Hi,
I think I found a bug in lf_sawpos.
Run this code trough a scope, and you'll see what I mean.
import("oscillator.lib");
import("music.lib"); // for decimal, which should be in math.lib imho
process =
lf_sawpos(fr)
,
lf_sawpos( index2freq(lf_sawpos(fr) ))
,
my_lf_sawpos(fr)
,
m
g your other point(s), I don't have a scope handy, so I haven't
>seen your example, but I would be happy to look at anything that is easy to
>see using faust2octave et al. Ideal would be a few lines of code proving
>the problem in a faust2plot output.
>
>Thanks,
>Juliu
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,
Bart.
--
I'm working on my sliding reduce again.
To recap, it's like reduce, but:
- continuously updated output
- it uses just two delay lines and two operators for each doubling of
the number of samples you want to apply the operator to.
So for calculating the sum of the last 65536 samples, you just
een 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:30 AM, Bart Bro
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-
using relative
>paths. in all #includes.
>
>- Julius
>
>On Fri, Jun 3, 2016 at 11:18 AM, Bart Brouns wrote:
>>
>> Hi,
>>
>> I'm trying to build the latest git, and I get:
>>
>> http://nixpaste.lbr.uno/raw/6GlRm2v9
>>
>> Any idea
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/path/to/usr/lo
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:5
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 wrote:
>
>> Yes, the two cases behave surprisingly differently (to
Hi,
I made a stable high pass, and it works just fine, but it increases the
compile time of my project massively:
Just the evaluation alone went up from 100 to 400 seconds.
Is there something wrong with this code?
highpassStable(N,fc) = lphpr(N,N,fc)
with {
lphpr(0,N,fc) = _;
lphpr(1,N,f
>- Julius
>
>On Mon, Jun 13, 2016 at 11:56 PM Bart Brouns wrote:
>
>> Hi,
>>
>> I made a stable high pass, and it works just fine, but it increases the
>> compile time of my project massively:
>>
>> Just the evaluation alone went up from 100 to
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 inputs of B
>
>For e
r, something had to have
>terminated the evaluation, so maybe infinite recursion is not a
>possible explanation?
>
>- Julius
>
>
>On Wed, Jun 15, 2016 at 1:55 AM, Bart Brouns wrote:
>> Hi Julius,
>>
>> Looks like you are using faust 2, right?
>>
&g
Hi Julius and Yann,
On Sat, Jun 18, 2016 at 02:30:04PM -0700, Julius Smith wrote:
>Maybe there is a way to formulate more directly to avoid interleave?
In the badInterleave branch, I replaced all interleaves with a straight
bus.
Of course that doesn't produce the sound I want, and I have no i
Hi Yann,
Trying to understand what you wrote, I did:
process = x letrec { 'x = y+10;
y = x-1; };
and tried to look at the block diagram.
The compiler (revision 6d112cfa73820c2d0080a76a1efb8499001019a8) gives
me:
test.dsp:2:syntax error, unexpected IDENT, expecting DELAY1 or RBRAQ
What's
ignore last mail
Reply-To:
In-Reply-To:
Oops, found my mistake.
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 e
Hello fellow fausters,
A while ago I made some improvements in the FAUST support for Emacs and
spacemacs, but I never got around to announcing them here.
For those who don't know: spacemacs is a very popular, community driven
Emacs configuration, with a mode for vim- and one for Emacs- users.
Hi all,
I made a travis config for faust programs.
It does the following:
- build faust from git (needed for some of my dsps)
- build a benchmark and a stresstest tool:
https://github.com/moddevices/lv2bm
https://github.com/cth103/plugin-torture/
- cache these dependencies, so th
On 9 okt. 2016, at 07:18, Michael Olsen 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 world's most
engaging tech sites, S
Hi,
I made a crude script to convert a directory of faust code from the old
(0.9.73) to the new (0.9.90) libraries.
https://github.com/magnetophon/faustCompressors/blob/master/newlib.sh
BUGS:
Make sure you only run it once; it doesn't check for you.
It'll convert comments too, not just code, w
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 Faust_tutorial2.pdf file in t
Mykle Hansen 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", 0, 0, 1, 0.001);
Cheers,
Bart
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"
So, I was wondering what th
Hi Benoit,
Sorry for the late reply.
I originally wrote slidingRMSn for usage in compressors, which is
in essence
what you are doing, so this is certainly an option.
The downsides of using it here are:
1) You have to wait a bit for an estimate of the loudness, so it's
always late.
2) With
Hi Oleg,
Thanks for your watchful eye!
Somehow the initial value of `u` got lost in the last commit to
this function:
https://github.com/grame-cncm/faustlibraries/commit/ba34ca657a8c98efc804061c5b2e1d4f7e6bc6ff.
The oscillator doesn't seem to work without it.
The other changes where to bri
test (or two) and
ignorance, 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
Hi all,
This is very exciting to me, since I've been looking for a way to
integrate the pitchtracker of
https://magnetophon.github.io/VoiceOfFaust/ into the binary,
instead of using an external pd patch.
So many thanks to Nicolas for writing it!
Is it open source? What license?
Julius's so
ignal)
Thanks,
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:
ible. It depends on ur lowest
frequency and SR actually.
Nicolas
On 7 May 2020, at 15:48, Bart Brouns
wrote:
Hi all,
This is very exciting to me, since I've been looking for a way
to integrate the pitchtracker of
https://magnetophon.github.io/VoiceOfFaust/ into the binary,
in
, 2020 at 2:36 PM Bart Brouns
wrote:
Hi Nicolas,
Great to hear it's GPL! Thank you!
Do you mean the soundcard buffer setting?
I have that set to 3*4096.
The jackqt program says:
"The buffer size is now 512/sec"
on the CLI though.
Either way, the bargraph shows up empty,
ted C++ code and the CPU costs
become huge… so it seems the underlying algorithm is not suited
to Faust kind of coding ?
Stéphane
Le 7 mai 2020 à 23:35, Bart Brouns a
écrit :
Hi Nicolas,
Great to hear it's GPL! Thank you!
Do you mean the soundcard buffer setting?
I have that set to 3*
Hi Oleg,
Thanks!
I made another PR:
https://github.com/grame-cncm/faustlibraries/pull/57
How stupid of me, I only tested with n=2.
As for the naming, reduce is already taken:
https://github.com/grame-cncm/faustlibraries/blob/2efc2d01cb6be4e7eb2ae54fe3f3591782786ed0/reducemaps.lib#L74
Not
63 matches
Mail list logo
