Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Correct FSE probability bit consumption in specification #3806

Merged
merged 2 commits into from
Nov 1, 2023
Merged

Correct FSE probability bit consumption in specification #3806

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
b38d87b
Clarify that the log2 of the largest possible symbol is the maximum n…
elasota Oct 31, 2023
324cce4
Add definition of "log2sup" function
elasota Oct 31, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 2 additions & 1 deletion doc/zstd_compression_format.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1083,7 +1083,8 @@ It depends on :
Presuming an `Accuracy_Log` of 8,
and presuming 100 probabilities points have already been distributed,
the decoder may read any value from `0` to `256 - 100 + 1 == 157` (inclusive).
Therefore, it must read `log2sup(157) == 8` bits.
Therefore, it may read up to `log2sup(157) == 8` bits, where `log2sup(N)`
is the smallest integer `T` that satisfies `(1 << T) > N`.

- Value decoded : small values use 1 less bit :
__example__ :
Expand Down