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. The only linear functions of single bits. I did the polynomial in your comment, but it did not work (seemed to loop infinitely). A linear feedback shift register (LFSR) is a shift register whose input bit is a linear function of its previous state. 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. I want the polynomial in my comment, which seems to be the one pointed out. A vector with entries would initialize the shift register. An LFSR of length m consists of m stages numbered, each capable of storing one bit, and a clock controlling data exchange. 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 linear feedback shift register (LFSR) is a shift register whose input bit is the output of a linear function of two or more of its previous states (taps).

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: module lfsr (out, clk, rst) output reg 7:0 out input clk, rst wire feedback assign feedback (out7 out6) always (posedge clk, negedge rst).

12 bit linear feedback shift register