IP Library Granted Patent US 9,032,010
Granted Patent B2
US 9,032,010 · App. 13/664,428 · Granted May 12, 2015

Integer divider module

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,032,010
App. No.
13/664,428
Granted
May 12, 2015
Kind
B2
Abstract

A method includes receiving a dividend and a divisor for performing a division operation. Numbers p and n are found, for which the divisor equals 2 n (1+2 p ). An interim result, which is equal to a reciprocal of 1+2 p multiplied by the dividend, is calculated. The interim result is divided by 2 n to produce a result of the division operation.

Claims (27)

1. A method of dividing by a divisor having the form 2 n (1+2 p ), where p, n are integers, comprising:

receiving a dividend and a divisor, by an integer divider module, for performing a division operation;

finding, by the integer divider module, numbers p and n for which the divisor equals 2 n (1+2 p );

calculating an interim result that is equal to a reciprocal of 1+2 p multiplied by the dividend, and

dividing the interim result by 2 n , by a dedicated hardware unit, to produce a result of the division operation.

2. The method according to claim 1 , wherein calculating the interim result comprises evaluating a binary fraction having a pattern of alternating runs of p binary “1”s and p binary “0”s after the binary point.

3. The method according to claim 1 , wherein calculating the interim result comprises evaluating a finite number of terms in a power series of 1/2 2p .

4. The method according to claim 3 , wherein evaluating the finite number of the terms comprises evaluating a first number of the terms recursively from a second number of the terms that is smaller than the first number.

5. The method according to claim 1 , wherein receiving the divisor comprises receiving a length of a record in a memory.

6. The method according to claim 1 , wherein dividing the interim result by 2 n comprises shifting the interim result by a shifter.

7. The method according to claim 1 , comprising

determining, by a dedicated hardware determination unit, whether the divisor is a sum of two integer powers of two;

if the divisor is not a sum of two integer powers of two, dividing the dividend by the divisor by a general divider; and

if the divisor is determined to be a sum of two integer powers of two, performing the acts of finding numbers p and n, calculating the interim result and dividing the interim result by 2 n .

8. The method according to claim 1 , wherein calculating the interim result comprises calculating a reciprocal of 1+2 p and multiplying the reciprocal by the dividend.

9. The method according to claim 1 , wherein calculating the interim result comprises calculating a sum of terms of a series.

10. An apparatus, comprising:

an interface, which is configured to receive a dividend and a divisor for performing a division operation; and

a divider module, which is configured to find numbers p and n for which the divisor equals 2 n (1+2 p ), to calculate an interim result that is equal to a reciprocal of 1+2 p multiplied by the dividend, and to divide the interim result by 2 n , by a dedicated hardware unit, to produce a result of the division operation.

11. The apparatus according to claim 10 , wherein the divider module is configured to calculate the interim result by evaluating a binary fraction having a pattern of alternating runs of p binary “1”s and p binary “0”s after the binary point.

12. The apparatus according to claim 10 , wherein the divider module is configured to calculate the interim result by evaluating a finite number of terms in a power series of 1/2 2p .

13. The apparatus according to claim 12 , wherein the divider module is configured to evaluate a first number of the terms recursively from a second number of the terms that is smaller than the first number.

14. The apparatus according to claim 10 , and comprising a memory, and wherein the result of the division operation is provided to the memory in accessing the memory.

15. The apparatus according to claim 10 , wherein the dedicated hardware unit comprises a shifter which performs the division of the interim result by 2 n .

16. The apparatus according to claim 10 , comprising a dedicated hardware determination unit configured to determine whether the divisor is a sum of two integer powers of two, if the divisor is not a sum of two integer powers of two, to initiate dividing the dividend by the divisor by a general divider, and if the divisor is determined to be a sum of two integer powers of two, to initiate dividing the dividend by the divisor, by the divider module.

17. The apparatus according to claim 10 , wherein the divider module is configured to calculate the interim result by calculating a reciprocal of 1+2 p and multiplying the reciprocal by the dividend.

18. The apparatus according to claim 10 , wherein the divider module is configured to calculate the interim result by calculating a sum of terms of a series.

Assignments (3)
RELEASE OF SECURITY INTEREST IN PATENT COLLATERAL AT REEL/FRAME NO. 37900/0720 Recorded Jul 13, 2018
From: JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT
To: MELLANOX TECHNOLOGIES, LTD.
Reel/Frame 046542/0792 →
PATENT SECURITY AGREEMENT Recorded Feb 24, 2016
From: MELLANOX TECHNOLOGIES, LTD.
To: JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT
Reel/Frame 037900/0720 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 31, 2012
From: HIRSHBERG, EITAN
To: MELLANOX TECHNOLOGIES LTD.
Reel/Frame 029214/0434 →