Length-Limited Variable-to-Variable Length Codes for High-Performance Entropy Coding
Conference
·
OSTI ID:15013735
Arithmetic coding achieves a superior coding rate when encoding a binary source, but its lack of speed makes it an inferior choice when true high-performance encoding is needed. We present our work on a practical implementation of fast entropy coders for binary messages utilizing only bit shifts and table lookups. To limit code table size we limit our code lengths with a type of variable-to-variable (VV) length code created from source string merging. We refer to these codes as ''merged codes''. With merged codes it is possible to achieve a desired level of speed by adjusting the number of bits read from the source at each step. The most efficient merged codes yield a coder with a worst-case inefficiency of 0.4%, relative to the Shannon entropy. Using a hybrid Golomb-VV Bin Coder we are able to achieve a compression ratio that is competitive with other state-of-the-art coders, at a superior throughput.
- Research Organization:
- Lawrence Livermore National Laboratory (LLNL), Livermore, CA
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 15013735
- Report Number(s):
- UCRL-CONF-200991
- Country of Publication:
- United States
- Language:
- English
Similar Records
Length-Limited Variable-to-Variable Length Codes for High-Performance Entropy Coding
Merged Source Word Codes for Efficient, High-Speed Entropy Coding
Length-Limited Data Transformation and Compression
Conference
·
Sun Jan 04 23:00:00 EST 2004
·
OSTI ID:15013628
Merged Source Word Codes for Efficient, High-Speed Entropy Coding
Conference
·
Wed Dec 04 23:00:00 EST 2002
·
OSTI ID:15005833
Length-Limited Data Transformation and Compression
Thesis/Dissertation
·
Thu Sep 01 00:00:00 EDT 2005
·
OSTI ID:877882