← Back to Patent Explorer
US5375080A Expired / Lapsed US ⏱️ 0.0 years remaining

Performing arithmetic on composite operands to obtain a binary outcome for each multi-bit component

Assignee: Xerox Corp
•
Filing: 1992-12-18
•
Granted: 1994-12-20
•
Expires: 2012-12-18
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Binary outcome operations are performed on composite operands. A composite operand is an operand that includes plural multi-bit component data items. A binary outcome operation obtains, for each component, a flag bit that depends on the numerical value of the component. A binary outcome operation can be performed by performing an arithmetic operation in parallel on a composite operand in which each component includes more than one bit. The arithmetic operation can add a value, producing a carry signal if a component and the added value together exceed a maximum possible value. Or the arithmetic operation can subtract a value, producing a borrow signal if a component is less than the subtracted value. Also, if the arithmetic operation subtracts a value that is equal to the component, the resulting data item includes only zeros; an operation in parallel can then obtain a single flag bit that is a zero only if the resulting data item includes only zeros. The binary outcome operation can compare each component with a value or can determine whether each component is within a range.

Inventors

  • 👤 Daniel Davies

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 09:09
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/50; G06F7/505; G06F7/02; G06F7/026; G06F9/00; G06F9/06; G06F9/30; G06F9/30003; G06F9/30007; G06F9/30021; G06F9/30036; G06F9/30038; G06F2207/00; G06F2207/38; G06F2207/3804; G06F2207/3808; G06F2207/3828; G06F2207/386; G06F7/499; G06F7/49905

Claims Analysis

Total Claims: 29
Claim 1
Independent Claim 196 words
A method of operating a processor; the processor including processing circuitry for performing arithmetic operations; the processing circuitry having four or more processing positions, each for performing operations on one bit; the processing circuitry comprising position connecting circuitry connecting the processing positions to form an array of processing positions; the method comprising: providing to the processing circuitry first and second composite operands; each of the first and second composite operands including two or more component data items, each including more than one bit; each component data item being provided to a respective subarray of processing positions in the array; the component data items of the first and second composite operands being aligned and positioned in subarrays that are separated by flag bit positions so that each subarray has an adjacent flag bit position; operating the processor to perform an arithmetic operation in parallel on the first and second composite operands; the arithmetic operation obtaining, in each subarray, a respective resulting data item that includes more than one bit and, in each flag bit position adjacent a subarray, a flag bit indicating a result of a binary outcome operation on the component data items in the subarray.
Claim 2
Independent Claim 196 words
A method of operating a processor; the processor including processing circuitry for performing arithmetic operations; the processing circuitry having four or more processing positions, each for performing operations on one bit; the processing circuitry comprising position connecting circuitry connecting the processing positions to form an array of processing positions; the method comprising: providing to the processing circuitry first and second composite operands; each of the first and second composite operands including two or more component data items, each including more than one bit; each component data item being provided to a respective subarray of processing positions in the array; the component data items of the first and second composite operands being aligned and positioned in subarrays that are separated by flag bit positions so that each subarray has an adjacent flag bit position; operating the processor to perform an arithmetic operation in parallel on the first and second composite operands; the arithmetic operation obtaining, in each subarray, a respective resulting data item that includes more than one bit and, in each flag bit position adjacent a subarray, a flag bit indicating a result of a binary outcome operation on the component data items in the subarray.
Claim 3
Dependent Claim 24 words
The method of claim 1 in which the binary outcome operation compares each component data item in the first composite operand with a threshold.
Claim 4
Dependent Claim 26 words
The method of claim 1 in which the binary outcome operation determines whether each component data item in the first composite operand is in a range.
Claim 5
Dependent Claim 26 words
The method of claim 1 in which the binary outcome operation compares each component data item in the first composite operand with a value for equality.
Claim 6
Dependent Claim 12 words
The method of claim 1 in which the arithmetic operation is addition.
Claim 7
Dependent Claim 40 words
The method of claim 5 in which each resulting data item includes a most significant bit; the flag bit for each component data item indicating whether a carry occurred from the most significant bit of the respective resulting data item.
Claim 8
Dependent Claim 39 words
The method of claim 5 in which each component data item includes K bits; the binary outcome operation comparing each component data item with a value T; the arithmetic operation adding (2 K -T) to each component data item.
Claim 9
Dependent Claim 12 words
The method of claim 1 in which the arithmetic operation is subtraction.
Claim 10
Dependent Claim 40 words
The method of claim 8 in which each resulting data item includes a most significant bit; the flag bit for each component data item indicating whether a borrow occurred into the most significant bit of the respective resulting data item.
Claim 11
Dependent Claim 37 words
The method of claim 8 in which each component data item includes K bits; the binary outcome operation comparing each component data item with a value T; the arithmetic operation subtracting T from each component data item.
Claim 12
Dependent Claim 24 words
The method of claim 1 in which each component data item in the first composite operand relates to a respective pixel of an image.
Claim 13
Dependent Claim 22 words
The method of claim 11 in which each component data item in the first composite operand is a gray scale pixel value.
Claim 14
Dependent Claim 21 words
The method of claim 11 in which each component data item in the first composite operand is a color pixel value.
Claim 15
Dependent Claim 20 words
The method of claim 1 in which each component data item in the second composite operand has a constant value.
Claim 16
Independent Claim 185 words
A method of operating a processor; the processor including processing circuitry for performing arithmetic operations; the processing circuitry having four or more processing positions, each for performing operations on one bit; the processing circuitry comprising position connecting circuitry connecting the processing positions to form an array of processing positions; the method comprising: providing to the processing circuitry first and second composite operands; each of the first and second composite operands including two or more component data items, each including more than one bit; each component data item being provided to a respective subarray of processing positions in the array; the component data items of the first and second composite operands being aligned and positioned in subarrays; operating the processor to perform an arithmetic operation in parallel on the first and second composite operands; the arithmetic operation obtaining, in each subarray, a respective resulting data item that includes more than one bit; and operating the processor to use the resulting data item in each subarray to obtain a flag bit indicating a result of a binary outcome operation on the component data items in the subarray.
Claim 17
Independent Claim 185 words
A method of operating a processor; the processor including processing circuitry for performing arithmetic operations; the processing circuitry having four or more processing positions, each for performing operations on one bit; the processing circuitry comprising position connecting circuitry connecting the processing positions to form an array of processing positions; the method comprising: providing to the processing circuitry first and second composite operands; each of the first and second composite operands including two or more component data items, each including more than one bit; each component data item being provided to a respective subarray of processing positions in the array; the component data items of the first and second composite operands being aligned and positioned in subarrays; operating the processor to perform an arithmetic operation in parallel on the first and second composite operands; the arithmetic operation obtaining, in each subarray, a respective resulting data item that includes more than one bit; and operating the processor to use the resulting data item in each subarray to obtain a flag bit indicating a result of a binary outcome operation on the component data items in the subarray.
Claim 18
Dependent Claim 20 words
The method of claim 15 in which each component data item in the second composite operand has a constant value.
Claim 19
Dependent Claim 62 words
The method of claim 15 in which the bits of the resulting data item of a component data item all have a first value; the act of operating the processor to use the resulting data item in each subarray to obtain a flag bit comprising: performing a subsampling operation on the resulting data item to obtain one bit having the first value.
Claim 20
Dependent Claim 24 words
The method of claim 15 in which the binary outcome operation compares each component data item in the first composite operand with a threshold.
Claim 21
Dependent Claim 26 words
The method of claim 15 in which the binary outcome operation determines whether each component data item in the first composite operand is in a range.
Claim 22
Dependent Claim 26 words
The method of claim 15 in which the binary outcome operation compares each component data item in the first composite operand with a value for equality.
Claim 23
Dependent Claim 12 words
The method of claim 15 in which the arithmetic operation is addition.
Claim 24
Dependent Claim 39 words
The method of claim 21 in which each component data item includes K bits; the binary outcome operation comparing each component data item with a value T; the arithmetic operation adding (2 K -T) to each component data item.
Claim 25
Dependent Claim 12 words
The method of claim 15 in which the arithmetic operation is subtraction.
Claim 26
Dependent Claim 37 words
The method of claim 23 in which each component data item includes K bits; the binary outcome operation comparing each component data item with a value T; the arithmetic operation subtracting T from each component data item.
Claim 27
Dependent Claim 24 words
The method of claim 15 in which each component data item in the first composite operand relates to a respective pixel of an image.
Claim 28
Dependent Claim 22 words
The method of claim 25 in which each component data item in the first composite operand is a gray scale pixel value.
Claim 29
Dependent Claim 21 words
The method of claim 25 in which each component data item in the first composite operand is a color pixel value.

References Cited (Backward Citations)

US4161784A Cited
US4474882A Cited
US4742552A Cited
US4789957A Cited
US4811266A Cited
US5129092A Cited
US5038313A Cited
EP0431961A2 Cited
EP0460970A2 Cited
US5280547A Cited
EP0464601A2 Cited
EP0486143A2 Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1997-12-19 1998-06-20 1998-12-20 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2001-12-19 2002-06-20 2002-12-20 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2005-12-19 2006-06-20 2006-12-20 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag