I've attached my best attempt at recreating this effect, the attached PNG will be used as a reference.<br><br>Given the distance d1 and d2, these distances are usually identical in a traditional bitcrush or simple quantization. I would like to be able to vary the distance between points of an incoming signal such that the distance between points is a function of a given quantization value, the current Y value, AND a given quantization curve.<br>
<br>As a first step (and illustrated in the attached PNG), smaller values of Y will produce a more pronounced quantization given a x^2 quantization curve while larger values of Y will produce a smaller distance between steps.<br>
<br>Ideas?<br><br>~Brandon<br><br><div class="gmail_quote">On Tue, Nov 2, 2010 at 10:47 AM, Ludwig Maes <span dir="ltr"><<a href="mailto:ludwig.maes@gmail.com">ludwig.maes@gmail.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;">
could you give examples of idealized input and output for cases 1-4?<br>
im not sure I understand what exactly you want...<br>
<br>
interested greetings!<br>
Ludwig<br>
<div><div></div><div class="h5"><br>
On 1 November 2010 13:09, brandon zeeb <<a href="mailto:zeeb.brandon@gmail.com">zeeb.brandon@gmail.com</a>> wrote:<br>
> Hey All,<br>
><br>
> I've been burning my brain over this issue lately and I can't seem to come<br>
> up with an elegant solution, and stay with me here as I attempt to explain<br>
> it best I can. For me and my needs, being able to quantize an arbitrary<br>
> signal to any arbitrary series is the Holy Grail (and I'm not talking about<br>
> simple table lookup!).<br>
><br>
> I'm looking to quantize an incoming signal (or value) given a max and min<br>
> quantization value and an arbitrary curve. Think quantization of note<br>
> events to a series of note lengths or your standard bitcrush algorithm, it's<br>
> pretty much the same. The arbitrary curve should influence the degree to<br>
> which the bitcrush algorithm is applied to the signal such that one could<br>
> have less quantization at smaller values of the input signal, and greater<br>
> quantization and larger values (or vice versa). Simple table-lookup is<br>
> insufficient as it requires you to pre-define a maximum input signal<br>
> amount. I'm willing to waive this requirement if an implementation is not<br>
> possible without it.<br>
><br>
> This will be used in the following circumstances:<br>
><br>
> To quantize envelopes signals to any arbitrary series (say !, Fibonacci,<br>
> x^2, 2^x, etc)<br>
> To quantize signal loop length values to an arbitrary series of note values<br>
> (say 1/16, 1/8, 1/2, 1/1)<br>
> To apply non-linear bitcrushing to a signal such that higher values are<br>
> expressed with less of an effect than smaller values<br>
> To quantize pitch events to a pre-defined series<br>
><br>
><br>
> Is this making sense?<br>
><br>
> My attempts thus far has extended the RjDj bitcrush abstraction with mild<br>
> success. I can recreate the effect but the output signal bears too many<br>
> artifacts from the input signal (ie: the curve retains part of it's original<br>
> slope from the input signal and is not flattened or held until the next<br>
> value).<br>
><br>
> Thanks,<br>
> ~Brandon<br>
><br>
</div></div>> _______________________________________________<br>
> <a href="mailto:Pd-list@iem.at">Pd-list@iem.at</a> mailing list<br>
> UNSUBSCRIBE and account-management -><br>
> <a href="http://lists.puredata.info/listinfo/pd-list" target="_blank">http://lists.puredata.info/listinfo/pd-list</a><br>
><br>
><br>
</blockquote></div><br><br clear="all"><br>-- <br><font style="font-family: garamond,serif;" size="2"><span style="color: rgb(102, 102, 102);">Brandon Zeeb</span><br style="color: rgb(192, 192, 192);"><font size="1"><span style="color: rgb(153, 153, 153);">Columbus, Ohio</span></font></font><br>
<br>