An SGH-tree based memory efficient and constant decoding algorithm for huffman codes

Yuh Jue Chuang*, Ja Ling Wu

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We proposed an SGH-based data structure to obtain a memory efficient and constant Huffman decoding algorithm. In cooperating with the Aggarwal and Narayan's algorithm, the proposed data structure spends constant time on decoding each symbol and needs less memory size. In addition, we derive some properties to reduce time for searching proposed codewrods. We believe that the proposed approach is useful for various multimedia coding applications, especially when the applications are conducted on memory bound devices.

Original languageEnglish
Title of host publication2004 International Symposium on Intelligent Multimedia, Video and Speech Processing, ISIMP 2004
Pages374-377
Number of pages4
StatePublished - 2004
Externally publishedYes
Event2004 International Symposium on Intelligent Multimedia, Video and Speech Processing, ISIMP 2004 - Hong Kong, China, Hong Kong
Duration: 20 10 200422 10 2004

Publication series

Name2004 International Symposium on Intelligent Multimedia, Video and Speech Processing, ISIMP 2004

Conference

Conference2004 International Symposium on Intelligent Multimedia, Video and Speech Processing, ISIMP 2004
Country/TerritoryHong Kong
CityHong Kong, China
Period20/10/0422/10/04

Fingerprint

Dive into the research topics of 'An SGH-tree based memory efficient and constant decoding algorithm for huffman codes'. Together they form a unique fingerprint.

Cite this