Article

LFSR Reseeding with Irreducible Polynomials

Authors:

Snehal Udar,

Dimitri KagarisAuthors Info & Claims

IOLTS '07: Proceedings of the 13th IEEE International On-Line Testing Symposium

Pages 293 - 298

https://doi.org/10.1109/IOLTS.2007.43

Published: 08 July 2007 Publication History

Publisher Site

Abstract

We propose an innovative scheme for LFSR reseeding based on the efficient generation of the seeds of any non-primitive irreducible polynomial. The scheme has very small hardware overhead irrespective of the number of seeds and guarantees that the generation of the pattern subsequence from each seed is disjoint. Experimental results demonstrate the potential of the mechanism for pseudorandom test pattern generation in a parallel chain test-per-scan environment.

Cited By

View all

Gardner DSăźLăźGean APhan R(2013)Efficient Generation of Elementary SequencesProceedings of the 14th IMA International Conference on Cryptography and Coding - Volume 830810.1007/978-3-642-45239-0_2(16-27)Online publication date: 17-Dec-2013
https://dl.acm.org/doi/10.1007/978-3-642-45239-0_2
Ahmad AHayat L(2011)Selection of polynomials for cyclic redundancy check for the use of high speed embeddedWSEAS Transactions on Computers10.5555/2001170.200117310:1(16-20)Online publication date: 1-Jan-2011
https://dl.acm.org/doi/10.5555/2001170.2001173
Mioc M(2009)Simulation study of the functioning of LFSR for grade 4 irreducible polynomialsProceedings of the 8th WSEAS International Conference on Software engineering, parallel and distributed systems10.5555/1553890.1553896(27-32)Online publication date: 21-Feb-2009
https://dl.acm.org/doi/10.5555/1553890.1553896

Index Terms

LFSR Reseeding with Irreducible Polynomials
1. Hardware
2. Mathematics of computing
  1. Mathematical analysis
    1. Numerical analysis
      1. Computations on polynomials

Recommendations

A ROMless LFSR Reseeding Scheme for Scan-based BIST
ATS '02: Proceedings of the 11th Asian Test Symposium

In this paper we present a new LFSR reseedling scheme for scan-based BIT suitable for circuits with random-pattern-resistant faults.The proposed scheme eliminates the need of a ROM for storing the seeds since the reseedings are performed dynamically by ...
Deviation-based LFSR reseeding for test-data compression

Linear feedback shift register (LFSR) reseeding forms the basis for many test-compression solutions. A seed can be computed for each test cube by solving a system of linear equations based on the feedback polynomial of the LFSR. Despite the availability ...
Self-reciprocal irreducible polynomials with prescribed coefficients

We prove estimates for the number of self-reciprocal monic irreducible polynomials over a finite field of odd characteristic, that have the t lower degree coefficients fixed to given values. Our estimates imply that one may specify up to m/2-log"q(2m)-1 ...

Comments

Information & Contributors

Information

Published In

IOLTS '07: Proceedings of the 13th IEEE International On-Line Testing Symposium

July 2007

260 pages

ISBN:0769529186

Publisher

IEEE Computer Society

United States

Publication History

Published: 08 July 2007

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 29 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Gardner DSăźLăźGean APhan R(2013)Efficient Generation of Elementary SequencesProceedings of the 14th IMA International Conference on Cryptography and Coding - Volume 830810.1007/978-3-642-45239-0_2(16-27)Online publication date: 17-Dec-2013
https://dl.acm.org/doi/10.1007/978-3-642-45239-0_2
Ahmad AHayat L(2011)Selection of polynomials for cyclic redundancy check for the use of high speed embeddedWSEAS Transactions on Computers10.5555/2001170.200117310:1(16-20)Online publication date: 1-Jan-2011
https://dl.acm.org/doi/10.5555/2001170.2001173
Mioc M(2009)Simulation study of the functioning of LFSR for grade 4 irreducible polynomialsProceedings of the 8th WSEAS International Conference on Software engineering, parallel and distributed systems10.5555/1553890.1553896(27-32)Online publication date: 21-Feb-2009
https://dl.acm.org/doi/10.5555/1553890.1553896

Abstract

Cited By

Index Terms

Recommendations

A ROMless LFSR Reseeding Scheme for Scan-based BIST

Deviation-based LFSR reseeding for test-data compression

Self-reciprocal irreducible polynomials with prescribed coefficients

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations