[sdiy] LFSR using lookup tables

[John Speth]

LUTs instead of "code" (hard logic or procedural) illustrates the 
classic speed vs memory tradeoff. If you have more of one than the 
other, you can craft your algorithm towards one method or the other. I'm 
skeptical that there is a need for LUTs in the very simple design domain 
of shift then xor. My gut tells me that shift then xor is always more 
efficient than using LUTs, both in terms of memory and speed resource 
usage. I'm eager to be shown the opposite.

JJS