Encoding/decoding by symbol planes with dynamic calculation of probability tables

Abstract

The invention relates to an arithmetic encoding by bit planes (MSB,..., LSB), that comprises using tables of probability to have a 0 or 1 bit for encoding each bit plane. According to the invention, the probability tables are calculated dynamically for each signal frame based on a probability density model (Mod) corresponding to the distribution (H) of the signal (X) on each frame.

Description

technical field [0001] The invention relates to digital signal encoding / decoding for storage and / or transmission of digital signals such as speech signals, image signals, or in particular audio and / or video signals or even multimedia signals. Background technique [0002] In the basic compression methods of digital signals, they can be divided into lossless compression methods (Huffman coding, Golomb-Rice coding, arithmetic coding), which can also be called "entropy coding", and lossy compression methods based on scalar or vector quantization. compression method. [0003] Referring to Figure 1, a general compression encoder usually includes: [0004] - an analysis module 100 for analyzing the source S to be encoded, [0005] - quantization module 101 (scalar or vector), and [0006] - encoding module 102; [0007] The corresponding decoders include: [0008] - decoding module 103, [0009] - inverse quantization module 104, and [0010] - Synthesis module 105 . [00...

AI Technical Summary

Problems solved by technology

Therefore, the prior art known in the industry is not very flexible, since they all need to pre-compute and store information that can be adapted to specific operating conditions (bit rate, type of source)

Images