Binary16 Internal Representation

0.0(0)
Studied by 0 people
call kaiCall Kai
Locked
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/27

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 4:25 AM on 9/6/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

28 Terms

1
New cards

Packed FP16 Representation

The standard 16-bit IEEE-754 encoding used to store or communicate a binary16 value.

2
New cards

Internal FP16 Representation

A hardware-friendly form in which the encoded fields are transformed into information such as sign, unbiased exponent, working significand, and classification for arithmetic processing.

3
New cards

FP16 Unpacking

The process of converting a packed 16-bit FP16 encoding into fields and derived information convenient for the arithmetic datapath.

4
New cards

FP16 Packing

The process of constructing the final 16-bit IEEE-754 binary16 encoding from a prepared sign, stored exponent, fraction, and classification.

5
New cards

The arithmetic datapath benefits from an explicit significand and unbiased exponent rather than repeatedly interpreting the packed IEEE fields.

Why is an FP16 value unpacked before ordinary floating-point arithmetic?

6
New cards

Field Extraction

The first unpacking step in which the sign, stored exponent, and fraction are separated from the 16-bit FP16 word.

7
New cards

The hidden leading 1 is restored.

What does the unpacker add to the fraction when constructing the significand of a normal FP16 value?

8
New cards

{1'b1, Fraction}

How is the 11-bit internal significand of a normal FP16 value constructed?

9
New cards

{1'b0, Fraction}

How is the internal significand constructed when the FP16 value is not normal?

10
New cards

StoredExponent - 15

How does the Proteus unpacker calculate the unbiased exponent of a normal FP16 value?

11
New cards

-14

What unbiased exponent does the Proteus unpacker assign to a subnormal value?

12
New cards

-14

What placeholder effective exponent does the Proteus unpacker assign to signed zero?

13
New cards

Because zero has a zero significand, so the assigned exponent does not change its numerical value.

Why is assigning an effective exponent of -14 to signed zero harmless in the Proteus unpacker?

14
New cards

0

What exponent placeholder does the Proteus unpacker provide for Infinity or NaN?

15
New cards

Infinity and NaN must be recognized from their classification rather than interpreted through the ordinary finite-number exponent datapath.

Why must arithmetic hardware not treat the unpacker's exponent placeholder for Infinity or NaN as a numerical exponent?

16
New cards

Classification-Aware Unpacking

Unpacking in which the construction of internal arithmetic information depends on whether the encoded operand is normal, subnormal, zero, infinity, or NaN.

17
New cards

The classification signals tell later hardware whether the unpacked exponent and significand should participate in ordinary finite arithmetic.

Why does classification information accompany the unpacked numerical fields?

18
New cards

NaN Payload Preservation

The practice of retaining the NaN fraction information while converting the encoded NaN into an internal representation.

19
New cards

The lower 10 bits continue to contain the supplied fraction even though the leading internal significand bit is zero.

How does the Proteus unpacker preserve NaN payload information in its significand output?

20
New cards

FP16 Packer

A module that converts prepared floating-point result information back into the standard 16-bit binary16 encoding.

21
New cards

The packer expects earlier stages such as normalization and rounding to prepare the normal result's exponent and fraction.

Why is the FP16 packer not responsible for performing ordinary normalization and rounding?

22
New cards

For a normal result, the packer stores the sign, prepared biased exponent, and 10-bit fraction while omitting the implicit leading 1.

How does the packer encode a prepared normal finite result?

23
New cards

For a zero result, it forces the exponent and fraction to zero while preserving the supplied sign.

How does the packer preserve signed zero?

24
New cards

For an infinity result, it uses exponent 11111, fraction zero, and preserves the supplied sign.

How does the packer construct positive or negative Infinity?

25
New cards

The quiet bit of the NaN fraction is forced to 1.

What does the Proteus packer enforce when packing a quiet NaN?

26
New cards

The quiet bit is cleared, and if that would leave the entire fraction zero, another payload bit is set.

How does the Proteus packer prevent a signaling NaN from accidentally being encoded as Infinity?

27
New cards

Canonical Quiet NaN Fallback

The safe output policy in which the packer produces a canonical quiet NaN if it receives an unsupported or invalid internal classification.

28
New cards

Unpack → Process → Pack

The fundamental FP16 datapath pattern in which an IEEE encoding is translated into arithmetic-friendly information, processed internally, and converted back into an IEEE encoding.