On linear dependencies in subspaces of LFSR-generated sequences
- 1 January 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 45 (10) , 1212-1216
- https://doi.org/10.1109/12.543715
Abstract
The probability of linear dependency in subsequences generated by linear feedback shift registers is examined. It is shown that this probability for a short subsequence, e.g., a sequence defined by the length of a scan chain, can be much higher than that for an entire m-sequence.Keywords
This publication has 7 references indexed in Scilit:
- Built-in test for circuits with scan based on reseeding of multiple-polynomial linear feedback shift registersIEEE Transactions on Computers, 1995
- A multiple seed linear feedback shift registerIEEE Transactions on Computers, 1992
- Calculating the effects of linear dependencies in m-sequences used as test stimuliIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- Design considerations for Parallel pseudoRandom Pattern GeneratorsJournal of Electronic Testing, 1990
- Hybrid designs generating maximum-length sequencesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
- Linear Dependencies in Linear Feedback Shift RegistersIEEE Transactions on Computers, 1986
- Exhaustive Generation of Bit Patterns with Applications to VLSI Self-TestingIEEE Transactions on Computers, 1983