Thread View: comp.lsi.testing
3 messages
3 total messages
Started by Chuck Shavit
Fri, 18 Dec 1992 22:08
maximum-length LFSRs
Author: Chuck Shavit
Date: Fri, 18 Dec 1992 22:08
Date: Fri, 18 Dec 1992 22:08
15 lines
700 bytes
700 bytes
Dear Netters, 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...). Thanks, Chuck Shavit Kendall Square Research chuck@ksr.com
Re: maximum-length LFSRs
Author: 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 | ==============================================================================
Re: maximum-length LFSRs
Author: Michele Favalli
Date: Wed, 23 Dec 1992 09:50
Date: Wed, 23 Dec 1992 09:50
28 lines
1398 bytes
1398 bytes
Primitive polynomials are tabulated, look for instance:
author = "P. H. Bardell and W. H. Mc{A}nney and J. Savir",
address = "New York",
publisher = "John Wiley & sons",
title = "Built-In Test for VLSI - Pseudorandom Techniques",
year = "1987",
or
author = "S. W. Golomb",
address = "S. Francisco",
publisher = "Holden-Day",
title = "Shift-Register Sequences",
year = "1967",
Best regards
Michele Favalli
==============================================================================
Michele Favalli
DEIS - University of Bologna tel. 39-51-644-3082
Viale Risorgimento 2 fax. 39-51-644-3073
40136 Bologna - ITALY e-mail: michele@deis16.cineca.it
==============================================================================
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