CAN NONLINEAR COMPACTORS BE BETTER THAN LINEAR ONES

Authors
Citation
M. Kopec, CAN NONLINEAR COMPACTORS BE BETTER THAN LINEAR ONES, I.E.E.E. transactions on computers, 44(11), 1995, pp. 1275-1282
Citations number
13
Categorie Soggetti
Computer Sciences","Engineering, Eletrical & Electronic","Computer Science Hardware & Architecture
ISSN journal
00189340
Volume
44
Issue
11
Year of publication
1995
Pages
1275 - 1282
Database
ISI
SICI code
0018-9340(1995)44:11<1275:CNCBBT>2.0.ZU;2-2
Abstract
This paper presents a new analytical method for estimating compaction quality, based on the entropy, Maximization of the entropy of the sign ature 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 lin ear feedback shift registers (LFSRs) and the counting compactors, as w ell, 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 probabil ity of 2(-n), is found, It is shown that they are considerably better than the simplest linear compactor (feedback shift register) and in ma ny cases are quite as good as linear compactors (LFSRs) having primiti ve polynomials, On the opposite side, compactors based on counters are far worse than CFSRs. The family of CFSRs is much greater than the al ready explored family of LFSRs and some CFSRs require less overhead.