The mask is used in the code that implements the polynomial. The polynomial mask is created by taking the binary representation of the polynomial and truncating the right-most bit. Table 1 lists all the primitive 6 th-degree polynomials and their respective polynomial masks. In the case of primitive 6 th-degree polynomials, there are only six. Every number between 1 and 31 will occur in the shift register before it repeats. Consequently, a 6 th-degree polynomial will have 31 different states. A new state is transitioned to after each shift. A maximum length polynomial of degree n will have 2 n - 1 different states. We are interested in primitive polynomials because they will give us maximum length periods when shifting. Just as with numbers, some polynomials are prime or primitive. There are 2 (6 - 1) = 32 different possible polynomials of this size. For example, a 6 th-degree polynomial with every term present is represented with the equation x 6 + x 5 + x 4 + x 3 + x 2 + x + 1. LFSRs and PolynomialsĪ LFSR is specified entirely by its polynomial. Figure 2 shows an LFSR implementation in C, and Figure 3 shows a 16-bit LFSR implementation in 8051 assembly. Generating the pseudo-random numbers only requires a right-shift operation and an XOR operation. LFSRs (linear feedback shift registers) provide a simple means for generating nonsequential lists of numbers quickly on microcontrollers. The application note describes how they can be implemented and techniques that can be used to improve the statistical properties of the numbers generated. In this example i tried to simulate how LFSR works.Linear feedback shift registers are introduced along with the polynomials that completely describe them. I think LFSR is a great approach to create pseduo numbers. There are different types of implementation. Generally irreducible polynomials are using. Then calculating the new bit based on some math function. In every clock tick we are shifting whole bits. In theory we have several flip-flops and as known as every flip-flop has 1 bit. '(LFSR) is a shift register whose input bit is a linear function of its previous state.' And XOR is a most commonly used linear function in LFSR. We are using bitwise operator to shifting bits.

After clock tick we are pop out the last element from array and adding new bit to that array. I am using a basic array to represent flip-flops. So, i didn't use any operator other than ^ (XOR) operator. My aim was just simulating the LFSR logic with flip-flops.