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, ...Show MoreMetadata
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.
Published in: IEEE Transactions on Computers ( Volume: 45, Issue: 10, October 1996)
DOI: 10.1109/12.543715
