How can I get first n bits of floating point number as integer in python

核能气质少年 提交于 2019-12-06 06:01:57

If you want the n most significant bits, one way to start is to use math.frexp to normalise your number to lie in the range [0.5, 1.0). Then multiplying by 2**n and taking the integer part will give you what you need.

>>> import math
>>> math.frexp(24.54883)  # significand and exponent
(0.7671509375, 5)
>>> math.frexp(24.54883)[0]  # just the significand
0.7671509375
>>> int(math.frexp(24.54883)[0] * 2**4)  # most significant 4 bits
12

Instead of explicitly computing a power of 2 to scale by, you could use the math.ldexp function to do the second part of the operation.

>>> int(math.ldexp(math.frexp(24.54883)[0], 4))
12

You can use struct.pack() to convert a floating point number to a list of bytes, and then extract the bits you're interested in from there.

While the number is greater than or equal to 1, divide by 2.
Multiply by 2**n
Round or truncate to an integer.

Here is a simplified Java program for the test case:

public class Test {
  public static void main(String[] args) {
    double in = 24.548838022726972;
    while (in >= 1) {
      in /= 2;
      System.out.println(in);
    }
    in *= 16;
    System.out.println(in);
    System.out.println((int) in);
  }
}

Output:

12.274419011363486
6.137209505681743
3.0686047528408715
1.5343023764204358
0.7671511882102179
12.274419011363486
12

A direct way to obtain the significant bits of the mantissa in the IEEE 754 format with builtin functions is:

In [2]: u=24.54883

In [3]: bin(u.as_integer_ratio()[0])
Out[3]: '0b11000100011001000000000011111011101010001000001001101'

In [4]: u=.625

In [5]: bin(u.as_integer_ratio()[0])
Out[5]: '0b101'

You obtain 0b1 + mantissa without non significant 0.

易学教程内所有资源均来自网络或用户发布的内容,如有违反法律规定的内容欢迎反馈
该文章没有解决你所遇到的问题?点击提问,说说你的问题,让更多的人一起探讨吧!