Exact posit decoding #
Every posit word is classified, and ordinary values decode into the shared exact dyadic carrier. The one-pass compiled decoder is proved equal to the transparent field-based definition.
Decode a nonzero finite posit code into the shared dyadic execution carrier.
The sign and the encoded word are separate arguments, so callers that already classified the word
can reuse the extraction. decodeFiniteDyadic below is the model-facing entry point.
Instances For
Decode a nonzero finite posit into the shared dyadic execution carrier.
This decoder computes sign restoration, regime scanning, and trailing-field powers once.
decodeFields exposes the same quantities as independent projections for proofs, and the theorem
below proves the two agree.
Instances For
The one-pass execution decoder agrees with the field decoder used in proofs.
Complete exact interpretation of a posit word.
- zero
{format : Format}
: ExactValue format
The unique zero word.
- finite
{format : Format}
(fields : DecodedFields format)
: ExactValue format
A nonzero finite dyadic rational together with its tapered fields.
- nar
{format : Format}
: ExactValue format
The unique Not-a-Real word.
Instances For
Instances For
Instances For
Decode every posit word, retaining its exact tapered fields.
Instances For
Characterize the nonzero finite branch of exact posit decoding.
Decode the ordinary value into the shared exact dyadic carrier.
none means NaR and nothing else. The unique posit zero maps to the canonical dyadic zero, and all
other words keep their exact sign, integer significand, and binary scale.
Instances For
Exact decoding recognizes the unique posit zero word.
Exact decoding recognizes the unique posit NaR word.
The unique posit zero maps to the canonical shared dyadic zero.