Lines Matching full:decoding

77 Unlike frames, each block depends on previous blocks for proper decoding.
155 Decoding this byte is enough to tell the size of `Frame_Header`.
423 - Previous FSE decoding tables, required by `Repeat_Mode`
426 Note that decoding tables aren't always from the previous `Compressed_Block`.
428 - Every decoding table can come from a dictionary.
556 The size of `Huffman_Tree_Description` is determined during decoding process,
765 #### Decoding Sequences
784 FSE decoding requires a 'state' to be carried from symbol to symbol.
785 For more explanation on FSE decoding, see the [FSE section](#fse).
787 For sequence decoding, a separate state keeps track of each
805 After decoding the starting states, a single sequence is decoded
812 ##### Decoding a sequence
819 Decoding starts by reading the `Number_of_Bits` required to decode `Offset`.
825 Using the rules pre-calculated in the decoding tables,
837 its FSE decoding table is generated from a predefined distribution table defined here.
838 For details on how to convert this distribution into a decoding table, see the [FSE section].
840 [FSE section]: #from-normalized-distribution-to-decoding-tables
843 The decoding table uses an accuracy log of 6 bits (64 states).
852 The decoding table uses an accuracy log of 6 bits (64 states).
862 The decoding table uses an accuracy log of 5 bits (32 states),
973 and their content ignored, resuming decoding after the skippable frame.
1014 FSE encoding/decoding involves a state that is carried over between symbols,
1015 so decoding must be done in the opposite direction as encoding.
1024 FSE decoding involves a decoding table which has a power of 2 size, and contain three elements:
1037 To decode FSE streams, it is necessary to construct the decoding table.
1047 it will be discovered and reported by the decoding process.
1090 [next section]:#from-normalized-distribution-to-decoding-tables
1099 decoding is complete.
1108 #### From normalized distribution to decoding tables
1111 to create a unique decoding table.
1174 During decoding, the next state value is determined from current state value,
1179 [Appendix A]: #appendix-a---decoding-tables-for-predefined-codes
1217 and require more memory or more complex decoding operations.
1307 It will create a Decoding Table.
1316 decoding a single symbol and updating their state.
1321 If updating state after decoding a symbol would require more bits than
1355 Given a Huffman decoding table,
1392 it's possible to compare extracted value to decoding table,
1398 the decoding process is considered faulty.
1443               Repeat distribution mode for sequence decoding.
1465 Appendix A - Decoding tables for predefined codes
1468 This appendix contains FSE decoding tables
1471 "from normalized distribution to decoding tables".
1473 to crosscheck that an implementation build its decoding tables correctly.
1675 - 0.3.4 : clarifications for FSE decoding table