@@ -274,7 +274,7 @@ The FFV1 bitstream contains one or more Quantization Table Sets. Each Quantizati
274
274
SVGI:!---
275
275
SVGI:![ svg] ( quantizationtablesets.svg " quantization table sets ")
276
276
SVGI:!---
277
- SVGC: quantizationtablesets .svg=Q_ {j}[ k] =quant\\\ _ tables[ i] [ j ] [ k\\ &255]
277
+ SVGC: quantizationtablesets .svg=$$ Q_{j}[k]=quant\\_tables[i][j][k\\&255] $$
278
278
AART: Q_ { j } [ k] = quant_tables[ i] [ j ] [ k&255]
279
279
280
280
In this formula, ` i ` is the Quantization Table Set index, ` j ` is the Quantized Table index, ` k ` the Quantized Sample Difference.
@@ -373,7 +373,7 @@ Instead of coding the n+1 bits of the Sample Difference with Huffman or Range co
373
373
SVGI:!---
374
374
SVGI:![ svg] ( samplediff.svg " coding of the sample difference ")
375
375
SVGI:!---
376
- SVGC: samplediff .svg=$$ coder\\\ _input=[(sample\ \\_difference+2^{bits-1})\\&(2^{bits}-1)]-2^{bits-1} $$
376
+ SVGC: samplediff .svg=$$ coder\\_input=[(sample\\_difference+2^{bits-1})\\&(2^{bits}-1)]-2^{bits-1} $$
377
377
AART: coder_input = [ (sample_difference + 2 ^ (bits - 1)) &
378
378
AART: (2 ^ bits - 1)] - 2 ^ (bits - 1)
379
379
Figure: Description of the coding of the Sample Difference in the bitstream. {#figureSampleDifference}
@@ -389,13 +389,13 @@ To encode binary digits efficiently a Range coder is used. `C(i)` is the i-th Co
389
389
SVGI:!---
390
390
SVGI:![ svg] ( rangebinaryvalues1.svg " range binary values 1 ")
391
391
SVGI:!---
392
- SVGC: rangebinaryvalues1 .svg=$$ r\_ {i}=\\\\lfloor\\\\frac{R_{i}S_{i,C_{i}}}{2^{8}}\\\\rfloor$$
392
+ SVGC: rangebinaryvalues1 .svg=$$ r_ {i}=\\\\lfloor\\\\frac{R_{i}S_{i,C_{i}}}{2^{8}}\\\\rfloor$$
393
393
AART: r_ { i } = floor( ( R_ {i} * S_ {i,C_ {i}} ) / 2 ^ 8 )
394
394
395
395
SVGI:!---
396
396
SVGI:![ svg] ( rangebinaryvalues2.svg " range binary values 2 ")
397
397
SVGI:!---
398
- SVGC: rangebinaryvalues2 .svg=$$ \\\\begin{array}{ccccccccc} S\_ {i+1,C\_ {i}}=zero\\_state\_{S\_ {i,C\_ {i}}} & \\\\wedge & l{}\_{ i}=L\_ {i} & \\\\wedge & t\_ {i}=R\_ {i}-r\_ {i} & \\\\Longleftarrow & b\_ {i}=0 & \\\\Longleftrightarrow & L\_ {i}<R\_ {i}-r\_ {i} \\\\\\ S\_ {i+1,C\_ {i}}=one\_state\_{S\_ {i,C\_ {i}}} & \\\\wedge & l\_ {i}=L\_ {i}-R\_ {i}+r\_ {i} & \\\\wedge & t\_ {i}=r\_ {i} & \\\\Longleftarrow & b\_ {i}=1 & \\\\Longleftrightarrow & L\_ {i}\\\\geq R\_ {i}-r\_ {i} \\\\end{array} $$
398
+ SVGC: rangebinaryvalues2 .svg=$$ \\\\begin{array}{ccccccccc} S_ {i+1,C_ {i}}=zero\\_state_{S_ {i,C_ {i}}} & \\\\wedge & l_{ i}=L_ {i} & \\\\wedge & t_ {i}=R_ {i}-r_ {i} & \\\\Longleftarrow & b_ {i}=0 & \\\\Longleftrightarrow & L_ {i}<R_ {i}-r_ {i} \\\\\\ S_ {i+1,C_ {i}}=one\\_state_{S_ {i,C_ {i}}} & \\\\wedge & l_ {i}=L_ {i}-R_ {i}+r_ {i} & \\\\wedge & t_ {i}=r_ {i} & \\\\Longleftarrow & b_ {i}=1 & \\\\Longleftrightarrow & L_ {i}\\\\geq R_ {i}-r_ {i} \\\\end{array} $$
399
399
AART: S_ {i+1,C_ {i}} = zero_state_ {S_ {i,C_ {i}}} AND
400
400
AART: l_i = L_i AND
401
401
AART: t_i = R_i - r_i <==
@@ -411,13 +411,13 @@ AART: L_i >= R_i - r_i
411
411
SVGI:!---
412
412
SVGI:![ svg] ( rangebinaryvalues3.svg " range binary values 3 ")
413
413
SVGI:!---
414
- SVGC: rangebinaryvalues3 .svg=$$ \\\\begin{array}{ccc}S\_ {i+1,k}=S\_ {i,k} & \\\\Longleftarrow & C\_ {i} \\\\neq k\\\\end{array} $$
414
+ SVGC: rangebinaryvalues3 .svg=$$ \\\\begin{array}{ccc}S_ {i+1,k}=S_ {i,k} & \\\\Longleftarrow & C_ {i} \\\\neq k\\\\end{array} $$
415
415
AART: S_ {i+1,k} = S_ {i,k} <== C_i != k
416
416
417
417
SVGI:!---
418
418
SVGI:![ svg] ( rangebinaryvalues4.svg " range binary values 4 ")
419
419
SVGI:!---
420
- SVGC: rangebinaryvalues4 .svg=$$ \\\\begin{array}{ccccccc} R\_ {i+1}=2^{8}t\_ {i} & \\\\wedge & L\_ {i+1}=2^{8}l\_ {i}+B\_{j\_ {i}} & \\\\wedge & j\_ {i+1}=j\_ {i}+1 & \\\\Longleftarrow & t\_ {i}<2^{8}\\\\\\ R\_ {i+1}=t\_ {i} & \\\\wedge & L\_ {i+1}=l\_ {i} & \\\\wedge & j\_ {i+1}=j\_ {i} & \\\\Longleftarrow & t\_ {i}\\\\geq2^{8}\\\\end{array} $$
420
+ SVGC: rangebinaryvalues4 .svg=$$ \\\\begin{array}{ccccccc} R_ {i+1}=2^{8}t_ {i} & \\\\wedge & L_ {i+1}=2^{8}l_ {i}+B_{j_ {i}} & \\\\wedge & j_ {i+1}=j_ {i}+1 & \\\\Longleftarrow & t_ {i}<2^{8}\\\\\\ R_ {i+1}=t_ {i} & \\\\wedge & L_ {i+1}=l_ {i} & \\\\wedge & j_ {i+1}=j_ {i} & \\\\Longleftarrow & t_ {i}\\\\geq2^{8}\\\\end{array} $$
421
421
AART: R_ {i+1} = 2 ^ 8 * t_ {i} AND
422
422
AART: L_ {i+1} = 2 ^ 8 * l_ {i} + B_ {j_ {i}} AND
423
423
AART: j_ {i+1} = j_ {i} + 1 <==
@@ -509,14 +509,14 @@ At keyframes all Range coder state variables are set to their initial state.
509
509
SVGI:!---
510
510
SVGI:
511
511
SVGI:!---
512
- SVGC:statetransitiontable1.svg=$$one\\\_state\_ {i}=default\\\ _state\\\_transition\_ {i}+state\\\ _transition\\\_delta\_ {i}$$
512
+ SVGC:statetransitiontable1.svg=$$one\\_state_ {i}=default\\_state\\_transition_ {i}+state\\_transition\\_delta_ {i}$$
513
513
AART:one_state_{i} =
514
514
AART: default_state_transition_{i} + state_transition_delta_{i}
515
515
516
516
SVGI:!---
517
517
SVGI:
518
518
SVGI:!---
519
- SVGC:statetransitiontable2.svg=$$zero\\\_state\_ {i}=256-one\\\_state\_ {256-i}$$
519
+ SVGC:statetransitiontable2.svg=$$zero\\_state_ {i}=256-one\\_state_ {256-i}$$
520
520
AART:zero_state_{i} = 256 - one_state_{256-i}
521
521
522
522
#### default\_state\_transition
@@ -1080,7 +1080,7 @@ Inferred to be 0 if not present.
1080
1080
SVGI:!---
1081
1081
SVGI:
1082
1082
SVGI:!---
1083
- SVGC:initialstatedelta1.svg=$$ pred = j ? initial\\ _states[ i ][j - 1][ k ] : 128$$
1083
+ SVGC:initialstatedelta1.svg=pred = j ? initial\_states[ i ][j - 1][ k ] : 128
1084
1084
AART:pred = j ? initial_states[ i ][j - 1][ k ] : 128
1085
1085
1086
1086
SVGI:!---
0 commit comments