# US 2012/0254271 A1 · Arithmetic operation circuit and method of converting binary number

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

- Number: US 2012/0254271 A1
- Document ID: US20120254271A1
- Status: Published application
- Kind: A1
- Application number: 13/410,652
- Filed: 2012-03-02
- Published: 2012-10-04
- Earliest claimed: 2011-03-29
- Assignees: Fujitsu Limited
- Inventors: Kenichi KITAMURA
- Web page: https://patentgrep.com/patent/US20120254271A1

## CPC

- G06F 5/01: for shifting, e.g. justifying, scaling, normalising {(digital stores in which the information is moved stepwise, e.g. shift-registers G11C19/00; digital stores in which the information circulates G11C21/00)}
- G06F 7/50: Adding; Subtracting (G06F7/483 - G06F7/491, G06F7/544 - G06F7/556 take precedence)
- G06F 7/523: Multiplying only
- H03M 7/24: Conversion to or from floating-point codes
- G06F 7/5338: {each bitgroup having two new bits, e.g. 2nd order MBA}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

An arithmetic operation circuit includes: an extractor circuit that extracts one or a plurality of bits consecutive from a most significant bit or from a least significant bit of a binary number; a sum register that stores an X-adic sum, where X is an integer more than two; and an update circuit that updates the stored X-adic sum with a value obtained by adding a first X-adic number to be cyclically multiplied by a certain coefficient to the X-adic sum in accordance with the extracted one or plurality of bits.

## Claims

### Claim 1

An arithmetic operation circuit comprising:
an extractor circuit that extracts one or a plurality of bits consecutive from a most significant bit or from a least significant bit of a binary number;
a sum register that stores an X-adic sum, where X is an integer more than two; and
an update circuit that updates the stored X-adic sum with a value obtained by adding a first X-adic number to be cyclically multiplied by a certain coefficient to the X-adic sum in accordance with the extracted one or plurality of bits.

### Claim 2 (depends on 1)

The arithmetic operation circuit according to claim 1, further comprising,
a selector circuit that selects one of a plurality of second X-adic numbers including the first X-adic number and a specific value in accordance with the extracted one or plurality of bits,
wherein the update circuit updates the X-adic sum by adding the selected first X-adic number or specific value to the stored X-adic sum.

### Claim 3 (depends on 2)

The arithmetic operation circuit according to claim 2, wherein the specific value is zero.

### Claim 4 (depends on 1)

The arithmetic operation circuit according to claim 1, further comprising:
a multiplicand register that stores the first X-adic number; and
a multiple generator circuit that multiplies an output of the multiplicand register by the coefficient and supply the multiplied first X-adic number to the multiplicand register.

### Claim 5 (depends on 1)

The arithmetic operation circuit according to claim 1, wherein the extractor circuit further includes:
a binary number register that stores the binary number;
a shift circuit that shifts the stored binary number; and
a signal line that transfer one or a plurality of bits consecutive from the most significant bit or least significant bit in the binary number register.

### Claim 6 (depends on 1)

The arithmetic operation circuit according to claim 1, wherein an initial value of the first X-adic number is power-of-i, where i is an integer more than one.

### Claim 7 (depends on 2)

The arithmetic operation circuit according to claim 2, wherein the extracted one or plurality of bits is the extracted plurality of bits, and
the selector circuit selects one of the plurality of second X-adic numbers in accordance with the extracted plurality of bits based on a booth algorithm.

### Claim 8 (depends on 7)

The arithmetic operation circuit according to claim 7, wherein a bit width of the extracted plurality of bits is three, and
the plurality of second X-adic include zero, the first X-adic number, double the first X-adic number, the first X-adic number multiplied by (−2) and the first X-adic number multiplied by (−1).

### Claim 9

A method of converting a binary number, the method comprising:
extracting one or a plurality of bits consecutive from a most significant bit or from a least significant bit of a binary number;
adding a first X-adic number to be cyclically multiplied by a certain coefficient to a X-adic sum in accordance with the extracted one or plurality of bits; and
updating the stored X-adic sum with a value obtained by the adding.

### Claim 10 (depends on 9)

The method according to claim 9, further comprising:
selecting one of a plurality of second X-adic numbers including the first X-adic number and a specific value by a selector circuit in accordance with the extracted one or plurality of bits; and
adding the selected first X-adic number or specific value to the stored X-adic sum so as to update the X-adic sum.

### Claim 11 (depends on 10)

The method according to claim 10, wherein the specific value is zero.

### Claim 12 (depends on 9)

The method according to claim 9,
wherein an initial value of the first X-adic number is power-of-i, where i is an integer more than one.

### Claim 13 (depends on 10)

The method according to claim 10,
wherein the extracted one or plurality of bits is the extracted plurality of bits, and
the selector circuit selects one of the plurality of second X-adic numbers in accordance with the extracted plurality of bits based on a booth algorithm at the selecting.
