Premium
Transformed HCT for parallel Huffman decoding
Author(s) -
Wang Guoyu,
Zhang Hongsheng,
Lu Mingying
Publication year - 2015
Publication title -
international journal of circuit theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.364
H-Index - 52
eISSN - 1097-007X
pISSN - 0098-9886
DOI - 10.1002/cta.2044
Subject(s) - huffman coding , canonical huffman code , decoding methods , computer science , prefix code , code (set theory) , parallel computing , algorithm , arithmetic , mathematics , code rate , block code , concatenated error correction code , data compression , systematic code , set (abstract data type) , programming language
Summary This paper proposes a novel and generic Huffman code table (HCT) transform and a simple parallel Huffman decoding method. Codes of the original HCT are left‐aligned, reordered in value, and partitioned into sub‐bands. Two kinds of modification to the codes are introduced in order to reduce the number of sub‐bands. The Huffman decoder can be implemented with a minimized size of single LUT, and the parallel decoding can be completed easily, at a constant rate of up to one code per cycle. An example of MP3 decoder and AAC decoder has been designed to demonstrate the efficiency of the proposed method. Copyright © 2014 John Wiley & Sons, Ltd.