Multiple-symbol parallel decoding for variable length codes
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Memory Efficient and Low Complexity Variable Length Decoding for MPEG-4 Applications
ICPPW '07 Proceedings of the 2007 International Conference on Parallel Processing Workshops
A concurrent memory-efficient VLC decoder for MPEG applications
IEEE Transactions on Consumer Electronics
An efficient VLSI architecture of VLD for AVS HDTV decoder
IEEE Transactions on Consumer Electronics
An Area-Efficient Variable Length Decoder IP Core Design for MPEG- Video Coding Applications
IEEE Transactions on Circuits and Systems for Video Technology
Hi-index | 0.00 |
Huffman coding is a popular and important lossless compression scheme for various multimedia applications. This paper presents a low-latency parallel Huffman decoding technique with efficient memory usage for multimedia standards. First, the multi-layer prefix grouping technique is proposed for sub-group partition. It exploits the prefix characteristic in Huffman codewords to solve the problem of table size explosion. Second, a two-level table lookup approach is introduced which can promptly branch to the correct sub-group by level-1 table lookup and decode the symbols by level-2 table lookup. Third, two optimization approaches are developed; one is to reduce the branch cycles and the other is parallel processing between two-level table lookup and direct table lookup approaches to fully utilize the advantage of VLIW parallel processing. An AAC Huffman decoding example is realized on the Parallel Architecture Core DSP (PAC DSP) processor. The simulation results show that the proposed method can further improve about 89% of decoding cycles and 33% of table size comparing to the linear search method.