Article View: comp.lsi.testing
Article #79Re: maximum-length LFSRs
From: Jeff Dean - LSI Test
Date: Mon, 21 Dec 1992 15:05
Date: Mon, 21 Dec 1992 15:05
23 lines
1555 bytes
1555 bytes
In article <20246@ksr.com> chuck@ksr.com (Chuck Shavit) writes: >I am looking for an algorithm to compute a primitive polynomial of a Linear >Feedback Shift Register. A primitive polynomial is a polynomial that cause >an n-bit LFSR to generate a sequence 2**n-1 different numbers (usually >there are many such polynomials for a given n; I am interested in just >one...). >Chuck Shavit >Kendall Square Research >chuck@ksr.com Chuck - why bother computing them? Find an error correcting codes text at the library or bookstore. They should have tables of pre-computed primitive polys over GF(2) for you. I have a table in my hands for degrees 2 through 28, so if you need one in that range let me know. jd -- ============================================================================== | |\ /| Commodore Technology | | 'O O` Jeffrey Dean 1200 Wilson Drive | | > v < VLSI Test and Design Assurance West Chester, PA 19380 | | ^ dean@commodore.com | ==============================================================================
Technical Details
Message-ID:
<38093@cbmvax.commodore.com>Path:
arc1-ca.pugleaf.net!sparky!uunet!stanford.edu!rutgers!cbmvax!deanReferences:
<20246@ksr.com>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!stanford.edu!rutgers!cbmvax!dean From: dean@cbmvax.commodore.com (Jeff Dean - LSI Test) Newsgroups: comp.lsi.testing Subject: Re: maximum-length LFSRs Message-ID: <38093@cbmvax.commodore.com> Date: 21 Dec 92 15:05:59 GMT References: <20246@ksr.com> Distribution: comp.lsi.testing Organization: Commodore Lines: 23