Introduction to finite fields and their applications
Introduction to finite fields and their applications
Linear Dependencies in Linear Feedback Shift Registers
IEEE Transactions on Computers
Built-in test for VLSI: pseudorandom techniques
Built-in test for VLSI: pseudorandom techniques
A coordinated approach to partitioning and test pattern generation for pseudoexhaustive testing
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Avoiding linear dependencies in LFSR test pattern generators
Journal of Electronic Testing: Theory and Applications
On Linear Dependencies in Subspaces of LFSR-Generated Sequences
IEEE Transactions on Computers
Novel Test Pattern Generators for Pseudo-Exhaustive Testing
Proceedings of the IEEE International Test Conference on Designing, Testing, and Diagnostics - Join Them
Pseudoexhaustive TPG with a Provably Low Number of LFSR Seeds
ICCD '00 Proceedings of the 2000 IEEE International Conference on Computer Design: VLSI in Computers & Processors
Tools and devices supporting the pseudo-exhaustive test
EURO-DAC '90 Proceedings of the conference on European design automation
Cellular automata-based test pattern generators with phase shifters
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 14.98 |
Abstract--Linear Feedback Shift Registers (LFSRs) are popular mechanisms for built-in test pattern generation (TPG). They are normally used with a primitive characteristic polynomial because, in that case, only one initialization state (seed) is required. In this paper, we show that if the characteristic polynomial is nonprimitive irreducible, the required seeds can still be efficiently generated. We establish a formula that shows how the seeds of any nonprimitive irreducible polynomial relate to each other. This leads to an efficient hardware implementation with small hardware overhead, irrespective of the number of seeds, and enhances the choices available for the design of appropriate TPG structures in the case of pseudoexhaustive TPG that were previously limited to primitive characteristic polynomials only.