Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!rpi!zaphod.mps.ohio-state.edu!samsung!munnari.oz.au!uhccux!galileo!ressler
From: ressler@galileo.ifa.hawaii.edu (Mike "IR" Ressler)
Newsgroups: sci.electronics
Subject: Re: Pseudo-random numbers
Keywords: PRBS,m-sequence,random
Message-ID: <12218@uhccux.uhcc.Hawaii.Edu>
Date: 30 Mar 91 03:30:14 GMT
References: <1991Mar27.101754.5326@specialix.co.uk>
Sender: news@uhccux.uhcc.Hawaii.Edu
Distribution: sci
Organization: UH IfA and NASA Infrared Telescope Facility
Lines: 18

In article <1991Mar27.101754.5326@specialix.co.uk> stevem@specialix.co.uk (Steven Murray) writes:
>
>There's the rub, has anyone got a definitive list of PRBS taps?
>I saw one in a book once - a reference text - but didn't copy it.
>The length of the PRBS sequence with proper taps ('maximal length')
>is normally (2^n)-1, where n is the number of S/R bits - without
>getting greedy, I saw taps for a 33 bit SR once - has anyone got
>the taps for anything longer?

Try page 227 of Numerical Recipes in C by William Press et al (Cambridge
University Press). They give a table of primitive polynomials (taps) out to
order 100 (100 bits). They are obviously mostly concerned about software
implementations, but discuss it in hardware terms enough to be useful.
Besides, they give the taps for ALL orders up to and including 100.
--
  Mike Ressler - Infrared Photon Jockey     ressler@galileo.ifa.hawaii.edu

  If at first you don't succeed, get a bigger sledgehammer.