| 发明名称 | Integer divider module | ||
| 摘要 | 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 2n(1+2p). An interim result, which is equal to a reciprocal of 1+2p multiplied by the dividend, is calculated. The interim result is divided by 2n to produce a result of the division operation. | ||
| 申请公布号 | US9032010(B2) | 申请公布日期 | 2015.05.12 |
| 申请号 | US201213664428 | 申请日期 | 2012.10.31 |
| 申请人 | Mellanox Technologies Ltd. | 发明人 | Hirshberg Eitan |
| 分类号 | G06F7/52;G06F7/535 | 主分类号 | G06F7/52 |
| 代理机构 | D. Kligler I.P. Services Ltd. | 代理人 | D. Kligler I.P. Services Ltd. |
| 主权项 | 1. A method of dividing by a divisor having the form 2n(1+2p), 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 2n(1+2p); calculating an interim result that is equal to a reciprocal of 1+2p multiplied by the dividend, and dividing the interim result by 2n, by a dedicated hardware unit, to produce a result of the division operation. | ||
| 地址 | Yokneam IL | ||