Article 16404 of sci.electronics:
Path: Intrepid!maverick.ksu.ksu.edu!zaphod.mps.ohio-state.edu!rpi!uwm.edu!linac!att!ucbvax!ucdavis!ucdavis.edu!jhgillespie
From: jhgillespie@ucdavis.edu
Newsgroups: sci.electronics
Subject: Re: Pseudo-random numbers
Message-ID: <8676@ucdavis.ucdavis.edu>
Date: 29 Mar 91 21:37:42 GMT
References: <1991Mar27.101754.5326@specialix.co.uk>
Sender: usenet@ucdavis.ucdavis.edu
Organization: ucdavis
Lines: 12

In article <1991Mar27.101754.5326@specialix.co.uk> stevem@specialix.co.uk
(Steven Murray) writes:
>
>     'Pseudo-Random Binary Sequences', sometimes known as 
>'m-sequences' and the basis for random number generation in some
>electronic and software products, are produced by a 'shift-register'
>where the input to the shift-register is an X-OR of some of the
>shift-register outputs (usually called taps)....
>There's the rub, has anyone got a definitive list of PRBS taps?

Try Arvillias, A. C. and D. G. Maritsas. 1979 IEEE Trans. Comp. C-28:89-101. or
Pangratz, H. and H. Weinrichter 1919 IEEE Trans. Comp. C-28:89-101.637-642


Article 16410 of sci.electronics:
Path: Intrepid!maverick.ksu.ksu.edu!zaphod.mps.ohio-state.edu!sol.ctr.columbia.edu!src.honeywell.com!maitai!ferguson
From: ferguson@maitai.SRC.Honeywell.COM (Dennis Ferguson)
Newsgroups: sci.electronics
Subject: Re: Pseudo-random numbers
Keywords: PRBS,m-sequence,random
Message-ID: <1991Mar30.020800.13149@src.honeywell.com>
Date: 30 Mar 91 02:08:00 GMT
References: <1991Mar27.101754.5326@specialix.co.uk>
Sender: D.Ferguson
Distribution: sci
Organization: Honeywell Systems & Research Center, Mpls., MN
Lines: 19
Nntp-Posting-Host: maitai.src.honeywell.com

In article mumble mumble 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?

From "The Art of Electronics" by Horowitz and Hill pp 657

Taps         Sequence Length

33, 20         8589934591
35, 33        34358738367
36, 25        68719476735
39, 35       549755813887

Dennis ferguson@src.honeywell.com


Article 16412 of sci.electronics:
Path: Intrepid!maverick.ksu.ksu.edu!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.