Huffman decoding method suitable for JPEG code stream

Abstract

This invention provides one Holman decoding method for JPEG codes flow, which comprises the following steps: a, according to the flow number list to establish minimum code sub list; b, according to the code number forming minimum code address list; c, adopting 0 to 16 bit comparer to get the Holman code relative RUN / SIZE list; d, according to SIZE value to restore codes front data. Comparing with current technique, this method forms different codes length minimum codes list and address list to lower the register array materials occupancy.

Description

technical field [0001] The invention belongs to the field of digital image processing, and is a method capable of quickly realizing Huffman decoding of JPEG code stream with less resources. Background technique [0002] Huffman (Hufferman) coding is mainly used in the compression coding of streaming media. It is a variable-length run-length coding. The run-length data is encoded with longer bits, so as to achieve the purpose of compressing data files. [0003] For Huffman software decoding, the traditional method is to restore the code table information in the code stream first. The code table information is generated by the encoder according to the statistical information. Therefore, in different code streams, the Huffman code table content and The lengths are all different, and the code table usually occupies a considerable amount of memory space. For example, the typical code table listed in the jpeg standard T.81 has a total length of about 4k bits. For a PC, this is a ...

AI Technical Summary

Problems solved by technology

[0003] For Huffman software decoding, the traditional method is to restore the code table information in the code stream first. The code table information is generated by the encoder according to the statistical information. Therefore, in different code streams, the Huffman code table content and The lengths are all different, and the code table usually occupies a considerable amount of memory space. For example, the typical code table listed in the jpeg standard T.81 has a total length of about 4k bits. For a PC, this is a very small memory footprint , but for an embedded system or ASIC design, this would be a non-trivial resource hog

[0004] In addition, when judging the codes in the code stream, the traditional implementation method is to use the search method based on the binary tree, which is a serial bit-by-bit judgment method. Usually, decoding a code will require more clock cycles.

Images