# US 2026/0003569 A1 · Floating Point to Fixed Point Conversion

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0003569 A1
- Document ID: US20260003569A1
- Status: Published application
- Kind: A1
- Application number: 19/319,410
- Filed: 2025-09-04
- Published: 2026-01-01
- Earliest claimed: 2017-03-24
- Assignees: Imagination Technologies Limited
- Applicants: Imagination Technologies Limited
- Inventors: Kenneth Rovers
- Web page: https://patentgrep.com/patent/US20260003569A1

## CPC

- G06F 5/012: {in floating-point computations}
- G06F 7/4824: {using signed-digit representation}
- H03M 7/24: Conversion to or from floating-point codes
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

A binary logic circuit for converting a number in floating point format into a fixed point format. An inverting hardware circuit inverts bit values of an exponent. A shifter coupled to the inverting hardware circuit receives a significand input comprising a contiguous set of the most significant bits of the significand and right-shifts the significand input by a number of bits equal to the value represented by p least significant bits of the inverted exponent to generate a shifter output, wherein p is dependent on an integer width iw or a fractional width fw. A multiplexer coupled to the shifter receives an input comprising a contiguous set of bits of the shifter output, and outputs the input if the most significant bit of the exponent is equal to zero.

## Claims

### Claim 1

A binary logic circuit for converting a number in floating point format having an exponent E of ew bits, an exponent bias B given by B=2ew−1−1, and a significand comprising a mantissa M of mw bits into a fixed point format with an integer width of iw bits and a fractional width of fw bits, the binary logic circuit comprising:
an inverting hardware circuit configured to invert the bit values of the exponent;
a shifter coupled to the inverting hardware circuit configured to receive a significand input comprising a contiguous set of the most significant bits of the significand and configured to right-shift the significand input by a number of bits equal to the value represented by the p least significant bits of the inverted exponent to generate a shifter output, wherein p is dependent on the integer width iw or the fractional width fw; and
a multiplexer coupled to the shifter and configured to: receive an input comprising a contiguous set of bits of the shifter output; and output the input if the most significant bit of the exponent is equal to zero.

### Claim 2 (depends on 1)

The binary logic circuit as claimed in claim 1, further comprising a formatting hardware circuit coupled to the shifter, the formatting hardware circuit configured to receive as an input a string comprising the mw mantissa bits and to format the string to generate the significand input to the shifter.

### Claim 3 (depends on 2)

The binary logic circuit as claimed in claim 2, wherein the formatting hardware circuit is configured to truncate the (mw−fw) least significant bits of the mantissa when mw>fw.

### Claim 4 (depends on 1)

The binary logic circuit as claimed in claim 1, wherein the shifter has a bit width equal to: (1+sy)+min(fw, mw+2ew−1−2), where sy=1 for a signed floating point number and sy=0 for an unsigned floating point number.

### Claim 5 (depends on 1)

The binary logic circuit as claimed in claim 1, wherein the shifter has a shift range limited to the minimum of: i) 2ew−1−2; and ii) fw.

### Claim 6 (depends on 1)

The binary logic circuit as claimed in claim 1, further comprising a further formatting hardware circuit coupled to the shifter, the further formatting hardware circuit being configured to append (iw−1−sy) bits to the most significant bit of the shifter output, where sy=0 and the appended bits are zero bits for an unsigned floating point number, and sy=1 and the appended bits are sign bits for a signed floating point number.

### Claim 7 (depends on 1)

The binary logic circuit as claimed in claim 1, wherein the floating point format and fixed point format are such that fw<2ew−1−1 and p is equal to the bit width to represent fw; or the floating point and fixed point numbers are such that fw≥2ew−1−1 and p=ew−1.

### Claim 8 (depends on 1)

The binary logic circuit as claimed in claim 1, wherein the binary logic circuit further comprises exception-handling circuitry configured to output an exception result in response to detecting an exception condition from a set of exception conditions comprising at least one of: i) E>B+iw−1−sy; ii) E<B−fw, where sy=1 for a signed number and sy=0 for an unsigned number; and the binary logic circuit further comprises an output multiplexer configured to multiplex between the exception result and the output from the multiplexer coupled to the shifter.

### Claim 9 (depends on 1)

The binary logic circuit as claimed in claim 1, wherein the binary logic circuit further comprises an additional shifter operable to receive an additional significand input comprising a contiguous set of the most significant bits of the significand and configured to left-shift the additional significand input by a number of bits equal to the value represented by k least significant bits of the exponent to generate an additional shifter output, wherein k is dependent on the integer width iw or the fractional width fw.

### Claim 10 (depends on 9)

The binary logic circuit as claimed in claim 9, wherein the binary logic circuit further comprises an additional formatting hardware circuit coupled to the additional shifter, the additional formatting hardware circuit configured to receive as an input a string comprising the mw mantissa bits and to format the string to generate the additional significand input to the additional shifter.

### Claim 11 (depends on 10)

The binary logic circuit as claimed in claim 10, wherein the additional formatting hardware circuit is configured to perform one or more formatting operations comprising appending (iw−2−sy) bits to the most significant bit of the significand, where sy=0 and the appended bits are zero bits for an unsigned floating point number, and sy=1 and the appended bits are sign bits for a signed floating point number.

### Claim 12 (depends on 9)

The binary logic circuit as claimed in claim 9, wherein the additional shifter has a bit width equal to iw″+min(mw,(fw+iw″)), where iw″=min{(iw−2−sy), 2ew−1−2} where sy=0 for an unsigned floating point number, and sy=1 for a signed floating point number.

### Claim 13 (depends on 10)

The binary logic circuit as claimed in claim 10, wherein the additional formatting hardware circuit is configured to perform one or more formatting operations comprising appending (iw−1−sy) bits to the most significant bit of the significand, where sy=0 and the appended bits are zero bits for an unsigned floating point number, and sy=1 and the appended bits are sign bits for a signed floating point number.

### Claim 14 (depends on 9)

The binary logic circuit as claimed in claim 9, further comprising a correction hardware circuit coupled to the additional shifter and the multiplexer, the correction hardware circuit being configured to receive the additional shifter output and to discard its most significant bit and append a zero-bit to its least significant bit to form an additional input to the multiplexer.

### Claim 15 (depends on 9)

The binary logic circuit as claimed in claim 9, wherein the additional shifter has a bit width equal to iw′+min(mw, (fw+iw′), where iw′=min{iw−1−sy), 2ew−1−1} where sy=0 for an unsigned floating point number, and sy=1 for a signed floating point number.

### Claim 16 (depends on 10)

The binary logic circuit as claimed in claim 10, wherein the additional formatting hardware circuit is further configured to truncate a set of least significant bits of the mw mantissa bits that would not form part of the fw bits of the fixed point format if left-shifted by a value equal to the shift range of the additional shifter.

### Claim 17 (depends on 9)

The binary logic circuit as claimed in claim 9, wherein the additional shifter has a shift range limited to the minimum of: i) iw−2−sy; and ii) 2ew−1−2 where sy=0 for an unsigned floating point number, and sy=1 for a signed floating point number.

### Claim 18 (depends on 9)

The binary logic circuit as claimed in claim 9, wherein the floating point format and fixed point format are such that (iw−sy−1)<2ew−1−1, and k is equal to the bit width of the value (iw−sy−2); or the floating point format and fixed point format are such that 2ew−1−1≤(iw−sy−1), and k=ew−1, where sy=1 for a signed floating point number and sy=0 for an unsigned floating point number.

### Claim 19

A method of converting a number in floating point format having an exponent E of ew bits, an exponent bias B given by B=2ew−1−1, and a significand comprising a mantissa M of mw bits into a fixed point format with an integer width of iw bits and a fractional width of fw bits, the method comprising:
inverting at an inverting hardware circuit the bit values of the exponent;
receiving at a shifter a significand input comprising a contiguous set of the most significant bits of the significand and right-shifting the significand input by a number of bits equal to the value represented by the p least significant bits of the inverted exponent to generate a shifter output, wherein p is dependent on the integer width iw or the fractional width fw; and
receiving at a multiplexer an input comprising a contiguous set of bits of the shifter output and outputting the input if the most significant bit of the exponent is equal to zero.

### Claim 20

A non-transitory computer readable storage medium having stored thereon a computer readable dataset description of a binary logic circuit for converting a number in floating point format having an exponent E of ew bits, an exponent bias B given by B=2ew−1−1, and a significand comprising a mantissa M of mw bits into a fixed point format with an integer width of iw bits and a fractional width of fw bits that, when processed in an integrated circuit manufacturing system, causes the integrated circuit manufacturing system to manufacture an integrated circuit embodying the binary logic circuit, the binary logic circuit comprising:
an inverting hardware circuit configured to invert the bit values of the exponent;
a shifter coupled to the inverting hardware circuit configured to receive a significand input comprising a contiguous set of the most significant bits of the significand and configured to right-shift the significand input by a number of bits equal to the value represented by the p least significant bits of the inverted exponent to generate a shifter output, wherein p is dependent on the integer width iw or the fractional width fw, and
a multiplexer coupled to the shifter and configured to: receive an input comprising a contiguous set of bits of the shifter output; and output the input if the most significant bit of the exponent is equal to zero.
