# US 2008/0307032 A1 · Divider Circuit

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2008/0307032 A1
- Document ID: US20080307032A1
- Status: Published application
- Kind: A1
- Application number: 12/136,542
- Filed: 2008-06-10
- Published: 2008-12-11
- Earliest claimed: 2007-06-11
- Assignees: Sanyo Electric Co., Ltd.; Sanyo Semiconductor Co., Ltd.
- Inventors: Iwao Honda
- Web page: https://patentgrep.com/patent/US20080307032A1

## CPC

- G06F 7/537: Reduction of the number of iteration steps or stages, e.g. using the Sweeny-Robertson-Tocher [SRT] algorithm
- G06F 2207/5353: Restoring division
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A divider circuit for dividing a dividend by a divisor, includes: a multiplicative divisor generating circuit configured to generate 2m-2 multiplicative divisors that are 2 to 2m-1 times the divisor, the m indicating an integer of 2 or more; and a quotient generating circuit configured to sequentially generate a quotient of the dividend, by m bits in decreasing order of significance, by subtracting from the dividend the divisor and the 2m-2 multiplicative divisors, respectively.

## Claims

### Claim 1

A divider circuit for dividing a dividend by a divisor, comprising:
a multiplicative divisor generating circuit configured to generate 2m-2 multiplicative divisors that are 2 to 2m-1 times the divisor, the m indicating an integer of 2 or more; and
a quotient generating circuit configured to sequentially generate a quotient of the dividend, by m bits in decreasing order of significance, by subtracting from the dividend the divisor and the 2m-2 multiplicative divisors, respectively.

### Claim 2 (depends on 1)

The divider circuit according to claim 1, wherein
the divisor and the multiplicative divisor are of n bits, the n indicating an integer of 2 or more, and
the quotient generating circuit includes:
a subtracting circuit configured to output 2m-1 subtraction results obtained by subtracting respectively the divisor and the 2m-2 multiplicative divisors as subtrahends from a higher order n-bit dividend of the dividend as a minuend;
a partial-quotient generating circuit configured to generate an m-bit partial quotient that is a part of the quotient of the dividend, based on the 2m-1 subtraction results; and
a minuend updating circuit configured to update the minuend in the subtracting circuit to generate a subsequent m-bit partial quotient of the dividend, based on the dividend and the 2m-1 subtraction results.

### Claim 3 (depends on 2)

The divider circuit according to claim 2, wherein
the partial-quotient generating circuit includes a partial-quotient selecting circuit configured
to output an m-bit zero as the partial quotient, when all the subtraction results are negative, and
to output an m-bit number as the partial quotient, the m-bit number indicating a factor by which the divisor is multiplied to be a maximum of the divisor and the multiplicative divisor with the subtraction result that is positive, when any positive subtraction result is included in the subtraction results.

### Claim 4 (depends on 2)

The divider circuit according to claim 2, wherein the minuend updating circuit includes:
a subtraction result selecting circuit configured
to output the minuend when all the subtraction results are negative and
to output a positive minimum subtraction result out of the subtraction results when any positive subtraction result is included in the subtraction results; and
a minuend generating circuit configured to output an n-bit number as the minuend, the n-bit number being obtained by adding an m-bit subsequent to n-bit dividend of the dividend to a lower (n-m)-bit minuend of the minuend with n bits or a lower (n-m)-bit positive minimum subtraction result of the positive minimum subtraction result with n bits, output from the subtraction result selecting circuit.

### Claim 5 (depends on 3)

The divider circuit according to claim 3, wherein
the minuend updating circuit includes:
a subtraction result selecting circuit configured
to output the minuend when all the subtraction results are negative and
to output a positive minimum subtraction result out of the subtraction results when any positive subtraction result is included in the subtraction results; and
a minuend generating circuit configured to output an n-bit number as the minuend, the n-bit number being obtained by adding an m-bit subsequent to n-bit dividend of the dividend to a lower (n-m)-bit minuend of the minuend with n bits or a lower (n-m)-bit positive minimum subtraction result of the positive minimum subtraction result with n bits, output from the subtraction result selecting circuit.
