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

CMOS tree decoder with speed enhancement by adjustment of gate width

Assignee: Sharp Corp
•
Filing: 1984-07-10
•
Granted: 1987-08-04
•
Expires: 2004-07-10
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A semi-conductor decoder circuit includes 2 N-1 circuits each formed of transistors vertically arranged in N stages, with the transistors of 2 N-1 , 2 N-2 . . . 2 1 , 2 0 number being disposed sequentially from the output stage in N stages in a tree structure. The gate width of the transistor at each stage is expanded as a distance from the output stage is increased so as to prevent an increase in ON resistance of the circuit and also to achieve a high speed operation.

Inventors

  • 👤 Munehiro Uratani

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-08 07:33
CPC Classifications
H; H03; H03K; H03K19/00; H03K19/02; H03K19/173; H03K19/1733; H03K19/1738; H03M; H03M7/00; H03M7/14; H03M7/20; H03M7/22

Claims Analysis

Total Claims: 5
Claim 1
Independent Claim 279 words
A semiconductor decoder circuit comprising: 2 N-1 number of NAND gate means, each having N inputs and collectively developing an output, where N is greater than 2, each said NAND gate means including; N first transistors, each having a control terminal coupled to receive one of said N inputs and first and second controlled terminals, said first controlled terminals being commonly connected together to said output, said second controlled terminals coupled to receive a supply voltage; and a unique path of at least N-1 second transistors, said second transistors each having an input gate coupled to receive one of said N inputs and third and fourth controlled terminals, said N-1 second transistors in said unique path being serially connected together by their respective third and fourth terminals to form N-1 stages between said commonly connected first controlled terminals and a reference node; said unique path between each of said 2 N-1 number of NAND gate means and said reference node sharing at least some of said N-1 second transistors with the unique path of others of said NAND gate means, said N-1 second transistors of all of said 2 N-1 number of NAND gate means being connected in a cascade arrangement with said said unique paths intersecting to connect the N first transistors of each of said 2 N-1 number of NAND gate means to said reference node at a single point; each gate of one of said N-1 second transistors in the N-1 stage having a gate width inversely proportional to the number of transistors in said N-1 stage to thereby make the total gate width of all of said second transistors at each said stage substantially constant.
Claim 2
Dependent Claim 279 words
A semiconductor decoder circuit comprising: 2 N-1 number of NAND gate means, each having N inputs and collectively developing an output, where N is greater than 2, each said NAND gate means including; N first transistors, each having a control terminal coupled to receive one of said N inputs and first and second controlled terminals, said first controlled terminals being commonly connected together to said output, said second controlled terminals coupled to receive a supply voltage; and a unique path of at least N-1 second transistors, said second transistors each having an input gate coupled to receive one of said N inputs and third and fourth controlled terminals, said N-1 second transistors in said unique path being serially connected together by their respective third and fourth terminals to form N-1 stages between said commonly connected first controlled terminals and a reference node; said unique path between each of said 2 N-1 number of NAND gate means and said reference node sharing at least some of said N-1 second transistors with the unique path of others of said NAND gate means, said N-1 second transistors of all of said 2 N-1 number of NAND gate means being connected in a cascade arrangement with said said unique paths intersecting to connect the N first transistors of each of said 2 N-1 number of NAND gate means to said reference node at a single point; each gate of one of said N-1 second transistors in the N-1 stage having a gate width inversely proportional to the number of transistors in said N-1 stage to thereby make the total gate width of all of said second transistors at each said stage substantially constant.
Claim 3
Dependent Claim 15 words
The decoder circuit of claim 1 wherein said first transistors are PMOS field effect transistors.
Claim 4
Dependent Claim 15 words
The decoder circuit of claim 1 wherein said second transistors are NMOS field effect transistors.
Claim 5
Dependent Claim 21 words
The decoder circuit of claim 1 wherein said at least N-1 second transistors of each unique path comprise N second transistors.

References Cited (Backward Citations)

US3355598A Cited
US3539823A Cited
US4140924A Cited
US4176287A Cited
US4491839A Cited
US4430583A Cited

USPTO Annuity & Maintenance Windows

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

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag