Appendix A: Primitive polynomials for n = 100
-
PDF
156.7138671875Kb
The following gives the primitive polynomials with the least number of terms which may be used to generate an autonomous maximum length pseudo random sequence (an M-sequence) from an n-stage linear feedback shift register (LFSR). Alternatives are possible in many cases, particularly as n increases. Recall from Chapter 3 that the primitive polynomial has the form: 1 + a1x1 + a2x2 ... anxn.
Preview this chapter:
Appendix A: Primitive polynomials for n = 100, Page 1 of 2
< Previous page Next page > /docserver/preview/fulltext/books/cs/pbcs009e/PBCS009E_appendixa-1.gif /docserver/preview/fulltext/books/cs/pbcs009e/PBCS009E_appendixa-2.gif