公开(公告)号：US20220156043A1

公开(公告)日：2022-05-19

申请号：US17588671

申请日：2022-01-31

Applicant: Imagination Technologies Limited

Inventor： Sam Elliott ,  Jonas Olof Gunnar KALLEN ,  Casper Van Benthem

IPC: G06F7/485 ,  G06F7/24 ,  G06F7/501 ,  H03K19/20

Abstract: Adder circuits and associated methods for processing a set of at least three floating-point numbers to be added together include identifying, from among the at least three numbers, at least two numbers that have the same sign—that is, at least two numbers that are both positive or both negative. The identified at least two numbers are added together using one or more same-sign floating-point adders. A same-sign floating-point adder comprises circuitry configured to add together floating-point numbers having the same sign and does not include circuitry configured to add together numbers having different signs.

公开(公告)号：US20240126507A1

公开(公告)日：2024-04-18

申请号：US18544313

申请日：2023-12-18

Applicant: Imagination Technologies Limited

Inventor： Sam Elliott ,  Jonas Olof Gunnar KALLEN ,  Casper Van Benthem

IPC: G06F7/485 ,  G06F7/24 ,  G06F7/501 ,  H03K19/20

CPC classification number: G06F7/485 ,  G06F7/24 ,  G06F7/501 ,  H03K19/20

Abstract: Adder circuits and associated methods for processing a set of at least three floating-point numbers to be added together include identifying, from among the at least three numbers, at least two numbers that have the same sign—that is, at least two numbers that are both positive or both negative. The identified at least two numbers are added together using one or more same-sign floating-point adders. A same-sign floating-point adder comprises circuitry configured to add together floating-point numbers having the same sign and does not include circuitry configured to add together numbers having different signs.

公开(公告)号：US20210141745A1

公开(公告)日：2021-05-13

申请号：US17153620

申请日：2021-01-20

Applicant: Imagination Technologies Limited

Inventor： Jonas Olof Gunnar KALLEN

IPC: G06F13/16 ,  G06F16/901 ,  G06F9/50 ,  G06F9/48 ,  G06F13/364

Abstract: Methods and arbiters for arbitrating between a plurality of ordered requestors and a shared resource based on priorities allocated to the requestors. The methods include determining whether there is at least one requestor that has requested access in the current cycle and has priority in the current cycle; in response to determining that there is at least one requestor that has requested access in the current cycle and has priority in the current cycle, selecting a lowest ordered requestor that has requested access in the current cycle and has priority in the current cycle; and in response to determining that there are no requestors that have requested access in the current cycle and have priority in the current cycle, selecting a highest ordered requestor that has requested access in the current cycle.