<html><head><meta http-equiv="Content-Type" content="text/html; charset=utf-8"></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class="">I shall be interested to hear how you get on, Ben.<div class=""><br class=""></div><div class="">I *love* a nice look-up table. My first rule is “Don’t do hard sums!”, which means “pretty much anything beyond an addition”!</div><div class=""><br class=""></div><div class=""><div class="">I suspect for the very-lower-level stuff I’ve been doing, the table overhead is worse than the alternative (doing shifts of the LFSR one byte at a time, as described here: <a href="https://electricdruid.net/practical-lfsr-random-number-generators/" class="">https://electricdruid.net/practical-lfsr-random-number-generators/</a>). But it’d great if it wasn’t!</div><div class="">
<div><br class=""><blockquote type="cite" class=""><div class="">On 19 Feb 2020, at 13:43, Ben Stuyts <<a href="mailto:ben@stuyts.nl" class="">ben@stuyts.nl</a>> wrote:</div><br class="Apple-interchange-newline"><div class=""><div class="">I just watched this interesting talk about using lookup tables (in hardware and software): <a href="https://www.youtube.com/watch?v=LnqqvVp_UZg" class="">https://www.youtube.com/watch?v=LnqqvVp_UZg</a><br class=""><br class="">At the very last end (around 29:11 minutes) he starts talking about LFSR's and maximising their performance using lookup tables instead of the more conventional XOR method. He has a 6 times performance increase. Very cool, I’m going to try this out soon.<br class=""><br class="">Ben<br class=""><br class=""><br class="">_______________________________________________<br class="">Synth-diy mailing list<br class=""><a href="mailto:Synth-diy@synth-diy.org" class="">Synth-diy@synth-diy.org</a><br class="">http://synth-diy.org/mailman/listinfo/synth-diy<br class=""></div></div></blockquote></div><br class=""></div></div></body></html>