Xref: utzoo comp.dsp:1594 sci.math:17095 sci.math.num-analysis:1915
Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!mips!cs.uoregon.edu!ogicse!qiclab!onion!jomega!jomega.rain.com!mhorne
From: mhorne@jomega.rain.com (Michael T. Horne;649-8957;;;jomega)
Newsgroups: comp.dsp,sci.math,sci.math.num-analysis
Subject: Source Code for Finding Primitive Polynomials?
Message-ID: <1991Apr25.200827.14108@jomega.rain.com>
Date: 25 Apr 91 20:08:27 GMT
Sender: news@jomega.rain.com (Mr. News)
Reply-To: mhorne@jomega.rain.com
Followup-To: comp.dsp
Organization: Horne System Solutions, Aloha, OR
Lines: 19


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