Unlock instant, AI-driven research and patent intelligence for your innovation.
Numerical operation implementation method and circuit for Huffman coding
What is Al technical title?
Al technical title is built by PatSnap Al team. It summarizes the technical point description of the patent document.
A technology of Huffman coding and implementation method, which is applied in the field of data compression, can solve the problems of large storage space, low coding efficiency, and large amount of calculation, and achieve the effect of low energy consumption and improved coding efficiency
Pending Publication Date: 2020-03-06
GUANGDONG OCEAN UNIVERSITY
View PDF4 Cites 2 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
Problems solved by technology
[0010] In order to overcome the technical defects of the existing Huffman coding method realized by constructing a Huffman tree, which has a large amount of calculation, takes up a large amount of storage space and has low coding efficiency, the present invention provides a numerical operation realization method of Huffman coding and circuit
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
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
Embodiment 1
[0049] Such as figure 1 As shown, a numerical operation implementation method of Huffman coding includes the following steps:
[0050] S1: Statistics the occurrence probability of each character in the data, and obtain the character set and the corresponding probability set;
[0051] S2: Calculate the code length of each character in the character set of the data, abbreviate the code length sequence of each character as the code length set, and calculate the code length sequence according to the probability set and the code length set;
[0052] S3: According to the code length sequence, output the Huffman code through numerical calculation.
[0053] More specifically, the step S1 is specifically: the occurrence probability of each character in the statistical data to obtain the character set {s 1 ,s 2 ,...,s n} and the corresponding probability set {p 1 ,p 2 ,...,p n}.
[0054] Wherein, the step S2 specifically includes the following steps:
[0055] S21: Set the code ...
Embodiment 2
[0067] More specifically, on the basis of Embodiment 1, a circuit for implementing a numerical operation method using Huffman coding is provided, including a single-chipmicrocomputer, a memory, a display, an oscillation circuit, a reset circuit, and an adder module; wherein:
[0068] The input end of the single-chipmicrocomputer is electrically connected with the output end of the oscillation circuit and the reset circuit;
[0069] The output end of the single-chipmicrocomputer is electrically connected to the display;
[0070] The single-chip microcomputer is electrically connected with the memory and the adder module to realize data interaction, and the numerical operation realization method of Huffman coding is realized by combining the adder module and the single-chip microcomputer.
[0071] More specifically, the adder module includes a 74HC595 serial-to-parallel submodule, a 74LS283 full-adder submodule, and a 74HC165 parallel-to-serial submodule; wherein:
[0072] T...
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
Login to View More
Abstract
The invention provides a numerical operation implementation method for Huffman coding, which comprises the following steps of: counting the occurrence probability of each character in data to obtain acharacter set and a corresponding probability set; calculating the coding length of each character in the character set of the data, abbreviating the coding length sequence of each character as a code length set, and calculating the code length sequence according to the probability set and the code length set; according to the code length sequence, Huffman codes are output in a numerical operation mode, the code length sequence of a character set to be coded is calculated in a particularly simple and convenient mode, then the code length sequence is sorted, and codes of the character set aredirectly generated; under the condition that the Huffman tree is prevented from being constructed, the coding effect the same as that of classic Huffman normal form coding is obtained, redundant calculation and storage in construction of the Huffman tree are eliminated, and the coding efficiency is improved. The invention further provides a numerical operation implementation circuit for Huffman coding, and the implementation circuit is simple, easy to implement and low in energy consumption.
Description
technical field [0001] The present invention relates to the technical field of data compression, and more specifically, to a method and circuit for implementing Huffman coding numerical operations. Background technique [0002] Huffman coding is a compression coding technique that removes statistical redundancy of sources. Taking binary coding as an example, it is coded according to the combination of two source characters with the smallest statistical frequency (probability) into one. [0003] In the classic Huffman coding method, it mainly relies on building a Huffman tree, or generating a coding table based on the indexes of parent and child nodes. The existing main steps to construct a Huffman tree and generate a coding table are as follows: [0004] 1) According to the character set to be encoded {s 1 ,s 2 ,L,s n} and their probabilities (frequency) {p 1 ,p 2 ,L,p n}Construct a binary tree set F:{T 1 , T 2 ,L,T n}, where the tree T i There is only one weight...
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
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.
Login to View More 
Login to View More