eth-janishutz/eth-summaries
1
0
Fork 0
mirror of https://github.com/janishutz/eth-summaries.git synced 2026-03-14 10:50:05 +01:00
Code Issues Packages Projects Releases Wiki Activity

[SPCA] Floating point: Fix stupid explanation

Browse Source
This commit is contained in:
Janis Hutz
2026-01-30 07:45:02 +01:00
parent 54d01318d4
commit c8dd329674
2 changed files with 2 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
semester3/spca/parts/01_c/06_floating-point/04_rounding.tex
View File

@@ -17,7 +17,8 @@ $$
\underbrace{X_1X_2\ldots X_{k - 1}X_k}_\text{Sticky} \underbrace{X_1X_2\ldots X_{k - 1}X_k}_\text{Sticky}
$$ $$
where $n$ is the number of bits in the mantissa of the format (e.g. $3$ as in the above example of an $8$bit floating point number). where $n$ is the number of bits in the mantissa of the format (e.g. $3$ as in the above example of an $8$bit floating point number).
Do keep in mind that when computing them in \lC\ in the standard way, they are inverted, i.e. we need a \texttt{!= 0} at the end to correct. Do keep in mind that when computing them in \lC\ using shifts that we can use \texttt{!= 0} at the end to change the bit representation to all $0$s with a $0$ or $1$ at the end
(as opposed to possibly a one in a more significant bit).
\begin{enumerate} \begin{enumerate}
\item \textbf{Guard Bit} $G$ is the least significant bit of the (rounded) result (i.e. it is $B_n$) \item \textbf{Guard Bit} $G$ is the least significant bit of the (rounded) result (i.e. it is $B_n$)

BIN
semester3/spca/spca-summary.pdf
View File

Binary file not shown.