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

Binary batch adder utilizing threshold counters

Assignee: International Business Machines Corp
•
Filing: 1969-01-15
•
Granted: 1971-09-07
•
Expires: 1989-01-15
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Disclosed are counters for counting inputs in terms of a fewer number of outputs. The counters are useful in batch adders for simultaneously adding a plurality of multibit numbers. The counters include first and second binary threshold function generators which each receive a different group of inputs. The generators are in parallel with respect to the inputs and each generates a plurality of binary threshold functions. The binary threshold functions are selectively combined in first, second and third threshold combining circuits to form the counter outputs. The combining circuits are placed in parallel and each circuit logically combines one or more threshold function inputs derived from the function generators.

Inventors

  • 👤 Arnold Weinberger

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-27 16:01
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/50; G06F7/505; G06F7/509; G06F7/60; G06F7/607; G06F2207/00; G06F2207/38; G06F2207/48; G06F2207/4802; G06F2207/4818

Claims Analysis

Total Claims: 7
Claim 1
Independent Claim 235 words
A counter for counting a plurality of binary inputs in terms of a fewer number of weighted binary outputs comprising: first and second pluralities of counter input means, each of said inputs being connected to a counter input in only a predetermined one of said first or said second plurality of counter input means; first threshold function generator means consisting of one level of logic circuitry which includes a first group of one or more logic performing circuits and which includes means connectiNg said first plurality of counter inputs to said first group whereby said first group logically combines said first plurality of counter inputs to form a first plurality of binary threshold functions; second threshold function generator means consisting of one level of logic circuitry which includes a second group of one or more logic performing circuits and which includes means connecting said second plurality of counter inputs to said second group whereby said second group logically combines said second plurality of counter inputs to form a second plurality of binary threshold functions; and first, second and third threshold function combining means where each combining means consists of one level of logic circuitry, where each combining means is connected to receive selected different ones of said first and said second plurality of binary threshold functions and whereby said combining means logically combine threshold functions to form first, second and third weighted counter outputs, respectively.
Claim 2
Dependent Claim 235 words
A counter for counting a plurality of binary inputs in terms of a fewer number of weighted binary outputs comprising: first and second pluralities of counter input means, each of said inputs being connected to a counter input in only a predetermined one of said first or said second plurality of counter input means; first threshold function generator means consisting of one level of logic circuitry which includes a first group of one or more logic performing circuits and which includes means connectiNg said first plurality of counter inputs to said first group whereby said first group logically combines said first plurality of counter inputs to form a first plurality of binary threshold functions; second threshold function generator means consisting of one level of logic circuitry which includes a second group of one or more logic performing circuits and which includes means connecting said second plurality of counter inputs to said second group whereby said second group logically combines said second plurality of counter inputs to form a second plurality of binary threshold functions; and first, second and third threshold function combining means where each combining means consists of one level of logic circuitry, where each combining means is connected to receive selected different ones of said first and said second plurality of binary threshold functions and whereby said combining means logically combine threshold functions to form first, second and third weighted counter outputs, respectively.
Claim 3
Dependent Claim 27 words
The apparatus of claim 1 wherein said first group and said second group of logic performing circuits include a plurality of current switches for performing logical functions.
Claim 4
Dependent Claim 31 words
The apparatus of claim 1 wherein said first plurality of the counter inputs numbers three and wherein said second plurality of the counter inputs numbers four thereby forming a 7-to-3 counter.
Claim 5
Dependent Claim 55 words
The apparatus of claim 3 wherein said plurality of binary threshold functions consists of (A,B,C) (0), (A,B,C) (1,2,3), (A, B,C) (0,1), (A,B,C) (0,1,2,), (A,B,C) (3) and (A,B,C) (0,1,3); and wherein said second plurality of binary threshold functions consists of (D,E,F,G) (0), (D,E,F,G) (1,2,3,4), (D,E,F,G) (0, 1), (D,E,F,G) (2,3,4), (D,E,F,G) (0,1,2), (D,E,F,G) (0,1,2,3) and (D,E,F,G) (4).
Claim 6
Dependent Claim 327 words
A batch adder apparatus for simultaneously adding a plurality of numbers wherein each number includes a plurality of bit positions comprising: a plurality of n ordered counters, one for each bit position, wherein each counter is connected to receive a counter input from each number so as to count the inputs in terms of a fewer number of counter outputs and wherein each counter includes, first threshold function generator means consisting of one level of logic circuitry which includes a first group of one or more logic performing circuits and which includes means connecting a first plurality of the counter inputs to said first group hereby said first group logically combines said first plurality of the counter inputs to form a first plurality of binary threshold functions; second threshold function generator means consisting of one level of logic circuitry which includes a second group of one or more logic performing circuits and which includes means connecting a second plurality of the counter inputs to said second group whereby said second group logically combines said second plurality of the counter inputs to form a second plurality of binary threshold functions; first, second and third threshold function combining means where each combining means consists of one level of logic circuitry, where each combining means is connected to receive selected different ones of said first and said second plurality of binary threshold functions and whereby said combining means logically combine threshold functions to form a first, a second and a third counter output; and an adder including a plurality of n ordered stages, one stage for each bit position and each stage corresponding to one of said counters, and including, for each ith counter, means connecting said first counter output to the ith adder stage, means connecting said second counter output to the (i+1)th order stage, and means connecting said third counter output to the (i+2)th order stAge whereby said adder forms the final addition of said plurality of numbers.
Claim 7
Dependent Claim 327 words
A batch adder apparatus for simultaneously adding a plurality of numbers wherein each number includes a plurality of bit positions comprising: a plurality of n ordered counters, one for each bit position, wherein each counter is connected to receive a counter input from each number so as to count the inputs in terms of a fewer number of counter outputs and wherein each counter includes, first threshold function generator means consisting of one level of logic circuitry which includes a first group of one or more logic performing circuits and which includes means connecting a first plurality of the counter inputs to said first group hereby said first group logically combines said first plurality of the counter inputs to form a first plurality of binary threshold functions; second threshold function generator means consisting of one level of logic circuitry which includes a second group of one or more logic performing circuits and which includes means connecting a second plurality of the counter inputs to said second group whereby said second group logically combines said second plurality of the counter inputs to form a second plurality of binary threshold functions; first, second and third threshold function combining means where each combining means consists of one level of logic circuitry, where each combining means is connected to receive selected different ones of said first and said second plurality of binary threshold functions and whereby said combining means logically combine threshold functions to form a first, a second and a third counter output; and an adder including a plurality of n ordered stages, one stage for each bit position and each stage corresponding to one of said counters, and including, for each ith counter, means connecting said first counter output to the ith adder stage, means connecting said second counter output to the (i+1)th order stage, and means connecting said third counter output to the (i+2)th order stAge whereby said adder forms the final addition of said plurality of numbers.

References Cited (Backward Citations)

US2941720A Cited
US3141964A Cited
US3202806A Cited
US3393304A Cited
US3299261A Cited
US3466433A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1974-09-06 1975-03-08 1975-09-07 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1978-09-06 1979-03-08 1979-09-07 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1982-09-06 1983-03-08 1983-09-07 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag