Hey Alexandre,
I got sound that I liked really quickly out of your patch.
Surely a good didactic test.
Regards,
Julian
On 16 June 2016 at 07:26, Alexandre Torres Porres wrote:
>
>
> 2016-06-15 5:09 GMT-03:00 Peter P. :
>
>> Orm's implementation of the random phase might also be cheaper than
>
2016-06-15 5:09 GMT-03:00 Peter P. :
> Orm's implementation of the random phase might also be cheaper than
> your two fexpr~ for that part.
it's just "expr~" not "fexpr~" ;)
> You might not have to be conservative with CPU
> usage in your case at all however.
>
nope, and I need to be more int
Salut Cyrille,
* cyrille henry [2016-06-14 22:41]:
> hello,
>
> i've just read the original article from 1983 describing KS algo, including
> decay stretching.
> as far as i understand, averaging the last 2 sample is a very optimized low
> pass iir filter at fixed frequency. the decay stretchi
* Jesse Mejia [2016-06-14 17:35]:
> I haven't heard of decay stretching in KS - I'm interested in this - where is
> info on that?
You have guessed it, on the web!
https://www.google.com/#q=karplus+strong+decay+stretching
___
Pd-list@lists.iem.at mailin
Hi Alexandre,
* Alexandre Torres Porres [2016-06-14 20:29]:
[...]
I see you use fexpr~ to derive binary noise from a [noise~]. I might not
be correct but I suppose that binary noise has a similar, if not the
same, spectrum as re [noise~], so it could be left out to save some CPU
cycles. Otherwis
you said it better anyhow, haha
2016-06-14 18:35 GMT-03:00 cyrille henry :
>
>
> Le 14/06/2016 23:27, Alexandre Torres Porres a écrit :
>
>> 2016-06-14 17:40 GMT-03:00 cyrille henry > c...@chnry.net>>:
>>
>> now that processing power allow to easily compute filter at different
>> frequency, I
Le 14/06/2016 23:27, Alexandre Torres Porres a écrit :
2016-06-14 17:40 GMT-03:00 cyrille henry mailto:c...@chnry.net>>:
now that processing power allow to easily compute filter at different
frequency, I would suggest to replace the averaging algo with a simple lop~
filter and experiment
2016-06-14 17:40 GMT-03:00 cyrille henry :
> now that processing power allow to easily compute filter at different
> frequency, I would suggest to replace the averaging algo with a simple lop~
> filter and experiment with the cutoff frequency.
>
yep, that's what I was trying to say ;)
cheers
___
hello,
i've just read the original article from 1983 describing KS algo, including
decay stretching.
as far as i understand, averaging the last 2 sample is a very optimized low
pass iir filter at fixed frequency. the decay stretching allow to change the
filter cutoff.
now that processing power
Hey, I didn't send the new version in the attachment, that's the same as in
my didactic material, here's the new version
2016-06-14 15:29 GMT-03:00 Alexandre Torres Porres :
> Hi Peter, I tried my best to do a faithful implementation of the Karplus
> Strong algorithm (with the probability functio
Hi Peter, I tried my best to do a faithful implementation of the Karplus
Strong algorithm (with the probability function and all) as described in
that paper. I have it in my didactic material that I use to teach my
students - one thing though, I'm from Brazil and the thing is being
developed in por
I haven't heard of decay stretching in KS - I'm interested in this - where is
info on that?
> On Jun 14, 2016, at 6:38 AM, Orm Finnendahl
> wrote:
>
> Hi Peter,
>
>> Am Dienstag, den 14. Juni 2016 um 15:05:57 Uhr (+0200) schrieb Peter P.:
>> Thank you! This is quite elegant, vanilla Pd and wo
Hi Peter,
Am Dienstag, den 14. Juni 2016 um 15:05:57 Uhr (+0200) schrieb Peter P.:
> Thank you! This is quite elegant, vanilla Pd and works with a blocksize
> of 1 as well! Did you come up with this or is there another source which
> can be credited?
The polarity was done from scratch today. The
Dear Orm,
* Orm Finnendahl [2016-06-14 12:24]:
> Hi Peter,
>
> BTW: The patch in the pd tutorial uses [z~ 1] which you can replace
> with [biquad~ 0 0 0 1 0] and your suggestion to do the averaging in
> the biquad~ should simplify that patch even more.
>
> The probability based polarity change
Hi Peter,
BTW: The patch in the pd tutorial uses [z~ 1] which you can replace
with [biquad~ 0 0 0 1 0] and your suggestion to do the averaging in
the biquad~ should simplify that patch even more.
The probability based polarity change could be done using the attached
patch.
--
Orm
Am Dienstag,
Hi Peter,
Am Dienstag, den 14. Juni 2016 um 10:51:16 Uhr (+0200) schrieb Peter P.:
> Hi list,
>
> I am trying to implement Karplus-Strong and am wondering about the
> following questions:
not an answer to your question, but here is an implementation of
Karplus Strong:
http://www.pd-tutorial.co
Hi list,
I am trying to implement Karplus-Strong and am wondering about the
following questions:
- I run the feedback-delay inside a subpatch that is re[block~ 1]ed to 1
sample blocksize. Will a biquad~ object work correctly with blocksizes
of 1 as well?
- The Karplus-Strong paper recommends a s
17 matches
Mail list logo
