Consider a 9-bit floating-point representation based on the IEEE floating-point

Question

Consider a 9-bit floating-point representation based on the IEEE floating-point format, with one sign bit, four exponent bits (k 4), and four fraction bits (n 34). The exponent bias is 4-1 7. In this exercise you need to multiply 2 floating point numbers. We outline the algorithm (for floating point multiplication at each step--- you need to carefully carry out each step that requires filling out the given blanks. You may find this link helpful http://www.cs.umd.edu/class/sum2003/cmsc311/N Assuming the given 9-bit IEEE floating- point format, multiply X 29 and Y 0.15625. 1) First covert X and Y to their bit representations. Please specify the bit pattern within double quotation marks and without a space. (E.g.: "011100010") Bit Pattern

Explanation / Answer

X="000011101"

Y=".001010000"

X="1.1101"*2^4

Y="1.01"*2^-3

Y=1

Z="10.010001"

Z="1.0010001"*2^1

Sign bit=0

Z="10010001"*2^-6

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.