Where p( t) is the chip pulse shape (often rectangular pulses are used but other options are possible). So there are actually six m-sequences of degree 5 (length 31) although the table only lists 3. Typically, tables of primitive polynomials do not include both a polynomial and its reciprocal. Also, if h( x) is a polynomial of degree n which produces an m-sequence of length N = 2 n − 1, then its reciprocal (defined as x n h( x −1)) also generates an m-sequence. The corresponding five-stage MLLFSR is shown in Fig. The octal entry 45 converts to the binary number 100101 which defines the polynomial h( x) = 1 + x 2 + x 5. As an example of how to use that table, the n = 5 entry will provide a primitive polynomial which will produce an m-sequence of length 2 5 − 1 = 31. ) or error correction coding (eg, Peterson and Weldon ) and are often given in octal form. Tables of primitive polynomials can be found in many books on spread spectrum (eg, Peterson et al. Polynomials which do produce an m-sequence are known as primitive polynomials. Not every polynomial, h( x), will produce an m-sequence.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. Archives
January 2023
Categories |