Self-adaptive finite state entropy coding method

A finite state, entropy coding technology, applied in the field of data coding, can solve the problem of not coding method, reduced precision, only binary coding, etc., to meet coding requirements, stable and reliable compression rate, fast coding speed effect.

Active Publication Date: 2019-12-20
唐驰鹏
View PDF6 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The asymmetric number system includes three variant methods: the unified asymmetric binary system, the range variable asymmetric number system and the entry asymmetric number system, but none of them ...

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
  • Self-adaptive finite state entropy coding method
  • Self-adaptive finite state entropy coding method
  • Self-adaptive finite state entropy coding method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0064] see figure 1 As shown, the embodiment of the present invention provides an adaptive finite state entropy encoding method, the method includes an encryption process, and the encoding process includes the following steps:

[0065] S1. Scan the original data to be encoded, and calculate the initial alphabet set Σ and frequency set F;

[0066] S2. In order to ensure that F does not appear in the frequency set F after the execution of adaptive finite state entropy coding i = 0, it is necessary to add 1 to all the elements of the frequency set of initial statistics, that is, to generate a new set F={F 1 +1,F 2 +1,...,F n +1}, and calculate the corresponding cumulative distribution set A according to the elements in the new frequency set F. At the same time, in order to ensure that the decoded data is in the same order as the original data, it is necessary to read the data in order from the end to the beginning. Finally, an initial value is assigned to the state x, and x s...

Embodiment 2

[0085] see figure 2 As shown, the second embodiment of the present invention also provides an adaptive finite state entropy coding method, the method also includes a corresponding decoding process for data decoding, the decoding process includes the following steps:

[0086] A1. The decoding side and the encoding side have the same original data alphabet set Σ={s 1 ,s 2 ,...,s n}, and the same encoding output alphabet set Γ={t 0 ,t 1 ,...,t γ-1}, take the encoding end state x=0 as the initial state of decoding, since the frequency set is added by 1 at the beginning of encoding, so the frequency set F is all 1 at the end of encoding, and the corresponding decoding initial frequency set is also all 1 , ie F={F 1 , F 2 ,...,F n}={1,1,...,1}, and then establish the corresponding cumulative distribution set A={A 0 ,A 1 ,...,A n}, and enter step A2, since F is all 1, so according to A i The definition of can get A={0,1,2,..,n}, such as Figure 4As shown, the initial fr...

Embodiment 3

[0101] The third embodiment of the present invention also provides a method for adaptive finite state entropy coding. In order to perform performance optimization, the method further includes the following steps:

[0102] When the alphabet set Σ={s 1 ,s 2 ,...,s n} when n is 2, that is, when encoding and decoding bit data, the frequency set F and the cumulative distribution set A only contain 2 and 3 elements respectively, and A 0 ≡0,A 1 ≡F 1 , the actual useful element in the cumulative distribution set A is only 1, at this time, use the binary index tree to maintain and update the cumulative distribution set A, or use binary search to find s during decoding i Neither can accelerate the effect, so in this case, use an array or an independent variable to maintain the elements in the frequency set F and the cumulative distribution set A, and use the conditional branch to find s i more efficient;

[0103] When the alphabet set Σ={s 1 ,s 2 ,...,s n} in n=2 8 When , that...

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

The invention discloses a self-adaptive finite state entropy coding method, and relates to the field of data compression. The method comprises the steps of scanning to-be-coded data to obtain a frequency set of symbols, preprocessing the frequency set, dynamically maintaining and updating the frequency set and an accumulated distribution set, and performing adaptive coding based on a coding rule in combination with reforming processing to obtain coded output data; establishing an initial frequency set of which the elements are all 1, reading in to-be-decoded data, performing self-adaptive decoding based on a decoding rule and in combination with inverse reforming processing, dynamically maintaining and updating the frequency set and the cumulative distribution set, and obtaining decoded output data; and converting the alphabet set of the to-be-coded data and the alphabet set of the coded output data, and performing adaptive finite state entropy coding on the to-be-coded data to obtainencrypted data. According to the invention, on the premise of ensuring the coding precision, the coding steps are simplified, the coding speed is improved, and the coding requirements at the present stage can be better met.

Description

technical field [0001] The invention relates to the technical field of data encoding, in particular to an adaptive finite state entropy encoding method. Background technique [0002] Entropy coding is a lossless data compression method based on information entropy theory. Common coding includes: Shannon coding, Huffman coding and arithmetic coding, which are widely used in image, video, voice, text and other data compression. [0003] In the field of the Internet, data compression technology not only reduces storage requirements, but also reduces the bandwidth occupation of data transmission, which greatly saves the cost of data storage and transmission. Lossless compression has always been a hot topic of research by scholars at home and abroad. Huffman coding and arithmetic coding, as the leaders of entropy coding, have been widely used in various fields after continuous technical improvement. [0004] Huffman coding, also known as optimal coding, is a variable-length codi...

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): H04N19/13H04N19/169H04N19/91
CPCH04N19/13H04N19/169H04N19/91
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