Merged Source Word Codes for Efficient, High-Speed Entropy Coding

PDF Version Also Available for Download.

Description

We present our work on fast entropy coders for binary messages utilizing only bit shifts and table lookups. To minimize code table size we limit our code lengths with a novel type of variable-to-variable (VV) length code created from source word merging. We refer to these codes as merged codes. With merged codes it is possible to achieve a desired level of efficiency by adjusting the number of bits read from the source at each step. The most efficient merged codes yield a coder with an inefficiency of 0.4%, relative to the Shannon entropy, in the worst case. On one … continued below

Physical Description

PDF-FILE: 13 ; SIZE: 0.2 MBYTES pages

Creation Information

Senecal, J; Joy, K & Duchaineau, M December 5, 2002.

Context

This article is part of the collection entitled: Office of Scientific & Technical Information Technical Reports and was provided by the UNT Libraries Government Documents Department to the UNT Digital Library, a digital repository hosted by the UNT Libraries. More information about this article can be viewed below.

Who

People and organizations associated with either the creation of this article or its content.

Sponsor

Publisher

Provided By

UNT Libraries Government Documents Department

Serving as both a federal and a state depository library, the UNT Libraries Government Documents Department maintains millions of items in a variety of formats. The department is a member of the FDLP Content Partnerships Program and an Affiliated Archive of the National Archives.

Contact Us

What

Descriptive information to help identify this article. Follow the links below to find similar items on the Digital Library.

Description

We present our work on fast entropy coders for binary messages utilizing only bit shifts and table lookups. To minimize code table size we limit our code lengths with a novel type of variable-to-variable (VV) length code created from source word merging. We refer to these codes as merged codes. With merged codes it is possible to achieve a desired level of efficiency by adjusting the number of bits read from the source at each step. The most efficient merged codes yield a coder with an inefficiency of 0.4%, relative to the Shannon entropy, in the worst case. On one of our test systems a current implementation of coder using merged codes has a throughput of 35 Mbytes/sec.

Physical Description

PDF-FILE: 13 ; SIZE: 0.2 MBYTES pages

Source

  • Data Compression Conference, Snowbird, UT (US), 03/25/2003--03/27/2003

Language

Item Type

Identifier

Unique identifying numbers for this article in the Digital Library or other systems.

  • Report No.: UCRL-JC-150989
  • Grant Number: W-7405-ENG-48
  • Office of Scientific & Technical Information Report Number: 15005833
  • Archival Resource Key: ark:/67531/metadc1417003

Collections

This article is part of the following collection of related materials.

Office of Scientific & Technical Information Technical Reports

Reports, articles and other documents harvested from the Office of Scientific and Technical Information.

Office of Scientific and Technical Information (OSTI) is the Department of Energy (DOE) office that collects, preserves, and disseminates DOE-sponsored research and development (R&D) results that are the outcomes of R&D projects or other funded activities at DOE labs and facilities nationwide and grantees at universities and other institutions.

What responsibilities do I have when using this article?

When

Dates and time periods associated with this article.

Creation Date

  • December 5, 2002

Added to The UNT Digital Library

  • Jan. 23, 2019, 12:54 p.m.

Description Last Updated

  • Feb. 6, 2019, 4:49 p.m.

Usage Statistics

When was this article last used?

Yesterday: 0
Past 30 days: 0
Total Uses: 2

Interact With This Article

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

International Image Interoperability Framework

IIF Logo

We support the IIIF Presentation API

Senecal, J; Joy, K & Duchaineau, M. Merged Source Word Codes for Efficient, High-Speed Entropy Coding, article, December 5, 2002; California. (https://digital.library.unt.edu/ark:/67531/metadc1417003/: accessed May 16, 2024), University of North Texas Libraries, UNT Digital Library, https://digital.library.unt.edu; crediting UNT Libraries Government Documents Department.

Back to Top of Screen