Citation
Abstract
Recursive interleaved entropy coding is a promising new adaptable binary entropy coding technique that ofiers fast encoding and decoding at high compression e–ciency [1]. However, with the encoding methods presented in [1], the maximum memory required by the encoder is proportional to the source sequence length. In this article, we present a new encoding technique, and corresponding decoding technique, that limits encoder memory usage without limiting the source sequence length. We illustrate the improvement in compression e–ciency over the alternative memory-e–cient technique that partitions the source sequence into smaller blocks. We present a generalized encoding framework that encompasses both memorye–cient encoding methods and includes additional variations as well.
Keywords
Details
- Volume
- 42-146
- Published
- August 15, 2001
- Pages
- 1–14
- File Size
- 216.9 KB