US4642798A
Expired / Lapsed
US
⏱️ 0.0 years remaining
CMOS E2 PROM decoding circuit
Assignee: Intel Corp
•
Filing: 1985-10-01
•
Granted: 1987-02-10
•
Expires: 2005-10-01
Abstract
Abstract A static decoding circuit which may be utilized with E 2 PROM arrays. The circuit utilizes predecoded address signals to generate signals to the word lines in read, program, erase and bulk erase modes. The circuit includes a low voltage to high voltage converter, CMOS switches and post decoders which include a p-channel device so that individual row lines may be erased as well as all the row lines. In the read mode, the selected word line goes to VCC and other go to zero. In the programming mode, the selected word line goes to VPP and the selected word line goes to zero and the unselected word lines go to VPP. In the bulk erase mode, all the word lines go to zero.
Inventors
- 👤 Kameswara K. Rao
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 12:53
CPC Classifications
G; G11; G11C; G11C16/00; G11C16/02; G11C16/06; G11C16/10; G11C16/12; G11C16/14; G11C16/16; G11C8/00; G11C8/10
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
168 words
A CMOS electrically erasable, read only memories (E 2 PROM) static decoding circuit comprising: a first decoding means for receiving first address signals and for providing a first signal when said first address signals are in a predetermined state; a conversion means coupled to said first decoding means for converting said first signal into second and third signals; a pair of first switches coupled to said conversion means and to a first node, said first switches for providing one of said second and third signals to said first node; a plurality of said switches coupled to said node and to a plurality of second nodes, said second switches for passing said selected signal of said first node to said second nodes, said second nodes each coupled to at least one memory cell; first and second transistors coupled to each of said second nodes, said first and second transistors providing fourth and fifth signals at said second nodes; whereby signals may be provided to selected of said memory cells.
Claim 2
Dependent Claim
168 words
A CMOS electrically erasable, read only memories (E 2 PROM) static decoding circuit comprising: a first decoding means for receiving first address signals and for providing a first signal when said first address signals are in a predetermined state; a conversion means coupled to said first decoding means for converting said first signal into second and third signals; a pair of first switches coupled to said conversion means and to a first node, said first switches for providing one of said second and third signals to said first node; a plurality of said switches coupled to said node and to a plurality of second nodes, said second switches for passing said selected signal of said first node to said second nodes, said second nodes each coupled to at least one memory cell; first and second transistors coupled to each of said second nodes, said first and second transistors providing fourth and fifth signals at said second nodes; whereby signals may be provided to selected of said memory cells.
Claim 3
Dependent Claim
18 words
The circuit as described by claim 1, wherein said first and second switches are comprised of CMOS switches.
Claim 4
Dependent Claim
19 words
The circuit as described by claim 1, wherein said first transistors comprise p-channel transistors coupled to a voltage source.
Claim 5
Dependent Claim
17 words
The circuit as desribed by claim 1, wherein said second transistors comprise n-channel transistors coupled to ground.
Claim 6
Dependent Claim
292 words
A CMOS electrically erasable, read only memories (E 2 PROM) static decoding circuit comprising: a first decoding means for receiving first address signals and for providing a first signal and a first signal complement when said first address signals are in a predetermined state; a conversion means coupled to said first decoding means for converting the potential of said first signal and said first signal complement, said conversion means providing a second and third signal; a pair of first switches coupled to receive said second and third signals respectively and to said first decoding means, said first switches providing one of said second and third signals to a first node when said first address signals are in a predetermined state; a plurality of second switches coupled to said first node and to said first decoding means, each of said second switches coupled through one of a plurality of second nodes to at least one memory cell, said second switches providing a current path between said first node and said second nodes when said first address signals are in a predetermined state; a pull up p-channel transistor coupled to each of said second nodes and to a voltage source, the gates of each of said pull up transistors coupled to said first decoding means, said pull up transistors coupling said second node to said voltage source when said first address signals are in a predetermined state; an n-channel pull down transistor coupled to each of said second nodes and to ground, the gate of said pull down transistor coupled to said first decoding means, said pull down transistor coupling said second node to ground when said first address signals are in a predetermined state; whereby one of said memory cells may be selected.
Claim 7
Dependent Claim
292 words
A CMOS electrically erasable, read only memories (E 2 PROM) static decoding circuit comprising: a first decoding means for receiving first address signals and for providing a first signal and a first signal complement when said first address signals are in a predetermined state; a conversion means coupled to said first decoding means for converting the potential of said first signal and said first signal complement, said conversion means providing a second and third signal; a pair of first switches coupled to receive said second and third signals respectively and to said first decoding means, said first switches providing one of said second and third signals to a first node when said first address signals are in a predetermined state; a plurality of second switches coupled to said first node and to said first decoding means, each of said second switches coupled through one of a plurality of second nodes to at least one memory cell, said second switches providing a current path between said first node and said second nodes when said first address signals are in a predetermined state; a pull up p-channel transistor coupled to each of said second nodes and to a voltage source, the gates of each of said pull up transistors coupled to said first decoding means, said pull up transistors coupling said second node to said voltage source when said first address signals are in a predetermined state; an n-channel pull down transistor coupled to each of said second nodes and to ground, the gate of said pull down transistor coupled to said first decoding means, said pull down transistor coupling said second node to ground when said first address signals are in a predetermined state; whereby one of said memory cells may be selected.
Claim 8
Dependent Claim
16 words
The circuit as described by claim 5 wherein said first and second switches comprise CMOS switches.
Claim 9
Dependent Claim
19 words
The circuit as described by claim 5 wherein said first decoding means comprises a plurality of buffers and predecoders.
Claim 10
Dependent Claim
24 words
The circuit as described by claim 5 wherein said conversion means comprises a pair of cross-coupled p-channel transistors each coupled to an n-channel transistor.
Claim 11
Dependent Claim
18 words
The circuit as described by claim 5 wherein said voltage source is sufficient to program said memory cells.
References Cited (Backward Citations)
US4477739A
Cited
US4130890A
Cited
US4344005A
Cited
US4264828A
Cited
US4200917A
Cited
US4374430A
Cited
US4387447A
Cited
US4455629A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1990-02-09 | 1990-08-11 | 1991-02-10 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1994-02-09 | 1994-08-11 | 1995-02-10 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1998-02-09 | 1998-08-11 | 1999-02-10 | $7700.00 | Window Closed / Lapsed |