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

Weighted-delay column adder and method of organizing same

Assignee: LSI Corp
•
Filing: 1990-02-14
•
Granted: 1992-11-03
•
Expires: 2010-02-14
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An adder array for adding two or more input addends, whose bit lengths are not necessarily matched, and a method of configuring the adder array are disclosed. The addends are organized according to bit weight, and bits of equal weight are added in adder columns. Carry-outs are introduced into subsequent, higher weight adder columns according to delay. Thereby, the delay associated with the addition of the addends is minimized. Method and apparatus is disclosed.

Inventors

  • 👤 Yen C. Chang
  • 👤 Jeffrey A. Werner

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 21:09
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/52; G06F7/523; G06F7/53; G06F7/5318; G06F7/50; G06F7/505; G06F7/509

Claims Analysis

Total Claims: 19
Claim 1
Independent Claim 138 words
A method of adding two or more binary numbers, comprising: organizing binary numbers into columns of input bits according to the binary-weight of the individual input bits; arranging a plurality of adders in chains, each adder chain having a binary significance associated therewith and representing a column for adding input bits of a particular binary-weight; determining propagation delays for each adder output intermediate sum in each adder chain; applying the input bits to the adder chains for addition to adders in the chain which have the shortest possible propagation delays associated therewith; and applying carry-outs from an adder chain of a given binary significance "n" as carry-ins to an adder in the next more significant "n+1" adder chain which is adding intermediate sums of n+1 weight having propagation delays most nearly matching the propagation delay of the carry-ins.
Claim 2
Independent Claim 138 words
A method of adding two or more binary numbers, comprising: organizing binary numbers into columns of input bits according to the binary-weight of the individual input bits; arranging a plurality of adders in chains, each adder chain having a binary significance associated therewith and representing a column for adding input bits of a particular binary-weight; determining propagation delays for each adder output intermediate sum in each adder chain; applying the input bits to the adder chains for addition to adders in the chain which have the shortest possible propagation delays associated therewith; and applying carry-outs from an adder chain of a given binary significance "n" as carry-ins to an adder in the next more significant "n+1" adder chain which is adding intermediate sums of n+1 weight having propagation delays most nearly matching the propagation delay of the carry-ins.
Claim 3
Dependent Claim 29 words
A method as described in claim 1, wherein: one or more of the adder chains produces two partial results for the binary addition of the bits at that binary-weight.
Claim 4
Dependent Claim 52 words
A method as described in claim 1, further comprising: combining the partial results of the least significant column having two column results, including any carry-out from the previous column, and the column result(s) of the more significant columns in a fast adder stage to provide a final result of the binary addition.
Claim 5
Dependent Claim 47 words
A method as described in claim 1, wherein: one or more of the adder chains produces only one partial result; and further comprising: applying the carry-out with the longest delay from the previous column to the end of the present adder chain as a second partial result.
Claim 6
Dependent Claim 52 words
A method as described in claim 4, further comprising: combining the partial results of the least significant column having two column results, including any carry-out from the previous column, and the column result(s) of the more significant columns in a fast adder stage to provide a final result of the binary addition.
Claim 7
Independent Claim 28 words
A method of adding binary numbers, comprising: organizing the component bits of the binary numbers according to binary-weight. adding together the component bits of a given binary weight;
Claim 8
Independent Claim 28 words
A method of adding binary numbers, comprising: organizing the component bits of the binary numbers according to binary-weight. adding together the component bits of a given binary weight;
Claim 9
Independent Claim 67 words
A method of adding binary numbers comprising: organizing the binary numbers according to bit weight; adding bits of equal weight to provide one-bit intermediate results, a one-bit result and one-bit carry-outs, each of said intermediate results having an associated delay and each of said carry-outs having an associated delay; and introducing the carry-outs into the addition of higher weight bits together with intermediate results of comparable delay.
Claim 10
Independent Claim 67 words
A method of adding binary numbers comprising: organizing the binary numbers according to bit weight; adding bits of equal weight to provide one-bit intermediate results, a one-bit result and one-bit carry-outs, each of said intermediate results having an associated delay and each of said carry-outs having an associated delay; and introducing the carry-outs into the addition of higher weight bits together with intermediate results of comparable delay.
Claim 11
Independent Claim 121 words
A method of adding two or more binary numbers, comprising: organizing said binary numbers into columns of input bits according to their weight and applying them to column arrays of adders such that the binary inputs which have the shortest associated delays are applied at the top of the column array of adders; and applying carries from the previous columns of adders to the current column array such that the delays associated with the carries are as closely matched as possible to the delays associated with the signals in the current column at the point of their introduction, where longer delays are applied nearer to the bottom of the current column and shorter delays nearer the top of the current column.
Claim 12
Independent Claim 121 words
A method of adding two or more binary numbers, comprising: organizing said binary numbers into columns of input bits according to their weight and applying them to column arrays of adders such that the binary inputs which have the shortest associated delays are applied at the top of the column array of adders; and applying carries from the previous columns of adders to the current column array such that the delays associated with the carries are as closely matched as possible to the delays associated with the signals in the current column at the point of their introduction, where longer delays are applied nearer to the bottom of the current column and shorter delays nearer the top of the current column.
Claim 13
Dependent Claim 33 words
A method as described in claim 8, wherein: at least one of the columns produces more than one result; and further comprising: providing a final parallel adder stage to combine the final results.
Claim 14
Dependent Claim 363 words
A weighted-delay column adder for adding binary numbers, comprising: an array of adders interconnected in chains in a plurality of columns, each column corresponding to the significance of the bits of binary numbers being added and receiving those bits; a first, least significant column of the array of adders organized such that the least significant column of bits from the binary inputs are applied to the adder chains at points having the most nearly matched delay associated therewith, and organized such that the overall delay associated with the column is minimized, with the first column producing a carry-out from each of its component adders which is passed on to the next more significant column, and also producing a final column result which is taken as the least significant bit of the total addition; successive higher columns of the array of adders, each processing the next higher significant column of bits from the binary inputs and the carry signal(s) from the next less significant column, and organized such that the inputs bits are applied to the chain at points having the most nearly matched delay associated therewith, and that the carry signal(s) from the next less significant column array is (are) applied to the array at points having the most nearly matched delay associated therewith or are least impacted by the delay(s) associated with the carry signal(s) from said next less significant column, with each said successive column of the array of adders producing either one or two end results, one of which is the carry signal having the longest associated delay from the next less significant column, both of which said end results are passed on to a final parallel adder stage, and each of said successive columns of the array of adders also producing carry-out signals from each of said successive column's component adders which are passed on to the next more significant column of the array of adders, until a column is reached where there are no more than a total of two inputs, including carries; and a final column, having no more than two inputs, including carry signals, which inputs are passed directly on to a final parallel adder stage.
Claim 15
Dependent Claim 363 words
A weighted-delay column adder for adding binary numbers, comprising: an array of adders interconnected in chains in a plurality of columns, each column corresponding to the significance of the bits of binary numbers being added and receiving those bits; a first, least significant column of the array of adders organized such that the least significant column of bits from the binary inputs are applied to the adder chains at points having the most nearly matched delay associated therewith, and organized such that the overall delay associated with the column is minimized, with the first column producing a carry-out from each of its component adders which is passed on to the next more significant column, and also producing a final column result which is taken as the least significant bit of the total addition; successive higher columns of the array of adders, each processing the next higher significant column of bits from the binary inputs and the carry signal(s) from the next less significant column, and organized such that the inputs bits are applied to the chain at points having the most nearly matched delay associated therewith, and that the carry signal(s) from the next less significant column array is (are) applied to the array at points having the most nearly matched delay associated therewith or are least impacted by the delay(s) associated with the carry signal(s) from said next less significant column, with each said successive column of the array of adders producing either one or two end results, one of which is the carry signal having the longest associated delay from the next less significant column, both of which said end results are passed on to a final parallel adder stage, and each of said successive columns of the array of adders also producing carry-out signals from each of said successive column's component adders which are passed on to the next more significant column of the array of adders, until a column is reached where there are no more than a total of two inputs, including carries; and a final column, having no more than two inputs, including carry signals, which inputs are passed directly on to a final parallel adder stage.
Claim 16
Dependent Claim 33 words
A weighted-delay column adder, according to claim 10, wherein: all columns, including the final column have only one result bit each; and the end result of the addition appears at the column outputs.
Claim 17
Dependent Claim 105 words
A weighted-delay column adder, according to claim 10, wherein: one or more columns has two end results; and all columns, starting with the least significant column having more than one result bit and continuing on to all higher significant columns, are applied to a parallel adder stage suited to two input addends, such as a ripple-carry adder, the output of which parallel adder is taken as the end result of the addition for all of its associated input columns and where the result of the less significant portion of the addition is taken directly from the less significant columns not connected to the parallel adder.
Claim 18
Dependent Claim 170 words
A weighted-delay column adder for adding binary numbers, comprising: a plurality of adders arranged in columns, from a least significant column to a most significant, each column corresponding to the significance (weight) of the bits of binary numbers being added; a first, least significant column receiving the least significant bits of binary numbers being added, providing a result and providing a carry-out to the next more significant column; subsequent, next more significant columns receiving the corresponding next higher significant bits of the binary numbers being added and the carry-outs from less significant columns, providing a result and providing a carry-out to the next more significant column; and a final, most significant column receiving the most significant bits of the binary numbers being added and the carry-outs from the next less significant column and providing two results; wherein delays are associated with positions along the columns; wherein the carry-outs have delays; and the carry-outs from the columns are provided to the more significant columns at positions closely matching the carry-out delays.
Claim 19
Dependent Claim 170 words
A weighted-delay column adder for adding binary numbers, comprising: a plurality of adders arranged in columns, from a least significant column to a most significant, each column corresponding to the significance (weight) of the bits of binary numbers being added; a first, least significant column receiving the least significant bits of binary numbers being added, providing a result and providing a carry-out to the next more significant column; subsequent, next more significant columns receiving the corresponding next higher significant bits of the binary numbers being added and the carry-outs from less significant columns, providing a result and providing a carry-out to the next more significant column; and a final, most significant column receiving the most significant bits of the binary numbers being added and the carry-outs from the next less significant column and providing two results; wherein delays are associated with positions along the columns; wherein the carry-outs have delays; and the carry-outs from the columns are provided to the more significant columns at positions closely matching the carry-out delays.

References Cited (Backward Citations)

US4683548A Cited
US4887233A Cited
US5010511A Cited
US4939687A Cited
US5065353A Cited
US5036483A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1995-11-03 1996-05-04 1996-11-03 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1999-11-03 2000-05-04 2000-11-03 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2003-11-03 2004-05-04 2004-11-03 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag