A Source Binary Arithmetic Coding Method and Coding System Based on Sectional Computation
A technology of arithmetic coding and binary code, which is applied in the field of binary arithmetic coding method and device, can solve the problem that the sequence can only be processed serially, and achieve the effect of alleviating word length constraints and reducing the range of large floating-point operations
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0045] Now suppose that the symbol sets 0 and 1 correspond to the probabilities 0.2 and 0.8, and the corresponding cumulative probabilities are 0 and 0.2. The original sequence S is 101100, and the process of directly using conventional arithmetic coding is shown in Table 1.
[0046] Table 1
[0047] Coding symbol Lower limit of interval F Section width W air 01 10.21*0.8＝0.8 00.20.8*0.2＝0.16 10.2+0.16*0.2＝0.2320.16*0.8＝0.128 10.232+0.128*0.2＝0.25760.128*0.8＝0.1024 00.25760.1024*0.2＝0.02048 00.2576
[0048] After the above coding process, the lower limit of the coding interval of S is 0.2576, and the interval width is 0.004096.
Embodiment 2
[0050] The original sequence and related probabilities of this embodiment are the same as in embodiment 1. In this embodiment, the original sequence is split into two sequences, S 1 : 101 and S 2 : 100, where the sequence S 1 The coding interval has been calculated in Table 1, F 1 = 0.232, W 1 = 0.128.
[0051] The interval arithmetic coding process and results of sequence 100 are shown in Table 2.
[0052] Table 2
[0053] Coding symbolLower limit of interval F 2
Section width W 2
air 01 10.20.8 00.20.16 00.20.032
[0054] After the above encoding process, S is obtained 2 The lower limit of the coding interval F 2 =0.2, interval width W 2 = 0.032. According to formulas 9 and 10, the lower limit of the coding interval of the original sequence S:
[0055] F=F 1 +F 2 W 1 =0.232+0.2*0.128=0.2576;
[0056] Coding interval width: W=W 1 *W 2 =0.128*0.032=0.004096, which is the same as the encoding result of the first embodiment.
Embodiment 3
[0058] In this embodiment, the original sequence S is 101100110, and the symbol correlation probability is the same as in embodiment 1. The coding system adopted in this embodiment includes a main control module and two binary arithmetic coding modules A and B. First, the main control module divides the binary code stream S to be encoded into 2 sub-sequences S 1 And S 2 , Where S 1 It is: 101100, which is encoded by the first binary arithmetic coding module A; S 2 It is: 110, which is encoded by the second binary arithmetic encoding module B. A is to S 1 When encoding, set S 1 Divide into 2 subsequences again S 11 And S 12 , And establish two sub-threads to synchronize encoding. After the sub-threads finish encoding, A calculates S according to the encoding result 1 The encoding result. B vs. S 2 Encode. After both A and B are encoded, the main control module calculates the encoding result of the original sequence S according to the encoding results of A and B.
[0059] In this...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More