User Tools

Site Tools


haas:fall2023:discrete:projects:blf0

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
haas:fall2023:discrete:projects:blf0 [2024/04/12 07:12] – external edit 127.0.0.1haas:fall2023:discrete:projects:blf0 [2024/04/12 07:18] (current) – [Process] wedge
Line 24: Line 24:
 Floating point data also has an encoding scheme for storage. There are actually a few different floating point standards. One of the common, classic ones frequently found in use is that of IEEE754, which we will focus on in this project. Floating point data also has an encoding scheme for storage. There are actually a few different floating point standards. One of the common, classic ones frequently found in use is that of IEEE754, which we will focus on in this project.
  
-{{:haas:fall2023:discrete:projects:ieee-754-english.jpg|}}+{{:haas:fall2023:discrete:projects:ieee754-binary-wikipedia.png|binary layout of IEEE754 (sourced from wikipedia article)}}
  
 ====Process==== ====Process====
-Walking through the decoding scheme, we'll start with an instance of IEEE754-encoded data: **C378C000**+Walking through the decoding scheme, we'll start with an instance of IEEE754-encoded data: **0xC378C000**
  
 The first step is to visualize it in binary so we can proceed to divide it into its distinct components. Doing a simple hexadecimal to binary conversion yields: The first step is to visualize it in binary so we can proceed to divide it into its distinct components. Doing a simple hexadecimal to binary conversion yields:
Line 37: Line 37:
  
 ^  sign (bit 31)  ^  exponent (bits 30-23)  ^  mantissa (bits 22-0)  | ^  sign (bit 31)  ^  exponent (bits 30-23)  ^  mantissa (bits 22-0)  |
-|  1  |  100 0011 0  |  111 1000 1100 0000 0000 0000  |+|  1  |  <nowiki>100 0011 0</nowiki>  |  <nowiki>111 1000 1100 0000 0000 0000</nowiki>  |
  
 ===Determine the exponent=== ===Determine the exponent===
-In this example, we have **1000 0110** or **0x86** in our exponent section.+In this example, we have **<nowiki>1000 0110</nowiki>** or **0x86** in our exponent section.
  
 What we do now is take that value, and subtract a **0x7F** from it to get our actual exponent value: What we do now is take that value, and subtract a **0x7F** from it to get our actual exponent value:
Line 49: Line 49:
 We then start to setup our whole number value, which conceptually is to the immediate left of the mantissa. We assign a 1 to it by default. As a result, our floating point value (in binary) is currently: We then start to setup our whole number value, which conceptually is to the immediate left of the mantissa. We assign a 1 to it by default. As a result, our floating point value (in binary) is currently:
  
-  * 1 . 111 1000 1100 0000 0000 0000+  * <nowiki>1 . 111 1000 1100 0000 0000 0000</nowiki>
  
 ===bit shift by exponent=== ===bit shift by exponent===
Line 68: Line 68:
  
 ===determine value to the left of the decimal point=== ===determine value to the left of the decimal point===
-The value we have to the left of the decimal point is **11111000**, which when converted to decimal is **248**.+The value we have to the left of the decimal point is **<nowiki>11111000</nowiki>**, which when converted to decimal is **248**.
  
 We prefix the sign to this (1 indicates negative, which in this example it was), so: **-248.** We prefix the sign to this (1 indicates negative, which in this example it was), so: **-248.**
Line 75: Line 75:
 Now, to get the component to the right of the decimal point, we basically add together the bit positions, which correspond to **1/2^-position**, where position starts at 1. Now, to get the component to the right of the decimal point, we basically add together the bit positions, which correspond to **1/2^-position**, where position starts at 1.
  
-So, with our current value of **1100 0000 0000 0000**, we have exactly 2 values containing a 1. Positions 1 and 2.+So, with our current value of **<nowiki>1100 0000 0000 0000</nowiki>**, we have exactly 2 values containing a 1. Positions 1 and 2.
  
 According to our formula: According to our formula:
Line 93: Line 93:
   * <nowiki>- 248 . 75</nowiki>   * <nowiki>- 248 . 75</nowiki>
  
-Therefore, **C378C000** decodes as **-248.75**+Therefore, **0xC378C000** decodes as **-248.75**
 =====TASK===== =====TASK=====
 Your task is to write a program that will take in various encoded IEEE754 binary values, and to decode and ultimately display the decoded value. Your task is to write a program that will take in various encoded IEEE754 binary values, and to decode and ultimately display the decoded value.
haas/fall2023/discrete/projects/blf0.1712920349.txt.gz · Last modified: 2024/04/12 07:12 by 127.0.0.1