Issue No. 10 - October (1996 vol. 45)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.543715
<p><b>Abstract</b>—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 <it>m</it>-sequence.</p>
Built-in self-test, linear dependencies, linear feedback shift registers, primitive polynomials, scan designs.
J. Tyszer and J. Rajski, "On Linear Dependencies in Subspaces of LFSR-Generated Sequences," in IEEE Transactions on Computers, vol. 45, no. , pp. 1212-1216, 1996.