![]() The maximum number of tap selection state Q1, Q2, Q3, Qn is the output of the LFSR, M (x) is a codeword polynomial input, such as M (x) = x ^ 4 + x ^ 1 + 1, denotes an input sequence input to 11001, the same, LFSR the structure may also be expressed as a polynomial generator polynomial G (x), referred to as: G(x) = gn*x^n+ …+g1*x^1+ g0;.As she represented by the feedback function y = a0x^0 + a1x + a2x^2…, Linear feedback function called linear shift feedback sequence, otherwise called the linear feedback shift sequence. Wherein, GN is the feedback coefficient, the value can only be 1 or 0, is taken as 0 when the feedback indicates that the road does not exist, when taken as indicating the presence of a feedback of the road here determines the feedback coefficient a random number generation algorithm s difference.Fibonacci (external LFSR), also known as the many-to-one.Galois (internal LFSR), also known as one-to-many.Linear feedback shift register (LFSR) mainly include two categories ![]() The main applications: a pseudo random number, a pseudo noise sequence, the counter, the BIST, data encryption and CRC checking. Linear feedback shift register (LFSR): usually composed of a shift register and an exclusive OR logic gate.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |