## Sunday, June 16, 2024

### Decode a Float (Solution)

We can multiply or divide a floating point number by 2 without changing the bits in the mantissa. So we can rescale the number to be in the range [1, 2) by repeatedly multiplying or dividing by 2. The leftmost bit of the mantissa is always 1, but next bit determines whether the number is in the top half of the range or the bottom half. So if the number is equal to or greater than 1.5, the next bit is 1, otherwise it is 0.

If the number is in the range [1, 2), we can subtract 1 from it. The remaining bits will be shifted left until the leftmost bit is 1. If the number is greater than or equal to 1.5, then subtracting 1 will shift the bits left by one. But if the number is in [1, 1.5), we won’t know how many zero bits will be shifted out when we subtract 1. What we’ll do is add .5 to the number to turn on the next bit, then subtract 1 to shift the bits left by one.

Here is the code in Common Lisp:

```(defun float->bits (float)

(cond ((>= count 52) nil)
((> float 2.0d0) (read-bits (/ float 2.0d0) count))
((< float 1.0d0) (read-bits (* float 2.0d0) count))
((>= float 1.5d0) (cons 1 (read-bits (- float 1.0d0) (1+ count))))
(t (cons 0 (read-bits (- (+ float .5d0) 1.0d0) (1+ count))))))```

Note that all these operations are exact and do not cause round off.