Multiple-symbol parallel decoding for variable length codes
Authors:
- S. VassiliadisSVS. Vassiliadis
- J. TakalaJTJ. Takala
- P. LiuhaPLP. Liuha
- 28 June 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 12 (7) , 676-685
Abstract
In this paper, a multiple-symbol parallel variable length decoding (VLD) scheme is introduced. The scheme is capable of decoding all the codewords in an N-bit block of encoded input data stream. The proposed method partially breaks the recursive dependency related to the VLD. First, all possible codewords in the block are detected in parallel and lengths are returned. The procedure results redundant number of codeword lengths from which incorrect values are removed by recursive selection. Next, the index for each symbol corresponding the detected codeword is generated from the length determining the page and the partial codeword defining the offset in symbol table. The symbol lookup can be performed independently from symbol table. Finally, the sum of the valid codeword lengths is provided to an external shifter aligning the encoded input stream for a new decoding cycle. In order to prove feasibility and determine the limiting factors of our proposal, the variable length decoder has been implemented on an field-programmable gate-array (FPGA) technology. When applied to MPEG-2 standard benchmark scenes, on average 4.8 codewords are decoded per cycle resulting in the throughput of 106 million symbols per second.Keywords
This publication has 17 references indexed in Scilit:
- MPEG-compliant entropy decoding on FPGA-augmented TriMedia/CPU642003
- Parallel multiple-symbol variable-length decoding2003
- New approaches to high speed Huffman decoding2002
- MPEG macroblock parsing and pel reconstruction on an FPGA-augmented TriMedia processor2002
- A new approach of group-based VLC codec system with full table programmabilityIEEE Transactions on Circuits and Systems for Video Technology, 2001
- A parallel decoder of programmable Huffman codesIEEE Transactions on Circuits and Systems for Video Technology, 1995
- High speed pattern matching for a fast Huffman decoderIEEE Transactions on Consumer Electronics, 1995
- An investigation of binary CLA and ripple CMOS adder designsMicroprocessing and Microprogramming, 1994
- Design and hardware implementation of a memory efficient Huffman decodingIEEE Transactions on Consumer Electronics, 1994
- Efficient VLSI designs for data transformation of tree-based codesIEEE Transactions on Circuits and Systems, 1991