Title

Optimal Mapping For 2-Bit High Speed Huffman Compression

Abstract

The efficiency of Huffman compression in communications networks can be significantly enhanced by a scheme called multibit decoding. The scheme is based on the concept of k-bit trees which are used to decode up to k bits at a time. An optimal solution for the mapping of 2-bit trees into memory is presented. The 2-bit mapping is storage efficient and offers an attractive way to obtain significant improvement in the speed of Huffman decoding.

Publication Date

12-1-1993

Publication Title

IEEE Global Telecommunications Conference

Volume

3

Number of Pages

1979-1983

Document Type

Article; Proceedings Paper

Identifier

scopus

Personal Identifier

scopus

Socpus ID

0027816352 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0027816352

This document is currently not available here.

Share

COinS