# US 2006/0066460 A1 · Arithmetic unit

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

- Number: US 2006/0066460 A1
- Document ID: US20060066460A1
- Status: Published application
- Kind: A1
- Application number: 11/231,804
- Filed: 2005-09-22
- Published: 2006-03-30
- Earliest claimed: 2004-09-28
- Assignees: Renesas Technology Corp.
- Inventors: Hiroaki Suzuki
- Web page: https://patentgrep.com/patent/US20060066460A1

## CPC

- G06F 7/49921: {Saturation, i.e. clipping the result to a minimum or maximum value}
- G06F 7/02: Comparing digital values (G06F7/06, {G06F7/22,} G06F7/38 take precedence)
- G06F 9/3001: {Arithmetic instructions}
- G06F 9/342: {Extension of operand address space}
- G06F 7/507: using selection between two conditionally calculated carry or sum values
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

The present invention provides an arithmetic unit performing a saturation process that can reduce a delay time relating to an arithmetic process and a saturation process, thereby being capable of increasing a processing speed. An arithmetic unit according to the present invention includes an arithmetic processing section that performs an adding or subtracting operation of a first input operand and a second input operand and outputs the arithmetic result, a saturation anticipating section that anticipates whether the arithmetic result is within a representation range of a predetermined bit length based upon the first input operand and the second input operand, and outputs a saturation anticipating signal, and a selecting section selecting that the maximum value or minimum value within the representation range of the predetermined bit length is made to be the output result in case where the arithmetic result is anticipated not to be within the representation range of the predetermined bit length in the saturation anticipating signal from the saturation anticipating section, while selecting that the arithmetic result is made to be the output result in case where the arithmetic result is anticipated to be within the representation range of the predetermined bit length in the saturation anticipating signal. Herein, the saturation anticipating section is operated in parallel with respect to the arithmetic processing section.

## Claims

### Claim 1

An arithmetic unit comprising:
an arithmetic processing section that performs an adding or subtracting operation of a first input operand and a second input operand and outputs the arithmetic result;
a saturation anticipating section that anticipates whether said arithmetic result is within a representation range of a predetermined bit length based upon said first input operand and said second input operand, and outputs a saturation anticipating signal; and
a selecting section that selects that the maximum value or minimum value within the representation range of the predetermined bit length is made to be the output result in case where said arithmetic result is anticipated not to be within the representation range of the predetermined bit length in said saturation anticipating signal from said saturation anticipating section, and selects that said arithmetic result is made to be said output result in case where said arithmetic result is anticipated to be within the representation range of the predetermined bit length in said saturation anticipating signal, wherein
said saturation anticipating section is operated in parallel with respect to said arithmetic processing section.

### Claim 2 (depends on 1)

The arithmetic unit according to claim 1, wherein said saturation anticipating section generates a saturation anticipating bit string that anticipates an individual bit state of said arithmetic result positioned at the outside of the representation range of the predetermined bit length based upon said first input operand and said second input operand, to thereby obtain said saturation anticipating signal that is an AND of the saturation anticipating bit string.

### Claim 3 (depends on 2)

The arithmetic unit according to claim 2, wherein
said saturation anticipating bit string has a Zero anticipating bit string anticipating that the individual bit state of said arithmetic result positioned at the outside of the representation range of the predetermined bit length is “0” and a One anticipating bit string anticipating that the individual bit state of said arithmetic result positioned at the outside of the representation range of the predetermined bit length is “1”, and
said saturation anticipating section obtains said saturation anticipating signal by operating the OR of the AND of said Zero anticipating bit string and the AND of said One anticipating bit string.

### Claim 4 (depends on 3)

The arithmetic unit according to claim 3, wherein
said Zero anticipating bit string and said One anticipating bit string use said arithmetic result for each least significant bit.

### Claim 5 (depends on 3)

The arithmetic unit according to claim 3, wherein
said saturation anticipating section has:
a first algorithm for obtaining said Zero anticipating bit string by operating the exclusive-OR of a Propagate signal, that is the exclusive-OR of said first input operand and said second input operand, and a Kill signal, that is 1-bit lower from said Propagate signal and is obtained by inverting the OR of said first input operand and said second input operand; and
a second algorithm for obtaining said One anticipating bit string by operating the exclusive-OR of said Propagate signal and a Generate signal, that is 1-bit lower from said Propagate signal and said AND of the first input operand and said second input operand.

### Claim 6 (depends on 5)

The arithmetic unit according to claim 5, capable of selecting the representation range of the first bit length and the representation range of a second bit length that is narrower than that of said first bit length, wherein
said saturation anticipating section includes:
a Zero anticipating bit processing section that performs said first algorithm process to bits of said first input operand and said second input operand except for the least significant bit outside the representation range of said second bit length, thereby outputting said Zero anticipating bit string;
a One anticipating bit processing section that performs said second algorithm process to bits of said first input operand and said second input operand except for the least significant bit outside the representation range of said second bit length, thereby outputting said Zero anticipating bit string;
a first logical operation section that operates the AND of bits of the output from said Zero anticipating bit processing section except for the least significant bit outside the representation range of said first bit length;
a second logical operation section that operates the AND with respect to the output from said Zero anticipating bit processing section except for the bit operated at said first logical operation section;
a third logical operation section that operates the AND of bits of the output from said One anticipating bit processing section except for the least significant bit outside the representation range of said first bit length;
a fourth logical operation section that operates the AND with respect to the output from said One anticipating bit processing section except for the bit operated at said third logical operation section;
a first least significant bit operation section that operates the NAND of the output from the first logical operation section and said arithmetic result corresponding to the least significant bit outside the representation range of said first bit length;
a second least significant bit operation section that operates the NAND of the output from the first logical operation section, the output from the second logical operation section and said arithmetic result corresponding to the least significant bit outside the representation range of said second bit length;
a third least significant bit operation section that operates the NAND of the output from the third logical operation section and the bit obtained by inverting said arithmetic result corresponding to the least significant bit outside the representation range of said first bit length;
a fourth least significant bit operation section that operates the NAND of the output from the third logical operation section, the output from the fourth logical operation section and the bit obtained by inverting said arithmetic result corresponding to the least significant bit outside the representation range of said second bit length;
a first saturation anticipating bit operation section that obtains the OR of the first least significant bit operation section and the third least significant bit operation section as a first saturation anticipating bit with respect to the representation range of said first bit length;
a second saturation anticipating bit operation section that obtains the OR of the second least significant bit operation section and the fourth least significant bit operation section as a second saturation anticipating bit with respect to the representation range of said second bit length;
a first enable signal operation section that operates the AND of said first saturation anticipating bit and a first enable signal indicating whether the representation range of said first bit length is selected or not;
a second enable signal operation section that operates the AND of said second saturation anticipating bit and a second enable signal indicating whether the representation range of said second bit length is selected or not; and
a first saturation anticipating signal outputting section that operates the OR of the output from said first enable signal operation section and the output from said second enable signal operation section, to thereby output said saturation anticipating signal.

### Claim 7 (depends on 6)

The arithmetic unit according to claim 6, wherein
said saturation anticipating section includes, instead of said first to fourth least significant bit operation sections, first and second saturation anticipating bit operation sections, first and second enable signal operation sections and first saturation anticipating signal outputting section:
a first inverter that inverts the output from said first logical operation section;
a first NAND operation section that operates the NAND of the output from said first logical operation section and the output from said second logical operation section;
a second inverter that inverts the output from said third logical operation section;
a second NAND operation section that operates the NAND of the output from said third logical operation section and the output from said fourth logical operation section;
a first operation section that operates the AND of said first enable signal, the output from said first inverter and said arithmetic result corresponding to the least significant bit outside the representation range of said first bit length;
a second operation section that operates the AND of said second enable signal, the output from said first NAND operation section and said arithmetic result corresponding to the least significant bit outside the representation range of said second bit length;
a third operation section that operates the AND of the output from said enable signal outputting section, the output from said second inverter and the bit obtained by inverting said arithmetic result corresponding to the least significant bit outside the representation range of said first bit length;
a fourth operation section that operates the AND of said second enable signal, the output from said second NAND operation section and the bit obtained by inverting said arithmetic result corresponding to the least significant bit outside the representation range of said second bit length; and
a second saturation anticipating signal outputting section that operates the OR of the outputs from said first to fourth operation sections, to thereby output said saturation anticipating signal.

### Claim 8 (depends on 7)

The arithmetic unit according to claim 7, wherein
said saturation anticipating section includes, instead of said first to fourth operation sections and said second saturation anticipating signal outputting section:
a fifth operation section that operates the AND of said first enable signal and the output from said first inverter;
a sixth operation section that operates the AND of said second enable signal and the output from said first NAND operation section;
a seventh operation section that operates the AND of said first enable signal and the output from said second inverter;
an eighth operation section that operates the AND of said second enable signal and the output from said second NAND operation section;
a first multiplexer section that processes the output from said fifth operation section, the output from said seventh operation section and said arithmetic result corresponding to the least significant bit outside the representation range of said first bit length;
a second multiplexer section that processes the output from said sixth operation section, the output from said eighth operation section and said arithmetic result corresponding to the least significant bit outside the representation range of said second bit length; and
a third saturation anticipating signal outputting section that operates the OR of the output from said first multiplexer and the output from said second multiplexer, thereby outputting said saturation anticipating signal.

### Claim 9 (depends on 6)

The arithmetic unit according to claim 6, wherein
said Zero anticipating bit processing section includes:
a first operand operation section that operates the exclusive-OR of said first input operand and said second input operand;
a second operand operation section that operates the NOR of said first input operand and said second input operand that are one bit lower from said first input operand and said second input operand inputted to said first input operand operation section; and
a third operand operation section that operates the exclusive-OR of the output from said first operand operation section and the output from said second operand section, and
said One anticipation bit processing section includes:
a fourth operand operation section that operates the exclusive-OR of said first input operand and said second input operand;
a fifth operand operation section that operates the NOR of said first input operand and said second input operand that are one bit lower from said first input operand and said second input operand inputted to said first input operand operation section; and
a sixth operand operation section that operates the exclusive-OR of the output from said fourth operand section and the output from said fifth operand operation section.

### Claim 10 (depends on 6)

The arithmetic unit according to claim 6, wherein
said Zero anticipating processing section includes:
seventh and eighth operand operation sections that operate the AND of said inverted first input operand and said second input operand;
a ninth operand operation section that operates the OR of the inverted output from said seventh operand operation section and the output from said eighth operand operation section; and
a tenth operand operation section that operates the exclusive-OR of the output from said ninth operand operation section and the output from said seventh operand operation section that corresponds to one bit lower, and
said One anticipating bit processing section includes:
an eleventh operand operation section that operates the NAND of said first input operand and said second input operand;
a twelfth operand operation section that operates the AND of said first input operand and said second input operand;
a thirteenth operand operation section that operates the NOR of the output from the eleventh operand operation section and the output from the twelfth operand operation section; and
a fourteenth operand operation section that operates the exclusive-NOR of the output from said thirteenth operand operation section and the output from said eleventh operand operation section that corresponds to one bit lower.

### Claim 11 (depends on 9)

The arithmetic unit according to claim 9, wherein
said Zero anticipating bit processing section is not provided with said first and second operand operation sections, and inputs the Propagate signal operated at said arithmetic processing section and the Kill signal that is one bit lower from said Propagate signal and operated at said arithmetic processing section to said third operand operation section, instead of the outputs from said first and the second operand operation sections, and
said One anticipating bit processing section is not provided with said fourth and fifth operand operation sections, and inputs the Propagate signal operated at said arithmetic processing section and the Generate signal that is one bit lower from said Propagate signal and operated at said arithmetic processing section to said sixth operand operation section, instead of the outputs from said fourth and the fifth operand operation sections.

### Claim 12

An arithmetic unit used for an address modification section of a memory, comprising:
an address calculating section that operates a memory address based upon a base value and address value that have been subject to a predetermined process and first carry information; and
a hit determining section that determines whether the target address that performs an access and said memory address agree with each other or not based upon second carry information operated from a predetermined low-order bit of said base value and said address value and said first carry information and a predetermined high-order bit of said base value and said address value, and outputs the determination result as a Hit signal, wherein
said hit determining section is operated in parallel with respect to said address calculating section.

### Claim 13 (depends on 12)

The arithmetic unit according to claim 12, wherein
said hit determining section obtains a One anticipating bit string, that decides the state of said Hit signal depending upon whether all of the individual bit states are “1” or not, by operating said second carry information, the predetermined high-order bit of said base value and said address value and said target address.

### Claim 14 (depends on 13)

The arithmetic unit according to claim 13, wherein
said address calculating section supplies to said hit determining section the arithmetic result obtained by operating the predetermined low-order bit of said base value and said address value and said first carry information as said second carry information.

### Claim 15 (depends on 14)

The arithmetic unit according to claim 14, wherein
said hit determining section obtains beforehand by the operation said One anticipating bit string wherein said second carry information is supposed to be “0” and said One anticipating bit string wherein said second carry information is supposed to be “1”, and selects either one of said One anticipating bit string at the point when said second carry information is supplied from said address calculating section, thereby outputting said Hit signal.

### Claim 16 (depends on 14)

The arithmetic unit according to claim 14, wherein
said hit determining section further obtains the Zero anticipating bit string that decides the state of said Hit signal depending upon whether all of the individual bit states are “0” by operating said second carry information, the predetermined high-order bit of said base value and said address value and said target address, and selects either one of said One anticipating bit string and said Zero anticipating bit string at the point when said second carry information is supplied from said address calculating section, thereby outputting said Hit signal.

### Claim 17 (depends on 12)

The arithmetic unit according to claim 12, which is used for a TLB of a virtual memory system.

### Claim 18 (depends on 12)

The arithmetic unit according to claim 12, which is used for a Fully Associative cache.
