So here is what we have, a custom IEEE based setup:
Consider a five-bit floating representation based on the IEEE floating point format with 1 sign bit, two exponent bits and 2 significand bits.
And a selection of bits that needed to be converted to binary (answers included):
0 00 00 = 0
0 00 01 = 0.01
0 00 10 = 0.10
0 00 11 = 0.11
0 01 00 = 1.00
0 01 01 = 1.01
0 01 10 = 1.10
The way I was attempting to calculate the above was as:
2^(2-1) -1 = 1 (the bias)
for the second one, this would mean 0 -1 (since the exponent field is zero), so 0.1 * 10-1 = .01. only prob is that we dont seem to be adding the implicit leading 1. why not? and yet it seems for the values with a positive exponent (see 5 and below) we do indeed add the leading one. bit stumped as to what im missing.
many thanks!