DocumentCode
2013750
Title
Optimal mapping for 2-bit high speed Huffman compression
Author
Bassiouni, Mostafa A. ; Mukherjee, Amar
Author_Institution
Dept. of Comput. Sci., Univ. of Central Florida, Orlando, FL, USA
fYear
1993
fDate
29 Nov-2 Dec 1993
Firstpage
1979
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
Keywords
Huffman codes; data compression; decoding; encoding; 2 bit; 2-bit mapping; Huffman decoding; communications networks; high speed Huffman compression; k-bit trees; multibit decoding; optimal mapping; Communication networks; Computer science; Data compression; Decoding; Discrete cosine transforms; Frequency; Image coding; Image databases; Transform coding; Vegetation mapping;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 1993, including a Communications Theory Mini-Conference. Technical Program Conference Record, IEEE in Houston. GLOBECOM '93., IEEE
Conference_Location
Houston, TX
Print_ISBN
0-7803-0917-0
Type
conf
DOI
10.1109/GLOCOM.1993.318410
Filename
318410
Link To Document