Huffman decoding method suitable for JPEG code stream

A decoding method and code sub-technology, which is applied in the field of digital image processing, can solve the problems of occupying a large memory space, small memory occupation, multiple clock cycles, etc., and achieve the effects of reducing time, improving decoding speed, and reducing occupancy

Inactive Publication Date: 2007-08-15
上海广电集成电路有限公司
View PDF0 Cites 22 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

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

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Huffman decoding method suitable for JPEG code stream
  • Huffman decoding method suitable for JPEG code stream
  • Huffman decoding method suitable for JPEG code stream

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0014] Please refer to Fig. 1, Fig. 2, Fig. 3 and Fig. 4, the Huffman decoding method suitable for JPEG code stream provided by the present invention comprises the steps:

[0015] a) obtain the minimum code subtable and the minimum code subaddress table from the code subnumber in the JPEG code stream;

[0016] The Huffman code table in the JPEG code stream is divided into two parts. The 16 bytes of the first part correspond to the number of 1 to 16-bit codes; the second part corresponds to the specific RUN / SIZE symbol, the number of which is the sum of the first 16 bytes, and the minimum code subtable C ( n) n (0

[0017] Assuming that L(n) represents the number of codes with a length of n (0

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

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 ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06T9/00H04N7/30H04N7/26H04N19/44
Inventor 吴彪
Owner 上海广电集成电路有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap