| 摘要 |
A arithmetic coding data compression and decompression method for storing compressed data in non-contiguous memory. As the data is compressed and stored in memory, any non-contiguous segments are properly marked. Such marking requires that the last location contains a pointer to the next memory location used. Just prior to the pointer a special "LINK" sequence is stored. Thus, when the compressor completes its job, the non-contiguous memory is logically linked together. During decompression, if the decompressor encounters an illegal sequence, the decompressor must determine if this is an error condition or an indication that an address follows. If the illegal sequence is "LINK" the next location contains a pointer to the remaining compressed data. If that pointer is zero, then all the compressed data has been processed. If the address is non-zero, the decompressor jumps to the new address and continues de-compressing.
|
