专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US06578062B1 Method and circuit for digital division 有权
标题翻译：数字分割方法与电路
公开(公告)号：US06578062B1
公开(公告)日：2003-06-10
申请号：US09418168
申请日：1999-10-13
申请人： Cliff Gold , John Lee
发明人： Cliff Gold , John Lee
IPC分类号： G06F752
CPC分类号： G06F7/535
摘要： A method and apparatus for calculating a quotient from a dividend and a divisor, wherein the divisor can be represented as (2N+2M) where N is greater than M, and wherein the dividend comprises an X-bit binary number divisible by the divisor without a remainder. The values of N and M for the dividend are determined such that the divisor is equal to the value (2N+2M). The M-th through the (N−1)-th bits of the dividend are selected as lower order bits of the quotient. The (N−1)-th and the (2N−M−1)-th bits of the dividend are examined. If the (N−1)-th bit of the dividend is “1” and if the (2N−M−1)-th bit of the dividend is “0”, then one is subtracted from a value represented by the (2N−M)-th through the (X−1)-th bits of the dividend to obtain a result as higher order bits of the quotient. Otherwise, the (2N−M)-th through the (X−1)-th bits of the dividend are selected as higher order bits of the quotient. Finally, the higher order bits and the lower order bits are concatenated to obtain the quotient.
摘要翻译：一种用于从除数和除数计算商的方法和装置，其中除数可以表示为（2N + 2M）其中N大于M，并且其中除数包括除数除以除数除数的X位二进制数，剩下的确定用于分红的N和M的值，使得除数等于值（2N + 2M）。被除数的第M到第（N-1）位被选为商的低阶位。检查分红的第（N-1）和（2N-M-1）位。如果被除数的第（N-1）位为“1”，并且如果被除数的第（2N-M-1）位为“0”，则从由（2N -M）通过被除数的（X-1）位来获得作为商的较高阶位的结果。否则，选择被除数的（2N-M）到第（X-1）个比特作为商的高阶比特。最后，将高阶位和低阶位相连以获得商。

IPRDB

热门服务

关于我们

友情链接

联系方式