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 directly into the shared dyadic execution carrier.
The sign and complete encoded word are supplied separately so callers that already classified the
word can reuse the same extraction. decodeFiniteDyadic below remains the model-facing boundary.
Instances For
Decode a nonzero finite posit directly 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; the theorem
below establishes their equality.
Instances For
The one-pass execution decoder agrees exactly with the proof-facing field decoder.
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 directly into the shared exact dyadic carrier.
none identifies NaR exactly. The unique posit zero maps to the canonical dyadic zero; all other
words retain 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.