1 research outputs found
The optimal sequence compression
This paper presents the optimal compression for sequences with
undefined values.
Let we have undefined and defined positions in the
boolean sequence of length . The sequence code length
can\u27t be less then in general case, otherwise at least two
sequences will have the same code.
We present the coding algorithm which generates codes of almost
length, i.e. almost equal to the lower bound.
The paper presents the decoding circuit too. The circuit has low
complexity which depends from the inverse density of defined values
.
The decoding circuit includes RAM and random logic. It performs
sequential decoding. The total RAM size is proportional to the
the number of random logic cells is proportional to
So the decoding circuit will be small enough even for the very low
density sequences. The decoder complexity doesn\u27t depend of the
sequence length at all