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

Threshold logic three-input adder

Assignee: AT&T Inc
•
Filing: 1972-04-04
•
Granted: 1973-10-30
•
Expires: 1992-04-04
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The invention is a threshold logic three-input adder circuit comprising a combination of storage-processor elements. These elements are each arranged to decide which one of a pair of double-rail input signals has a higher potential and to store the result of that decision. Information stored in each element directs a unit of current through one or the other of two busses for summation and determination of the potentials of the busses. Current steering circuits responsive to the potential on a first one of the busses steer four, two, or no units of current through a second one of the busses. Carry and sum elements compare the potentials of the first and second busses with predetermined reference potentials to determine whether to store ''''ls'''' or ''''Os'''' resulting from the summation of the input signals.

Inventors

  • 👤 J Heightley

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-08 13:55
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/50; G06F7/504; G06F7/5045; G06F2207/00; G06F2207/38; G06F2207/48; G06F2207/4802; G06F2207/4818

Claims Analysis

Total Claims: 14
Claim 1
Independent Claim 85 words
A threshold logic adder circuit comprising first and second busses; means for converting each of five information bits into a unit of current conducted alternatively through the first or the second bus; means responsive to current in the first and second busses for producing potentials thereon; means responsive to the potential on the first bus for steering selectively four units, two units, or no units of current through the second bus; and means for comparing the potential on the second bus with a reference potential.
Claim 2
Dependent Claim 85 words
A threshold logic adder circuit comprising first and second busses; means for converting each of five information bits into a unit of current conducted alternatively through the first or the second bus; means responsive to current in the first and second busses for producing potentials thereon; means responsive to the potential on the first bus for steering selectively four units, two units, or no units of current through the second bus; and means for comparing the potential on the second bus with a reference potential.
Claim 3
Dependent Claim 56 words
An adder circuit in accordance with claim 1 wherein the comparing means includes a bistable circuit being constrained to a first stable state when at least five units of current are conducted in the second bus and being constrained to a second state when less than five units of current are conducted in the second bus.
Claim 4
Dependent Claim 76 words
An adder circuit in accordance with claim 2 wherein the means selectively steering current includes first and second current steering circuits; the first steering circuit steers two units of current through the second bus only when at least four units of current are conducted in the first bus; and the second steering circuit steers two units of current through the second bus only when at least two units of current are conducted in the first bus.
Claim 5
Dependent Claim 55 words
An adder circuit in accordance with claim 3 wherein the converting means include five separate storage-processor elements having complementary outputs connected respectively to the first and second busses; and the comparing means comprises a further storage-processor element having a first input connected to the second bus and a reference potential applied to a second input.
Claim 6
Dependent Claim 30 words
An adder circuit in accordance with claim 1 wherein control means apply a pair of complementary drive signals to all of the storage-processor elements for synchronizing operation of the elements.
Claim 7
Dependent Claim 204 words
A threshold logic adder comprising carry and sum busses; storage-processor means for storing three addend-word bits and two carry-bits and for selectively directing five units of current through the carry bus or through the sum bus depending upon the values of the addendword bits and the carry-bits; means responsive to current conducted in the carry and sum busses for producing potentials thereon; a first steering circuit responsive to the potential on the carry bus and to a reference potential for steering two units of current through the sum bus only when at least four units of current are conducted in the carry bus; a second steering circuit responsive to the potential on the carry bus and to another reference potential for steering two units of current through the sum bus only when at least two units of current are conducted in the carry bus; and a sum storage-processor element responsive to the potential on the sum bus and to a predetermined reference potential is constrained to a first stable state when at least five units of current are conducted in the sum bus and is constrained to a second stable state when less than five units of current are conducted in the sum bus.
Claim 8
Dependent Claim 204 words
A threshold logic adder comprising carry and sum busses; storage-processor means for storing three addend-word bits and two carry-bits and for selectively directing five units of current through the carry bus or through the sum bus depending upon the values of the addendword bits and the carry-bits; means responsive to current conducted in the carry and sum busses for producing potentials thereon; a first steering circuit responsive to the potential on the carry bus and to a reference potential for steering two units of current through the sum bus only when at least four units of current are conducted in the carry bus; a second steering circuit responsive to the potential on the carry bus and to another reference potential for steering two units of current through the sum bus only when at least two units of current are conducted in the carry bus; and a sum storage-processor element responsive to the potential on the sum bus and to a predetermined reference potential is constrained to a first stable state when at least five units of current are conducted in the sum bus and is constrained to a second stable state when less than five units of current are conducted in the sum bus.
Claim 9
Dependent Claim 139 words
An adder in accordance with claim 6 wherein a first storage-processor element for storing one of the two carry-bits responds to the potential on the carry bus and to a reference potential, is constrained to a first stable state when at least four units of current are conducted in the carry bus, and is constrained to a second stable state when less than four units of current are conducted in the carry bus; and a second storage-processor element for storing one of the two carry-bits responds to the potential on the carry bus and to a reference potential, is constrained to a first stable state when at least two units of current are conducted in the carry bus, and is constrained to a second stable state when less than two units of current are conducted in the carry bus.
Claim 10
Dependent Claim 27 words
An adder in accorDance with claim 7 wherein control means apply a pair of complementary drive signals to all of the storage-processor means for synchronizing their operation.
Claim 11
Independent Claim 172 words
The method of forming the sum of bits of three input-words by the threshold logic steps of a. writing a bit of each word in separate storage-processor elements; b. concurrently writing one or two carry-bits in additional separate storage-processor elements; c. directing a unit of current through each of the storage-processor elements alternatively to carry and sum busses; d. determining a selected potential on the carry bus in response to the number of units of current conducted therethrough; e. steering selectively four, two, or no units of additional current through the sum bus in response to the potential on the carry bus; f. determining a selected potential on the sum bus in response to the number of units of current conducted therethrough; g. comparing the potentials on the carry and sum busses with predetermined reference potentials; and h. constraining carry and sum storage-processor elements to one or the other of two stable states in response to the comparison of the potentials on the carry and sum busses with the predetermined reference potentials.
Claim 12
Independent Claim 172 words
The method of forming the sum of bits of three input-words by the threshold logic steps of a. writing a bit of each word in separate storage-processor elements; b. concurrently writing one or two carry-bits in additional separate storage-processor elements; c. directing a unit of current through each of the storage-processor elements alternatively to carry and sum busses; d. determining a selected potential on the carry bus in response to the number of units of current conducted therethrough; e. steering selectively four, two, or no units of additional current through the sum bus in response to the potential on the carry bus; f. determining a selected potential on the sum bus in response to the number of units of current conducted therethrough; g. comparing the potentials on the carry and sum busses with predetermined reference potentials; and h. constraining carry and sum storage-processor elements to one or the other of two stable states in response to the comparison of the potentials on the carry and sum busses with the predetermined reference potentials.
Claim 13
Dependent Claim 174 words
An m input, where m is greater than 2, threshold logic adder comprising carry and sum busses; means for storing m input-bits, each from a corresponding order of m addend-words; means for storing m-1 carry-bits, each generated by a summation of bits of a next lower order of significance in the addend-words; the 2m-1 storing means being arranged for directing units of current through the carry and sum busses alternatively, depending upon the value of the bits stored; means for writing m-1 new carry-bits in the carry-bit storing means, each new carry-bit being related to a different number of units of current conducted through the carry bus; means responsive to the number of units of current conducted through the carry bus for selectively steering a different number of units of current through the sum bus for every new carry-bit to be written; and means for storing a sum-bit simultaneously with the storing of the m-1 new carry-bits, the sum-bit being related to a predetermined number of units of current conducted through the sum bus.
Claim 14
Dependent Claim 174 words
An m input, where m is greater than 2, threshold logic adder comprising carry and sum busses; means for storing m input-bits, each from a corresponding order of m addend-words; means for storing m-1 carry-bits, each generated by a summation of bits of a next lower order of significance in the addend-words; the 2m-1 storing means being arranged for directing units of current through the carry and sum busses alternatively, depending upon the value of the bits stored; means for writing m-1 new carry-bits in the carry-bit storing means, each new carry-bit being related to a different number of units of current conducted through the carry bus; means responsive to the number of units of current conducted through the carry bus for selectively steering a different number of units of current through the sum bus for every new carry-bit to be written; and means for storing a sum-bit simultaneously with the storing of the m-1 new carry-bits, the sum-bit being related to a predetermined number of units of current conducted through the sum bus.

References Cited (Backward Citations)

US3248529A Cited
US3586845A Cited
US3628000A Cited
US3609329A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1976-10-29 1977-04-30 1977-10-30 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1980-10-29 1981-04-30 1981-10-30 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1984-10-29 1985-04-30 1985-10-30 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag