Patent US1656304A successfully refreshed from Google Patents.
US6044010A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Five transistor SRAM cell
Assignee: National Semiconductor Corp
•
Filing: 1998-10-05
•
Granted: 2000-03-28
•
Expires: 2018-10-05
Abstract
Abstract A five transistor static random-access-memory (SRAM) cell is disclosed. The cell includes two cross-coupled inverters, each having two transistors, and a single n-channel transistor switch. The cell is programmed by first forcing the node connected between the inverters and the switch to a predefined logic state that is maintained by a p-channel transistor of an inverter, and then passing the voltage that corresponds to the logic state to be programmed. If the logic state to be programmed matches the predefined logic state, no significant charge is transferred. If the logic state to be programmed does not match the predefined logic state, then the n-channel transistor switch overpowers the p-channel transistor to change the predefined logic state.
Inventors
- 👤 Daniel J. Deschene
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 08:54
CPC Classifications
G; G11; G11C; G11C11/00; G11C11/21; G11C11/34; G11C11/40; G11C11/41; G11C11/412
Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
50 words
A semiconductor memory comprising: a first inverter having an input and an output; a second inverter having an input connected only to the output of the first inverter, and an output connected to the input of the first inverter; and a switch connected to the input of the first inverter.
Claim 2
Dependent Claim
50 words
A semiconductor memory comprising: a first inverter having an input and an output; a second inverter having an input connected only to the output of the first inverter, and an output connected to the input of the first inverter; and a switch connected to the input of the first inverter.
Claim 3
Dependent Claim
52 words
The semiconductor memory of claim 1 wherein the first inverter includes: a p-channel transistor connected to a power node, the input of the first inverter, and the output of the first inverter; and a n-channel transistor connected to the input of the first inverter, the output of the first inverter, and ground.
Claim 4
Dependent Claim
54 words
The semiconductor memory of claim 1 wherein the second inverter includes: a p-channel transistor connected to a power node, the input of the second inverter, and the output of the second inverter; and a n-channel transistor connected to the input of the second inverter, the output of the second inverter, and an input node.
Claim 5
Dependent Claim
12 words
The semiconductor memory of claim 1 wherein the switch includes a transistor.
Claim 6
Independent Claim
114 words
A method for programming a semiconductor memory, the memory having: a first inverter having an input and an output; a second inverter having an input connected to the output of the first inverter, an input connected to a node, and an output connected to the input of the first inverter; and a switch having an input, and an output connected to the input of the first inverter; the method comprising the steps of: raising the voltage on the node for a predetermined time; placing a voltage on the input of the switch which corresponds to a logic state to be programmed into the semiconductor memory; and turning on the switch for a predefined time.
Claim 7
Independent Claim
114 words
A method for programming a semiconductor memory, the memory having: a first inverter having an input and an output; a second inverter having an input connected to the output of the first inverter, an input connected to a node, and an output connected to the input of the first inverter; and a switch having an input, and an output connected to the input of the first inverter; the method comprising the steps of: raising the voltage on the node for a predetermined time; placing a voltage on the input of the switch which corresponds to a logic state to be programmed into the semiconductor memory; and turning on the switch for a predefined time.
Claim 8
Dependent Claim
17 words
The method of claim 5 wherein the switch is turned on after the predetermined time has expired.
Claim 9
Independent Claim
137 words
A method for programming a semiconductor memory, the memory having: a first node; a second node; a third node; a fourth node; a first inverter having an input connected to the first node, and an output connected to the second node; a second inverter having an input connected to the second node, an output connected to the first node, and an input connected to a third node; and a switch having an input connected to the fourth node, and an output connected to the first node; the method comprising the steps of: setting a first voltage on the first node and a second voltage on the second node; placing a voltage on the fourth node which corresponds to a logic state to be programmed into the semiconductor memory; and turning on the switch for a predefined time.
Claim 10
Independent Claim
137 words
A method for programming a semiconductor memory, the memory having: a first node; a second node; a third node; a fourth node; a first inverter having an input connected to the first node, and an output connected to the second node; a second inverter having an input connected to the second node, an output connected to the first node, and an input connected to a third node; and a switch having an input connected to the fourth node, and an output connected to the first node; the method comprising the steps of: setting a first voltage on the first node and a second voltage on the second node; placing a voltage on the fourth node which corresponds to a logic state to be programmed into the semiconductor memory; and turning on the switch for a predefined time.
Claim 11
Dependent Claim
27 words
The method of claim 7 wherein the setting a first voltage step includes the step of raising the voltage on the third node for a predetermined time.
Claim 12
Dependent Claim
17 words
The method of claim 8 wherein the switch is turned on after the predetermined time has expired.
Claim 13
Independent Claim
92 words
A method for reading a semiconductor memory, the memory having: a first inverter having an input and an output; a second inverter having an input connected only to the output of the first inverter, and an output connected to the input of the first inverter; and a switch having an input and an output connected to the input of the first inverter; the method comprising the steps of: placing a voltage on the input of the switch which corresponds to a logic state; and turning on the switch for a predefined time.
Claim 14
Independent Claim
92 words
A method for reading a semiconductor memory, the memory having: a first inverter having an input and an output; a second inverter having an input connected only to the output of the first inverter, and an output connected to the input of the first inverter; and a switch having an input and an output connected to the input of the first inverter; the method comprising the steps of: placing a voltage on the input of the switch which corresponds to a logic state; and turning on the switch for a predefined time.
Claim 15
Independent Claim
288 words
A method for programming a semiconductor memory, the memory having: a first node; a second node; a third node; a first inverter having an input connected to the first node, and an output connected to the second node; a second inverter having a first input connected to the second node, an output connected to the first node, and a second input connected to a third node; and a switch having an input, and an output connected to the first node; the method comprising the steps of: placing a high voltage on the third node for a first predefined time, the high voltage on the third node causing a high voltage to be on the first node when the first node has a low voltage, the high voltage on the first node caused by placing the high voltage on the third node being sufficient to cause the first inverter to output a low voltage, the first predefined time being sufficient to allow the high voltage on the first node, caused by placing the high voltage on the third node, to cause the first inverter to output the low voltage and the second inverter to output a high voltage in response to the low voltage output by the first inverter; placing a voltage on the input of the switch which corresponds to a logic state to be programmed into the semiconductor memory; and turning on the switch for a second predefined time, the second predefined time being sufficient so that, after the high voltage is removed from the third node, the voltage on the input of the switch causes the first inverter to output a high voltage when the voltage on the input of the switch is a low voltage.
Claim 16
Independent Claim
288 words
A method for programming a semiconductor memory, the memory having: a first node; a second node; a third node; a first inverter having an input connected to the first node, and an output connected to the second node; a second inverter having a first input connected to the second node, an output connected to the first node, and a second input connected to a third node; and a switch having an input, and an output connected to the first node; the method comprising the steps of: placing a high voltage on the third node for a first predefined time, the high voltage on the third node causing a high voltage to be on the first node when the first node has a low voltage, the high voltage on the first node caused by placing the high voltage on the third node being sufficient to cause the first inverter to output a low voltage, the first predefined time being sufficient to allow the high voltage on the first node, caused by placing the high voltage on the third node, to cause the first inverter to output the low voltage and the second inverter to output a high voltage in response to the low voltage output by the first inverter; placing a voltage on the input of the switch which corresponds to a logic state to be programmed into the semiconductor memory; and turning on the switch for a second predefined time, the second predefined time being sufficient so that, after the high voltage is removed from the third node, the voltage on the input of the switch causes the first inverter to output a high voltage when the voltage on the input of the switch is a low voltage.
Claim 17
Dependent Claim
69 words
The method of claim 11 wherein the first predefined time is defined by a signal having a leading edge and a trailing edge, wherein the second predefined time is defined by a signal having a leading edge and a trailing edge, and wherein the trailing edge of the signal that defines the first predefined time coincides with the leading edge of the signal that defines the second predefined time.
Claim 18
Dependent Claim
37 words
The method of claim 11 wherein the voltage placed on the input of the switch is placed on the input of the switch prior to the trailing edge of the signal that defines the first predefined time.
Claim 19
Dependent Claim
69 words
The method of claim 11 wherein the second inverter includes: a p-channel transistor having a source connected to a power node, a drain connected to the first node, and a gate connected to the second node; and a n-channel transistor having a source connected to the third node, a drain connected to the drain of the p-channel transistor, and a gate connected to the gate of the p-channel transistor.
Claim 20
Dependent Claim
64 words
The method of claim 11 and further comprising the reading steps of: placing a high voltage on the input of the switch; and turning on the switch for a third predefined time, the third predefined time being sufficient to allow the high voltage on the input of the switch to fall to a low voltage when a low voltage is on the first node.
References Cited (Backward Citations)
US5003513A
Cited
US5053996A
Cited
US5386379A
Cited
US5400294A
Cited
US5583821A
Cited
US5691935A
Cited
US5633828A
Cited
US5850359A
Cited
US5764900A
Cited
US5923582A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-03-28 | 2003-09-27 | 2004-03-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-03-28 | 2007-09-27 | 2008-03-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-03-28 | 2011-09-27 | 2012-03-28 | $7700.00 | Window Closed / Lapsed |