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

High performance array multiplier using four-to-two composite counters

Assignee: International Business Machines Corp
•
Filing: 1992-07-20
•
Granted: 1994-04-12
•
Expires: 2012-07-20
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An apparatus for the reduction of partial products of a multiplier combines attributes of pre-addition and the regularity found in array multipliers by employing improved four-to-two composite counter cells. This composite counter cell, the basic block for reducing the partial products, is itself comprised of two new four-to-two counters. One of the four-to-two counters is used to perform pre-addition of the partial products while the second counter is used to perform addition between the sum produced by the counter performing the pre-addition and the outputs from the second counter of a cell in a previous stage of the addition. The regularity of array multiplication schemes is preserved and interconnections required by the mechanism span no more than two columns of the matrix.

Inventors

  • 👤 David A. Hrusecky
  • 👤 James E. Phillips
  • 👤 Stamatis Vassiliadis

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 15:40
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/52; G06F7/523; G06F7/533; G06F7/5334; G06F7/5336; G06F7/5338; G06F7/50; G06F7/505; G06F7/509; G06F7/60; G06F7/607

Claims Analysis

Total Claims: 6
Claim 1
Independent Claim 243 words
A computing apparatus, comprising, input means for receiving a multiplier and a multiplicand and for supplying partial product terms of the multipler and multiplicand, a partial product reduction device for effecting partial product reduction of four partial products terms with a composite counter having a first pre-addition partial product addition counter stage and a second transmission partial product addition counter stage, the composite counter comprising two like four-to-two counter stages for pre-addition and for transmission addition, and wherein the like four-to-two counter stages each has five inputs, four of which are partial product terms and the other of which is a carry in, and wherein the first pre-addition partial product addition counter stage is a four-to-two counter having said five inputs, and having three outputs including a sum (S) at a weighted bit position (i), a second carry output (C) at a next adjacent weighted bit position for the more significant bit position (i-1) and a third carry output (C') provided to a next adjacent weighted more significant bit position (i-1); said first pre-addition partial product addition four-to-two counter stage receiving the partial product terms and reducing the partial product terms to two which are coupled to an arithmetic logic unit; said arithmetic logic unit coupled to said partial product reduction device, whereby the reduction of partial products to two is added by said arithmetic logic unit for producing results from a multiplication that can be used for subsequent processing in the apparatus.
Claim 2
Dependent Claim 243 words
A computing apparatus, comprising, input means for receiving a multiplier and a multiplicand and for supplying partial product terms of the multipler and multiplicand, a partial product reduction device for effecting partial product reduction of four partial products terms with a composite counter having a first pre-addition partial product addition counter stage and a second transmission partial product addition counter stage, the composite counter comprising two like four-to-two counter stages for pre-addition and for transmission addition, and wherein the like four-to-two counter stages each has five inputs, four of which are partial product terms and the other of which is a carry in, and wherein the first pre-addition partial product addition counter stage is a four-to-two counter having said five inputs, and having three outputs including a sum (S) at a weighted bit position (i), a second carry output (C) at a next adjacent weighted bit position for the more significant bit position (i-1) and a third carry output (C') provided to a next adjacent weighted more significant bit position (i-1); said first pre-addition partial product addition four-to-two counter stage receiving the partial product terms and reducing the partial product terms to two which are coupled to an arithmetic logic unit; said arithmetic logic unit coupled to said partial product reduction device, whereby the reduction of partial products to two is added by said arithmetic logic unit for producing results from a multiplication that can be used for subsequent processing in the apparatus.
Claim 3
Dependent Claim 45 words
The computing apparatus according to claim 1 wherein the transmission partial product addition counter stage has a four-to-two counter stage having five inputs and three outputs with one output carry coupled as one input of the same four-to-two counter stage to achieve a four-to-two counter.
Claim 4
Dependent Claim 51 words
The computing apparatus according to claim 2 wherein three of the five inputs of the counter of each addition counter stage incurs a longest delay penalty of the counter from input to output while the remaining two inputs incur a smaller delay penalty than that incurred by the previous three inputs.
Claim 5
Dependent Claim 64 words
The computing apparatus according to claim 3 wherein a counter sum output (S) at the weighted bit position i is produced after the longest delay, a second output (C) at the next adjacent weighted bit position i-1 is produced after an intermediate delay, and a third output (C' ) at the next adjacent weighted bit position i-1 is produced after a relatively short delay.
Claim 6
Dependent Claim 65 words
The computing apparatus according to claim 1 wherein the pre-addition counter and the transmission counter stages each have a four-to-two counter which has five inputs which are denominated A*, B*, C*, D*, C' in , and has outputs produced which provide the output defined by the Boolean expressions: S=' D* C'.sub.in C=S'F+D*C'.sub.in C'=A*B*+A*C*+B*C* where S'=A* B* C* F=D* C'.sub.in where represents the exclusive OR function.

References Cited (Backward Citations)

US4228520A Cited
US4752905A Cited
US4769780A Cited
US4926371A Cited
US5101372A Cited
US5072419A Cited

USPTO Annuity & Maintenance Windows

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

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag