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 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.
cheers
c
Le 14/06/2016 15:05, Peter P. a écrit :
Dear Orm,
* Orm Finnendahl <orm.finnend...@selma.hfmdk-frankfurt.de> [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 could be done using the attached
patch.
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?
I am wondering if someone implemented the Karplus' and Strong's 'decay
stretching' in Pd as well.
best, Peter
_______________________________________________
Pd-list@lists.iem.at mailing list
UNSUBSCRIBE and account-management ->
https://lists.puredata.info/listinfo/pd-list
_______________________________________________
Pd-list@lists.iem.at mailing list
UNSUBSCRIBE and account-management ->
https://lists.puredata.info/listinfo/pd-list
