Source Code for Finding Primitive Polynomials?

Thread View: comp.dsp

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Michael T. Horne;649-8957;;;jome... Thu, 25 Apr 1991 20:08

#1724

Author: Michael T. Horne;649-8957;;;jome...
Date: Thu, 25 Apr 1991 20:08

19 lines
1622 bytes

In generating pseudo-random numbers using shift registers (i.e. PN generators),
I've found the need to find all of the primitive polynomials for a given
shift register length.  The methods for finding all of the primitive polys
for a given shift register length are well known; I'm curious if anyone has
some code written to do this.  I can write an iterative program myself, but
I'd like to save myself the trouble.  In short, I'd like to be able to find
all of the primitive polynomials for a given shift register length, e.g. 32
bits.  I have plenty of CPU time available, so the routine need not be fast.
I'd like to compile a reasonable table of polys so I can create a somewhat
large number of statistically independent noise generators for any given
shift register length (provided a large number of primitive polys exist for
a given length).

If you have any information, pointers to articles or source code, please
send e-mail to the address below (I don't monitor the sci.math.* newsgroups).

Thanks in advance!
Mike Horne

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads