3 bit linear feedback shift register polynomials

That did work (I'm guessing it's correct because it stopped). I looked at the wikipedia page, and changed the rightmost term from + 1 to + lfsr per the wiki. I did the polynomial in your comment, but it did not work (seemed to loop infinitely). For example, consider the 3-bit LFSR with (c2,c1,c0) (1,1,1), and its degree-3 connection. A linear feedback shift register can be formed by performing exclusive-OR on the outputs of two or more of the flip-flops together and feeding those outputs back into the input of one of the flip-flops as shown in Figure 2. This way seems to assume the lsb left and the msb right, so that we shift everything onto the msb's positon and xor it. Some of the outputs are combined in exclusive-OR configuration to form a feedback mechanism. I want the polynomial in my comment, which seems to be the one pointed out. Lfsr = (lfsr > 1) | (bit > 7) ^ (lfsr > 8) ^ (lfsr > 9) ^ (lfsr > 11) ^ (lfsr > 12) ^ (lfsr > 13) ^ (lfsr > 14) ^ (lfsr > 15) ^ (lfsr > 16) ^ (lfsr > 18) ^ (lfsr > 19) ^ (lfsr > 23) ^ (lfsr > 24) ^ (lfsr > 25))& 1u A technique for allowing a linear feedback shift register (LFSR), and particularly a Galois LFSR, to be advanced forward by an amount m (i.e. The central lines in the function are: bit = ((lfsr > 7) ^ (lfsr > 8) ^ (lfsr > 9) ^ (lfsr > 11) ^ (lfsr > 12) ^ (lfsr > 13) ^ (lfsr > 14) ^ (lfsr > 15) ^ (lfsr > 16) ^ (lfsr > 18) ^ (lfsr > 19) ^ (lfsr > 23) ^ (lfsr > 24) ^ (lfsr > 25))& 1u Question: A linear feedback shift register of length 3 with connection polynomial C(X) 1 + X2 + X3 + over Z2 is used to produce a pseudo-random sequence. I have used uint32_t for all my data types and lfsr is set to start_state when the function is called. I want to implement a Linear-feedback shift register for the following polynomial x^24 + x^23 + x^22 + x^20 + x^19 + x^18 + x^17 + x^16 + x^15 + x^13 + x^12 + x^8 + x^7 + x^6 + 1, relying on what can be found here with the associated C code:

3 bit linear feedback shift register polynomials