Invention Grant
- Patent Title: Performing constant modulo arithmetic
-
Application No.: US15149312Application Date: 2016-05-09
-
Publication No.: US10372420B2Publication Date: 2019-08-06
- Inventor: Thomas Rose
- Applicant: Imagination Technologies Limited
- Applicant Address: GB Kings Langley
- Assignee: Imagination Technologies Limited
- Current Assignee: Imagination Technologies Limited
- Current Assignee Address: GB Kings Langley
- Agency: Vorys, Sater, Seymour and Pease LLP
- Agent Vincent M DeLuca
- Priority: GB1507893.4 20150508
- Main IPC: G06F7/72
- IPC: G06F7/72

Abstract:
A binary logic circuit for determining y=x mod(2m−1), where x is an n-bit integer, y is an m-bit integer, and n>m, includes reduction logic configured to reduce x to a sum of a first m-bit integer β and a second m-bit integer γ; and addition logic configured to calculate an addition output represented by the m least significant bits of the following sum right-shifted by m: a first binary value of length 2m, the m most significant bits and the m least significant bits each being the string of bit values represented by β; a second binary value of length 2m, the m most significant bits and the m least significant bits each being the string of bit values represented by γ; and the binary value 1.
Public/Granted literature
- US20160328212A1 Performing Constant Modulo Arithmetic Public/Granted day:2016-11-10
Information query