Administrator

This post was updated on .
[20161613 Updated expected value table in README.txt in zip file.]
LFSR32Rand: A new Random Number Generator for Jacksorbus contributed a nice Random Number Generator in this post. It's fast and works well for the limited use of random numbers required for most games.If you are writing a program that needs a large number of random numbers, more than 32K of them, you will run into trouble due to the cycle length limitation in 16bit Linear Congruential Generator based random number generators. Here is a new Random number generator that is somewhat slower than LCGRandom, but has a cycle length of 2^{32}1 (4 billion), and has better randomness than LCGbased random number generators.
LFSR32Rand source code and test application: I'll write a theory of operations for LFSR32Rand in a followup post. Mark
README.txt from the .zip file: Contents:  LFSR32Rand.jack LFSRbased random number generator. Main.jack Test program for LFSR32Rand  presents side by side test patterns drawn with LCGRand and LFSR32Rand. LCGRand.jack "Objectized" version of LCGRandom.jack. (Used by Main, not required by LFSR32Rand.) LFSR32Rand uses a Linear Feedback Shift Register to implement a random number generator with a cycle length of 2^321 (4.29e+9). LFSR32Rand solves several problems that can occur when using LCGbased random number generators like LCGRandom. 1) Because Hack only supports 16bit signed multiplication, the LCG has a cycle length of at most 32767 values before it repeats. 2) LCGs have poor randomness in the lower bits of the generated numbers. 3) LCGs can have noticeable patterns (autocorrelation) between returned values. 4) The LCG's unscaled values are unique; there are no duplicate values in the series returned by rand(). True random values have randomly occurring duplicates. (Search for "birthday problem" to learn about this.) Test program notes:  The "mormalish" distribution is the sum of three uniformly distributed random integers in the range 085 (3d86). The number displayed at the end of the test is the number of black pixels at the end of the test. Interesting tests to look at: Uniform distribution, 16K, set pixels  Beginning to see LCG patterning. Uniform distribution, 32K, set pixels  Strong patterning, overly dense. Uniform distribution, 64K, XOR pixels  Pixels turned off during 2nd LCG cycle. Normal distribution, 16K, set pixels  Diagonal patterning, low center density. Random walk, 32K, set pixels  LCG draws an interesting creature. Random walk, 64K, XOR pixels  The creature gets drawn and erased. (See Nand2Tetris forum http://nand2tetrisquestionsandanswersforum.32033.n3.nabble.com/PseudoRandomNumberGeneratortp4026059p4029903.html for information about why the LCG generates the creature.) Expected Value Table:  n(K) set pixel XOR pixel uniform 3d86 uniform 3d86 1 1016.05 1002.95 1008.18 982.64 2 2016.35 1965.24 1985.34 1888.10 4 3970.65 3776.14 3850.40 3497.60 8 7700.74 6995.09 7248.35 6078.50 16 14496.61 12156.86 12893.35 9585.08 32 25786.56 19170.01 20713.51 13458.44 64 41426.84 26916.78 28333.47 17109.61 128 56666.80 34219.17 32167.87 20318.87 256 64335.70 40637.71 32757.01 23034.44 512 65514.02 46068.88 32768.00 25269.91 
Administrator

LFSR32Rand: Theory of operationPreliminaries — Shift RegistersA shift register is a register with the added capability of modifying its stored data by shifting it one bit to the left or right. Shift registers are often used to convert parallel data to serial bit streams and vice versa. Shift registers can have serialinput, serialoutput, parallelinput and paralleloutput in various combinations depending on their task.The most generic shift register has both types of inputs and outputs. Here is an example shift register schematic and HDL file:
/** * 16bit Shift Register (leftshifting). */ CHIP ShiftReg16 { IN in, // Serial input pIn[16], // Parallel input shift, // True to shift when clocked load; // True to parallel load when clocked (overrides shift) OUT out, // Serial output pOut[16]; // Parallel output PARTS: Mux16(sel=load, out=regIn, a[0]=in, a[1..15]=regOut, // regIn = (regOut<<1)  in b=pIn); // regIn = pIn Or(a=shift, b=load, out=regLoad); Register(load=regLoad, in=regIn, out=pOut, out[15]=out, out[0..14]=regOut); }The LFSR32Randtheory.zip file (bottom of post) contains this HDL and a test file to exercise it.
Linear Feedback Shift RegisterA linear feedback shift register connects some of its parallel outputs back to its serial input through a network of XOR gates. Here is a schematic of a 4bit LFSR (uses the 4bit shift register shown above):
This LFSR cycles through this sequence: 0001 1000 0100 0010 1001 1100 0110 1011 0101 1010 1101 1110 1111 0111 0011 (0001)Notice that the value 0000 is missing from the cycle. If the LFSR contains all zeros, it will never change. The LFSR32Randtheory.zip file (bottom of post) contains HDL and test files for this 4bit LFSR and a 32bit LFSR that is the LFSR used by LFSR32Rand.
LFSR32Rand.jackThe fundamental data structure in LFSR32Rand is a 32bit shift register comprised of the two 16bit fields msw and lsw
Left shifting the doubleword register requires three steps: The Jack code to do this uses the < comparison to test if bit 15 is set, and takes advantage of the comparison result being 1 (true) or 0 (false). let msw = (msw+msw)  (lsw < 0); // '<' returns 1 if true let lsw = lsw+lsw; The fundamental function in LFSR32Rand is randBit() which generates the next random bit that will be used to compose the random numbers. It computes the next input bit to the LFSR and then shifts the LFSR to the left and inserts the new bit. Jack (and Hack) is not good at XOR, so randBit() uses the fact that XORing multiple bits together is the same as adding them modulo 2. The code is rather sneaky in that it adds true and false values as surrogates for the individual bits that need to be XORed.
let bit = ( (msw < 0) // true if 0x80000000 set + ((msw & 64) = 64) // true if 0x00400000 set + ((lsw & 4096) = 4096) // true if 0x00001000 set + ((lsw & 32) = 32) // true if 0x00000020 set ) & 1;
Example FilesNote that the schematics in this post show rightshifting circuits, but the example HDL files are leftshiftingLFSR32Randtheory10.zip contains:

This is awesome!

I agree. I got this frog thing:
I have to say, this is a good one. ðŸ˜€ 
In reply to this post by cadet1620
And this is also useful for my tetris game. ðŸ˜Ž

Now the LFSR32Rand random number generator is making an
Error. What's wrong? 
A_Random_Person, please try to ask questions in a better way. Most of your previous posts give too little information for anybody to answer them properly. One of the main ideas of this course is selflearning. Posting a question like this looks like you didn't try to understand what's happening and to solve it by yourself. Here are a couple of hints:

Free forum by Nabble  Edit this page 