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

Plural dummy select chain logic synthesis network

Assignee: International Business Machines Corp
•
Filing: 1989-04-28
•
Granted: 1991-01-01
•
Expires: 2009-04-28
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A logic synthesis network for efficiently combining respective bit pairs of first and second operands to produce respective sum bits and a carry bit associated with the most significant sum bit. A dummy generator receives the respective bit pairs and generates first and second dummy sum signals, and first and second pairs of dummy carry signals. A first dummy selector chain selects the appropriate dummy sum and carry signals of all the bits other than the least significant bit, as a function of the state of the first pair of dummy carry signals generated for the least significant bit pair. A second dummy select chain selects the appropriate dummy sum and carry signals for all the bit pairs other than the least significant bit pair, as a function of the state of the second pair of dummy carry signals generated for the least significant bit pair. Sum generators associated with each bit choose between the selected dummy sum signals from the first and second dummy select chains in accordance with the state of the carry-in signal associated with the least significant bit pair. Carry generators associated with each bit pair choose between the first and second pairs of dummy carry signals at the ends of the first and second dummy select chains, again in accordance with the state of the carry-in signal associated with the least significant bit pair.

Inventors

  • 👤 Roland A. Bechade

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-01 13:36
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/50; G06F7/505; G06F7/506; G06F7/507

Claims Analysis

Total Claims: 16
Claim 1
Independent Claim 315 words
A logic synthesis network for combining repsective bit pairs of first and second operands, including at least a least significant bit pair and a most significant bit pair, so as to generate a sum bit for each respective bit pair and carry-out bits to accompany the sum bit for the most significant bit pair, the least significant bit pair including carry-in bits, comprising: a first means for generating a plurality of dummy sum and dummy carry signals for all of the respective bit pairs at substantially the same time; a first dummy select chain for serially selecting between said dummy sum and carry signals from said first means for each bit pair other than said least significant bit pair, in accordance with first dummy carry signals generated by said first means for said least significant bit pair; a second dummy select chain for serially selecting between said dummy sum and carry signals from said first means for each bit pair other than said least significant bit pair, in accordance with second dummy carry signals generated by said first means for said least significant bit pair; a second means for selecting between said dummy sum signals from said first and second dummy select chains for each bit pair other than said least significant bit pair and selecting between said dummy sum signals generated by said first means for said least significant bit pair, at substantially the same time, and providing the selected signal as the sum bit for the respective bit pair, said second means being controlled by the carry-in bits of the least significant bit pair; and a third means for selecting between the dummy carry signals from the first and second dummy select chains and providing the selected signals as the carry-out bits accompanying the most significant bit pair, said third means being controlled by the carry-in bits of the least significant bit pair.
Claim 2
Dependent Claim 315 words
A logic synthesis network for combining repsective bit pairs of first and second operands, including at least a least significant bit pair and a most significant bit pair, so as to generate a sum bit for each respective bit pair and carry-out bits to accompany the sum bit for the most significant bit pair, the least significant bit pair including carry-in bits, comprising: a first means for generating a plurality of dummy sum and dummy carry signals for all of the respective bit pairs at substantially the same time; a first dummy select chain for serially selecting between said dummy sum and carry signals from said first means for each bit pair other than said least significant bit pair, in accordance with first dummy carry signals generated by said first means for said least significant bit pair; a second dummy select chain for serially selecting between said dummy sum and carry signals from said first means for each bit pair other than said least significant bit pair, in accordance with second dummy carry signals generated by said first means for said least significant bit pair; a second means for selecting between said dummy sum signals from said first and second dummy select chains for each bit pair other than said least significant bit pair and selecting between said dummy sum signals generated by said first means for said least significant bit pair, at substantially the same time, and providing the selected signal as the sum bit for the respective bit pair, said second means being controlled by the carry-in bits of the least significant bit pair; and a third means for selecting between the dummy carry signals from the first and second dummy select chains and providing the selected signals as the carry-out bits accompanying the most significant bit pair, said third means being controlled by the carry-in bits of the least significant bit pair.
Claim 3
Dependent Claim 25 words
The logic synthesis network as recited in claim 1, wherein each of said first and second carry select chains comprise a plurality of transmission gates.
Claim 4
Dependent Claim 22 words
The logic synthesis network as recited in claim 2, wherein each of said plurality of transmission gates comprise N and P devices.
Claim 5
Dependent Claim 19 words
The logic synthesis network as recited in claim 2, wherein said first means is comprised of NAND-NOR logic gates.
Claim 6
Dependent Claim 393 words
A logic synthesis network for combining respective bit pairs of first and second operands, including at least a least significant bit pair and a most significant bit pair, so as to generate a sum bit for each respective bit pair and carry-out bits for the most significant bit pair, the least significant bit pair including carry-in bits, comprising: a first means for generating first and second dummy sum signals, and first and second pairs of dummy carry signals, for all of the respective bit pairs at substantially the same time; a first dummy select chain comprising a plurality of members, each of which selects one of said first and second dummy sum signals and one of said first and second pairs of dummy carry signals from said first means for each respective bit pair other than the least significant bit pair, as a function of the first pair of dummy carry signals from said first means for the least significant bit pair, the selected pair of dummy carry signals from a given member of said first dummy select chain providing a control input to the next member; a second dummy select chain comprising a plurality of members, each of which selects the other of said first and second dummy sum signals and the other of said first and second pairs of dummy carry signals from said first means for each respective bit pair other than the least significant bit pair, as a function of the second pair of dummy carry signals from said first means for the least significant bit pair, the selected pair of dummy carry signals from a given member of said second dummy select chain providing a control input to the next member; a second means for selecting between said first and second dummy sum signals from said first and second dummy select chains to produce the sum bit for each bit pair at substantially the same time, the second means being controlled by the carry-in bits of the least significant bit pair; and a third means receiving the selected pairs of dummy carry signals from each of the first and second dummy select chains and selecting between said pairs to produce the carry-out bits for the sum bit for the most significant bit pair, the third means being controlled by the carry-in bits of the least significant bit pair.
Claim 7
Dependent Claim 393 words
A logic synthesis network for combining respective bit pairs of first and second operands, including at least a least significant bit pair and a most significant bit pair, so as to generate a sum bit for each respective bit pair and carry-out bits for the most significant bit pair, the least significant bit pair including carry-in bits, comprising: a first means for generating first and second dummy sum signals, and first and second pairs of dummy carry signals, for all of the respective bit pairs at substantially the same time; a first dummy select chain comprising a plurality of members, each of which selects one of said first and second dummy sum signals and one of said first and second pairs of dummy carry signals from said first means for each respective bit pair other than the least significant bit pair, as a function of the first pair of dummy carry signals from said first means for the least significant bit pair, the selected pair of dummy carry signals from a given member of said first dummy select chain providing a control input to the next member; a second dummy select chain comprising a plurality of members, each of which selects the other of said first and second dummy sum signals and the other of said first and second pairs of dummy carry signals from said first means for each respective bit pair other than the least significant bit pair, as a function of the second pair of dummy carry signals from said first means for the least significant bit pair, the selected pair of dummy carry signals from a given member of said second dummy select chain providing a control input to the next member; a second means for selecting between said first and second dummy sum signals from said first and second dummy select chains to produce the sum bit for each bit pair at substantially the same time, the second means being controlled by the carry-in bits of the least significant bit pair; and a third means receiving the selected pairs of dummy carry signals from each of the first and second dummy select chains and selecting between said pairs to produce the carry-out bits for the sum bit for the most significant bit pair, the third means being controlled by the carry-in bits of the least significant bit pair.
Claim 8
Dependent Claim 33 words
The logic synthesis network as recited in claim 5, wherein the first means comprises a plurality of circuit blocks, each of said blocks receiving one of said respective bit pairs as an input.
Claim 9
Dependent Claim 64 words
The logic synthesis network as recited in claim 6, wherein each of said logic blocks comprise: a first NAND gate receiving said respective bit pair as inputs; a first NOR gate receiving said respective bit pair as inputs; and a second NOR gate receiving the output of said first NOR gate and the inverse of the output of said first NAND gate as inputs.
Claim 10
Dependent Claim 47 words
The logic synthesis network as recited in claim 7, wherein said first NAND gate provides the first pair of dummy carry signals, said first NOR gate provides the second pair of dummy carry signals, and said second NOR gate provides said first and second dummy sum signals.
Claim 11
Dependent Claim 25 words
The logic synthesis network as recited in claim 5, wherein said first and second dummy sum and carry chains comprise a plurality of transmission gates.
Claim 12
Dependent Claim 23 words
The logic synthesis network as recited in claim 9, wherein each of said plurality of transmission gates comprise parallel N and P devices.
Claim 13
Dependent Claim 19 words
The logic synthesis network as recited in claim 5, wherein said second means comprises a plurality of transmission gates.
Claim 14
Dependent Claim 21 words
The logic synthesis network as recited in claim 11, wherein each of said transmission gates comprise parallel N and P devices.
Claim 15
Dependent Claim 19 words
The logic synthesis network as recited in claim 5, wherein said third means comprises a plurality of transmission gates.
Claim 16
Dependent Claim 21 words
The logic synthesis network as recited in claim 13, wherein each of said transmission gates comprise parallel N and P devices.

USPTO Annuity & Maintenance Windows

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

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag