Patent US2955503A successfully refreshed from Google Patents.
← Back to Patent Explorer
EP0187698A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

Balanced full adder circuit

Assignee: Advanced Micro Devices Inc
•
Filing: 1986-01-03
•
Granted: —
•
Expires: 2006-01-03
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A full adder circuit includes a sum circuit section, a carry-out circuit section, a carry-in circuit section; and an output circuit section. The sum circuit section includes a plurality of N-channel type MOS transistors having their gates adapted to receive true and complement binary addend signals of an ith order. The sum circuit section also includes a plurality of N-channel type of MOS transistors having their gates adapted to receive true and complement binary augend signals of an ith order. The carry-out circuit section includes a plurality of N-channel type MOS transistors having their gates adapted to receive true and complement binary addend signals of an ith order. The carry-out circuit section also includes a plurality of N-channel MOS transistors having their gates adapted to receive true and complement binary augend signals of an ith order. The carry-in circuit section is formed of a plurality of N-channel type MOS transistors having their gates adapted to receive true and complement carry-in signals of an ith-1 order. The output circuit section includes a first pair of cross-coupled P-channel type MOS transistors connected to the sum circuit section and having their drains connected to respective true and complement sum output terminals. The output circuit section further includes a second pair of cross-coupled P-channel type MOS tansistors connected to the carry-out circuit section and having their drains connected to respective true and complement carry-out terminals. All of the transistors are arranged on an integrated circuit substrate with topological regularity.

Inventors

  • 👤 Sheng Fang

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-11-09 19:55
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/50; G06F7/501; G06F7/5016; G06F2207/00; G06F2207/38; G06F2207/48; G06F2207/4802; G06F2207/4816

Claims Analysis

Total Claims: 17
Claim 1
Independent Claim 93 words
A full adder circuit composed of CMOS transistors comprising: first input means for receiving true and complement binary addend signals; second input means for receiving true and complement binary augend signals; third input means for receiving true and complement binary carry input signals; first output means responsive to said first, second and third input means for generating true and complement sum output signals; and second output means responsive to said first, second and third output means responsive to said first, second and third input means for generating true and complement carry output signals.
Claim 2
Dependent Claim 93 words
A full adder circuit composed of CMOS transistors comprising: first input means for receiving true and complement binary addend signals; second input means for receiving true and complement binary augend signals; third input means for receiving true and complement binary carry input signals; first output means responsive to said first, second and third input means for generating true and complement sum output signals; and second output means responsive to said first, second and third output means responsive to said first, second and third input means for generating true and complement carry output signals.
Claim 3
Dependent Claim 23 words
A full adder circuit as claimed in Claim 1, wherein said first input means is formed of a plurality of N-channel MOS transistors.
Claim 4
Dependent Claim 23 words
A full adder circuit as claimed in Claim 2, wherein said second input means is formed of a plurality of N-channel MOS transistors.
Claim 5
Dependent Claim 23 words
A full adder circuit as claimed in Claim 3, wherein said third input means is formed of a plurality of N-channel MOS transistors.
Claim 6
Dependent Claim 36 words
A full adder circuit as claimed in Claim 4, wherein said first output means is formed of a pair of cross-coupled P-channel MOS transistors whose drains are connected to respective true and complement sum output terminals.
Claim 7
Dependent Claim 31 words
A full adder circuit as claimed in Claim 5, wherein said true and complement sum output signals are generated at respective true and complement sum output terminals at the same time.
Claim 8
Dependent Claim 36 words
A full adder circuit as claimed in Claim 6, wherein said second output means is formed of a pair of cross-coupled P-channel MOS transistors whose drains are connected to respective true and complement carry output terminals.
Claim 9
Dependent Claim 32 words
A full adder circuit as claimed in Claim 7, wherein said true and complement carry output signals are generated at the respective true and complement carry output terminals at the same time.
Claim 10
Dependent Claim 26 words
A full adder circuit as claimed in Claim 1, wherein said first, second and third input means are formed of MOS transistors of one conductivity .
Claim 11
Dependent Claim 25 words
A full adder circuit as claimed in Claim 9, wherein said first and second output means are formed of MOS transistors of a complementary type.
Claim 12
Dependent Claim 24 words
A full adder circuit as claimed in Claim 10, wherein all of said transistors are arranged on an integrated circuit substrate with topological regularity.
Claim 13
Dependent Claim 175 words
A balanced CMOS full adder circuit comprising: a sum circuit section including: a plurality of N-channel MOS transistors having their gates adapted to receive true and complement binary addend signals; a plurality of N-channel MOS transistors having their gates adapted to receive true and complement binary augend signals; a carry output circuit section including: a plurality of N-channel MOS transistors having their gates adapted to receive true and complement binary addend signals; and a plurality of N-channel MOS transistors having their gates adapted to receive true and complement augend signals; a carry input circuit section including: a plurality of N-channel MOS transistors having their gates adapted to receive true and complement carry input signals; an output circuit section including: a first pair of cross-coupled P-channel MOS transistors connected to said sum circuit section and having their drains connected to respective true and complement sum output terminals; and a second pair of cross-coupled P-channel MOS transistors connected to said carry out circuit-section and having their drains connected to respective true and complement carry output output terminals.
Claim 14
Dependent Claim 175 words
A balanced CMOS full adder circuit comprising: a sum circuit section including: a plurality of N-channel MOS transistors having their gates adapted to receive true and complement binary addend signals; a plurality of N-channel MOS transistors having their gates adapted to receive true and complement binary augend signals; a carry output circuit section including: a plurality of N-channel MOS transistors having their gates adapted to receive true and complement binary addend signals; and a plurality of N-channel MOS transistors having their gates adapted to receive true and complement augend signals; a carry input circuit section including: a plurality of N-channel MOS transistors having their gates adapted to receive true and complement carry input signals; an output circuit section including: a first pair of cross-coupled P-channel MOS transistors connected to said sum circuit section and having their drains connected to respective true and complement sum output terminals; and a second pair of cross-coupled P-channel MOS transistors connected to said carry out circuit-section and having their drains connected to respective true and complement carry output output terminals.
Claim 15
Dependent Claim 31 words
A full adder circuit as claimed in Claim 12, wherein true and complement sum output signals are generated at the respective true and complement sum output terminals at the same time.
Claim 16
Dependent Claim 28 words
A full adder circuit as claimed in Claim 13, wherein true and complement carry output signals are generated at the respective carry output terminals at the same time.
Claim 17
Dependent Claim 23 words
A full adder circuit as claimed in Claim 12, wherein all of said transistors are arranged on an integrated substrate with topological regularity.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag