Patent US4891782A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4891782A Expired / Lapsed US ⏱️ 0.0 years remaining

Parallel neural network for a full binary adder

Assignee: United States Department of the Army
•
Filing: 1987-12-17
•
Granted: 1990-01-02
•
Expires: 2007-12-17
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method for performing the addition of two N-bit binary numbers using palel neural networks. The value of a first register is converted and transferred into a second register in a mathematical fashion so as to add the numbers of the first register into the second register. When the first register contains all zeros then the desired sum is found in the second register.

Inventors

  • 👤 John L. Johnson

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-01 13:04
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/50; G06F7/505; G06N; G06N3/00; G06N3/02; G06N3/04; G06N3/044; G06N3/0442; G06N3/06; G06N3/063; G06F2207/00; G06F2207/38; G06F2207/48; G06F2207/4802; G06F7/499; G06F7/49905; G06F7/4991

Claims Analysis

Total Claims: 4
Claim 1
Independent Claim 187 words
A method for adding a first binary number to a second binary number wherein said first binary number is contained in a first register and said second binary number is contained in a second register comprising the steps of (A) comparing the same significant bit of each of the bits of said first and second registers and only when said first register has a one value and said second register has a zero value, changing the one value in the first register to a zero value and the zero value in the second register to a one value; (B) comparing the same significant bit of each of the first and second registers and the next higher significant bit of said first register, and only when the next higher significant bit has a value of zero and the other bits have a one value, changing the zero value to a one value and the one values to zero values; and (C) repeating steps A and B until the first register has all zero values whereby the second register contains the digital sum of said first and second registers.
Claim 2
Independent Claim 187 words
A method for adding a first binary number to a second binary number wherein said first binary number is contained in a first register and said second binary number is contained in a second register comprising the steps of (A) comparing the same significant bit of each of the bits of said first and second registers and only when said first register has a one value and said second register has a zero value, changing the one value in the first register to a zero value and the zero value in the second register to a one value; (B) comparing the same significant bit of each of the first and second registers and the next higher significant bit of said first register, and only when the next higher significant bit has a value of zero and the other bits have a one value, changing the zero value to a one value and the one values to zero values; and (C) repeating steps A and B until the first register has all zero values whereby the second register contains the digital sum of said first and second registers.
Claim 3
Dependent Claim 28 words
A method as set forth in claim 1 further comprising the step of performing steps A and B as parallel operations the first time and each repeated time.
Claim 4
Dependent Claim 75 words
A method as set forth in claim 2 wherein said first register further has an overflow bin which is regarded for the purposes of step B as the most significant bit plus one of the first register; and said overflow bin considered as the most significant bit plus one of the second register for determining when the first register has all zeros and for determining the digital sum of said first and second digital numbers.

References Cited (Backward Citations)

US4055754A Cited
US4754421A Cited
US4804250A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1993-01-01 1993-07-03 1994-01-02 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1997-01-01 1997-07-03 1998-01-02 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2001-01-01 2001-07-03 2002-01-02 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag