Issue No. 11 - November (1995 vol. 44)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.475123
<p><it>Abstract</it>—This paper presents a new analytical method for estimating compaction quality, based on the entropy. Maximization of the entropy of the signature results in an increase of compaction quality. The paper studies the influence of the architecture of a compactor on the entropy growth. This approach is suitable for nonlinear compactors, widely known linear feedback shift registers (LFSRs) and the counting compactors, as well. Useful theorems to determine entropy growth during the test have been given and proven. Furthermore, the class of nonlinear compactors based on shift registers named cyclic feedback shift registers (CFSRs), which guarantee the maximal entropy growth and the aliasing probability of 2<super>−<it>n</it></super>, is found. It is shown that they are considerably better than the simplest linear compactor (feedback shift register) and in many cases are quite as good as linear compactors (LFSRs) having primitive polynomials. On the opposite side, compactors based on counters are far worse than CFSRs. The family of CFSRs is much greater than the already explored family of LFSRs and some CFSRs require less overhead.</p>
Aliasing probability, built-in self-test, data compaction, linear feedback shift register, nonlinear feedback shift register, signature analysis.
Michal Kopec, "Can Nonlinear Compactors Be Better than Linear Ones?", IEEE Transactions on Computers, vol. 44, no. , pp. 1275-1282, November 1995, doi:10.1109/12.475123