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

Adder with intermediate carry circuit

Assignee: Intel Corp
•
Filing: 1988-12-16
•
Granted: 1992-08-04
•
Expires: 2008-12-16
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An metal-oxide-semiconductor (MOS) partitioned carry lookahead adder fabricated from a plurality of four bit slice blocks. Each block provides four sum signals and provides a block carry signal. The blocks are organized into groups of optimum size with logic in each group to generate a group propagate signals. Each block has a block carry line with a single transistor connected between the input and output terminals of the block. The blocks employ an intermediate carry circuit for computing sums in place of full adders. In addition, there is a main carry line with transistors controlled by the group propagate signals. For a 32 bit adder, the maximum pass gate delay in the carry chain is three pass gates.

Inventors

  • 👤 Sudarshan Kumar

Bibliographic Details

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

Claims Analysis

Total Claims: 17
Claim 1
Independent Claim 242 words
In a semiconductor adder employing carry lookahead and organized into a plurality of serially coupled blocks, each of said blocks receiving a carry-in signal and providing carry-out signal and N output sum signals, a circuit for providing at least some of said N output sum signals for said blocks comprising: a plurality of logic gates for generating two sets of carry signals for C(N-1), C(N-2) and C(N-3) from at least some of the propagate signals P0, P1 . . . PN and generate signals G0, G1 . . . GN, one of said sets of carry signals being true if said carry-in signal is in a first state, the other of said sets of carry signal being true if said carry-in signal is in a second state, such that a pair of carry signals is generated for each of C(N-1), C(N-2) and C(N-3), wherein one of said carry signals in each of said pairs is true if said carry-in signal is in said first state, the other of said carry signals in each of said pairs being true if said carry-in signal is in said second state, at least one of said carry signals for one of said pairs being derived from the other carry signal is said one pair; and means coupled to said logic gate for providing at least said sum signals S(N-1), S(N-2) and S(N-3) based on the state of said carry-in signal and said sets of carry signals.
Claim 2
Dependent Claim 242 words
In a semiconductor adder employing carry lookahead and organized into a plurality of serially coupled blocks, each of said blocks receiving a carry-in signal and providing carry-out signal and N output sum signals, a circuit for providing at least some of said N output sum signals for said blocks comprising: a plurality of logic gates for generating two sets of carry signals for C(N-1), C(N-2) and C(N-3) from at least some of the propagate signals P0, P1 . . . PN and generate signals G0, G1 . . . GN, one of said sets of carry signals being true if said carry-in signal is in a first state, the other of said sets of carry signal being true if said carry-in signal is in a second state, such that a pair of carry signals is generated for each of C(N-1), C(N-2) and C(N-3), wherein one of said carry signals in each of said pairs is true if said carry-in signal is in said first state, the other of said carry signals in each of said pairs being true if said carry-in signal is in said second state, at least one of said carry signals for one of said pairs being derived from the other carry signal is said one pair; and means coupled to said logic gate for providing at least said sum signals S(N-1), S(N-2) and S(N-3) based on the state of said carry-in signal and said sets of carry signals.
Claim 3
Dependent Claim 152 words
The circuit defined by claim 1 wherein said plurality of logic gates for generating said carry signals for CN-1 and C(N-2) comprise: four sections of gates, the first and second sections being connected through a first pass transistor, and the second and third sections being coupled through a second pass transistor, said first and second transistors being controlled by said P2 signal; precharging means for precharging said four sections; said first section being discharged by said G1, or said P1 and G0 signals; said second section being discharged by said G2 signal; said third section being discharged by said P0 and P1 signals; said first section providing the first state of said C(N-2) signal; said first and third sections providing the second state of said C(N-2) signal; said third section providing the first state of said C(N-1) signal; and, said second and fourth sections providing the second state of said C(N-1) signal.
Claim 4
Dependent Claim 19 words
The circuit defined by claim 1 wherein said logic gates simultaneously provide said carry signals C(N-1), C(N-2) and C(N-3).
Claim 5
Dependent Claim 38 words
The circuit defined by claim 1 wherein said means comprises two sets of multiplexers, a first of which are controlled by said PN, P(N-1) and P(N-2) signals and the second of which are controlled of said carry-in signal.
Claim 6
Independent Claim 236 words
A method of computing digital sums in a lookahead adder which provides a plurality of output sums and which is organized into a plurality of serially coupled blocks, each of said blocks receiving a carry-in signal and providing a carry-out signal, comprising the steps of: deriving two sets of carry signals, one of said sets of carry signals being valid if said carry-in signal is in a first state, the other of said sets of carry signals being valid if said carry-in signal is in a second state, such that a plurality of pairs of carry signals are generated, one of said carry signals in each of said plurality of pairs being true if said carry-in signal is in said first state, the other of said carry signals in each of said plurality of pairs being true if said carry-in signal is in said second state, at least one of said carry signals for one of said pairs being derived from the other carry signal in said one pair; deriving two sets of sum signals from said two sets of carry signals, one set of said sum signals being valid if said carry-in signal is in said first state, the other of said sets of sum signals being valid if said carry-in signal is in said second state; and selecting between said two sets of sums as a function of the state of said carry-in signal.
Claim 7
Independent Claim 236 words
A method of computing digital sums in a lookahead adder which provides a plurality of output sums and which is organized into a plurality of serially coupled blocks, each of said blocks receiving a carry-in signal and providing a carry-out signal, comprising the steps of: deriving two sets of carry signals, one of said sets of carry signals being valid if said carry-in signal is in a first state, the other of said sets of carry signals being valid if said carry-in signal is in a second state, such that a plurality of pairs of carry signals are generated, one of said carry signals in each of said plurality of pairs being true if said carry-in signal is in said first state, the other of said carry signals in each of said plurality of pairs being true if said carry-in signal is in said second state, at least one of said carry signals for one of said pairs being derived from the other carry signal in said one pair; deriving two sets of sum signals from said two sets of carry signals, one set of said sum signals being valid if said carry-in signal is in said first state, the other of said sets of sum signals being valid if said carry-in signal is in said second state; and selecting between said two sets of sums as a function of the state of said carry-in signal.
Claim 8
Dependent Claim 314 words
In a semiconductor adder employing carry lookahead and organized into a plurality of serially coupled blocks, each of said blocks receiving a carry-in signal and providing a carry-out signal, a circuit for providing a plurality of output sum signals for said blocks comprising: first means for receiving P0, P1 . . . PN propagate signals and G0, G1 . . . GN generate signals; second means coupled to said first means for providing two sets of carry signals for at least CN and C(N-1) from at least some of said propagate and generate signals independently of said carry-in signal, one of said sets of carry signals being valid if said carry-in signal is in a first state, the other of said sets of carry signals being valid if said carry-in signal is in a second state, such that a plurality of pairs of carry signals are generated for at least CN and C(N-1), one of said carry signals in each of said plurality of pairs being true if said carry-in signal is in said first state, the other of said carry signals in each of said plurality of pairs being true if said carry-in signal is in said second state, at least one of said carry signals for one of said pairs being derived from the other carry signal in said one pair; third means coupled to said second means for providing two sets of sum signals for at least SN and S(N-1) from at least said CN and C(N-1) carry signals, one of said sets of sum signals being valid if said carry-in signal is in said first state, the other of said sets of sum signals being valid if said carry-in signal is in said second state; and fourth means coupled to said third means for selecting between said two sets of sum signals for said fourth means receiving said carry-in signal.
Claim 9
Dependent Claim 314 words
In a semiconductor adder employing carry lookahead and organized into a plurality of serially coupled blocks, each of said blocks receiving a carry-in signal and providing a carry-out signal, a circuit for providing a plurality of output sum signals for said blocks comprising: first means for receiving P0, P1 . . . PN propagate signals and G0, G1 . . . GN generate signals; second means coupled to said first means for providing two sets of carry signals for at least CN and C(N-1) from at least some of said propagate and generate signals independently of said carry-in signal, one of said sets of carry signals being valid if said carry-in signal is in a first state, the other of said sets of carry signals being valid if said carry-in signal is in a second state, such that a plurality of pairs of carry signals are generated for at least CN and C(N-1), one of said carry signals in each of said plurality of pairs being true if said carry-in signal is in said first state, the other of said carry signals in each of said plurality of pairs being true if said carry-in signal is in said second state, at least one of said carry signals for one of said pairs being derived from the other carry signal in said one pair; third means coupled to said second means for providing two sets of sum signals for at least SN and S(N-1) from at least said CN and C(N-1) carry signals, one of said sets of sum signals being valid if said carry-in signal is in said first state, the other of said sets of sum signals being valid if said carry-in signal is in said second state; and fourth means coupled to said third means for selecting between said two sets of sum signals for said fourth means receiving said carry-in signal.
Claim 10
Dependent Claim 47 words
The circuit defined by claim 6 wherein said second means includes means for logically ORing at least one of said carry signals of said one pair with the result of logically ANDing said propagate signals to generate the other of said carry signals for said one pair.
Claim 11
Dependent Claim 17 words
The circuit defined by claim 7 wherein said fourth means comprises multiplexers controlled by said carry-in signal.
Claim 12
Dependent Claim 15 words
The circuit defined by claim 8 wherein said third means comprises an exclusive ORing gate.
Claim 13
Dependent Claim 20 words
The circuit defined by claim 9 wherein said third means includes a pair of multiplexers which are controlled by PN.
Claim 14
Dependent Claim 19 words
The circuit defined by claims 6 or 8 wherein said carry signals are simultaneously generated by said second means.
Claim 15
Dependent Claim 21 words
The circuit defined by claim 11 wherein said fourth means also includes a multiplexer which selects between P0 and its complement.
Claim 16
Dependent Claim 280 words
In a semiconductor adder employing carry lookahead and organized into a plurality of serially coupled blocks, each of said blocks receiving a carry-in signal and providing carry-out signal and N output sum signals, a circuit for providing at least some of said N output sum signals for said blocks comprising: a plurality of logic gates for generating two sets of carry signals for C(N-1), C(N-2) and C(N-3) from at least some of the propagate signals P0, P1 . . . PN and generate signals G0, G1 . . . GN, one of said sets of carry signals being true if said carry-in signal is in a first state, the other of said sets of carry signal being true if said carry-in signal is in a second state, said plurality including four sections of gates, the first and second sections being connected through a first pass transistor, and the second and third sections being coupled through a second pass transistor, said first and second transistors being controlled by said P2 signal; precharging means for precharging said four sections, said first section being discharged by said G1, or said P1 and G0 signals, said second section being discharges by said P0 and P1 signals, said first section providing the first state of said C(N-2) signal, said first and third sections providing the second state of said C(N-2) signal, said third section providing the first state C(N-1) signal, said second and fourth sections providing the second state of said C(N-1) signal; and means coupled to said logic gate for providing at least said sum signals S(N-1), S(N-2) and S(N-3) based on the state of said carry-in signal and said sets of carry signals.
Claim 17
Dependent Claim 280 words
In a semiconductor adder employing carry lookahead and organized into a plurality of serially coupled blocks, each of said blocks receiving a carry-in signal and providing carry-out signal and N output sum signals, a circuit for providing at least some of said N output sum signals for said blocks comprising: a plurality of logic gates for generating two sets of carry signals for C(N-1), C(N-2) and C(N-3) from at least some of the propagate signals P0, P1 . . . PN and generate signals G0, G1 . . . GN, one of said sets of carry signals being true if said carry-in signal is in a first state, the other of said sets of carry signal being true if said carry-in signal is in a second state, said plurality including four sections of gates, the first and second sections being connected through a first pass transistor, and the second and third sections being coupled through a second pass transistor, said first and second transistors being controlled by said P2 signal; precharging means for precharging said four sections, said first section being discharged by said G1, or said P1 and G0 signals, said second section being discharges by said P0 and P1 signals, said first section providing the first state of said C(N-2) signal, said first and third sections providing the second state of said C(N-2) signal, said third section providing the first state C(N-1) signal, said second and fourth sections providing the second state of said C(N-1) signal; and means coupled to said logic gate for providing at least said sum signals S(N-1), S(N-2) and S(N-3) based on the state of said carry-in signal and said sets of carry signals.

References Cited (Backward Citations)

US3100836A Cited
US3553446A Cited
US4584661A Cited
US4639888A Cited
US4623982A Cited
US4811272A Cited

USPTO Annuity & Maintenance Windows

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

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag