US5768191A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Methods of programming multi-state integrated circuit memory devices
Assignee: Samsung Electronics Co Ltd
•
Filing: 1996-12-06
•
Granted: 1998-06-16
•
Expires: 2016-12-06
Abstract
Abstract Methods of programming multi-state memory devices include the steps of programming a nonvolatile multi-state memory cell (e.g., EEPROM) from a reference state (e.g., erased state) towards a first program state, by applying a first program voltage (V pgm ) thereto. The first program voltage is preferably applied for a first predetermined time interval so that sufficient Fowler-Nordheim tunneling of electrons can occur into the cell's floating gate to cause a shift in the cell's threshold voltage from the reference state (e.g., Vth=-2 V) to a first program state (e.g., -1 V≦Vth≦-0.5). To verify the step of programming the memory cell into the first program state, a operation is performed by a sense amplifier to sense a first state of the memory cell, upon application of a first reference voltage thereto. Once verification of the first program state has been achieved, another programming step may be performed to program the memory cell from the first program state to a second program state, by applying a second program voltage thereto and then sensing a second state of the memory cell upon application of a second reference voltage thereto (e.g., V pref2 >V pref1 ). For example, the second program voltage (V pgm ) is preferably applied for a second predetermined time interval so that sufficient additional Fowler-Nordheim tunneling of electrons can occur into the cell's floating gate to cause a shift in the cell's threshold voltage from the first program state (e.g., Vth=-1 V) to the second program state (e.g., 0 V≦Vth≦0.5 V).
Inventors
- 👤 Young-joon Choi
- 👤 Kang-Doeg Suh
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 11:45
CPC Classifications
G; G11; G11C; G11C16/00; G11C16/02; G11C16/06; G11C11/00; G11C11/56; G11C11/5621; G11C11/5628; G11C11/5635; G11C2211/00; G11C2211/56; G11C2211/562; G11C2211/5621; G11C2211/563; G11C2211/5634
Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
212 words
A method of programming an integrated circuit memory device containing a plurality of nonvolatile multi-state memory cells therein, comprising the steps of: loading first data indicative of a desired program state into a latch: programming a nonvolatile multi-state memory cell from a reference state towards a first program state which is unequal to the reference state by applying a first program voltage to the memory cell; then sensing a first actual state of the memory cell upon application of a first reference voltage to the memory cell and changing the first data in the latch to second data if the first actual state equals the first program state; then programming the memory cell from the first program state towards a second program state which is unequal to the first program state by applying a second program voltage to the memory cell which is unequal to the first program voltage; and then sensing a second actual state of the memory cell upon application of a second reference voltage to the memory cell which is unequal to the first reference voltage and changing the second data in the latch to third data which is indicative of the reference state if the second actual state and the second program state equal the desired program state.
Claim 2
Independent Claim
212 words
A method of programming an integrated circuit memory device containing a plurality of nonvolatile multi-state memory cells therein, comprising the steps of: loading first data indicative of a desired program state into a latch: programming a nonvolatile multi-state memory cell from a reference state towards a first program state which is unequal to the reference state by applying a first program voltage to the memory cell; then sensing a first actual state of the memory cell upon application of a first reference voltage to the memory cell and changing the first data in the latch to second data if the first actual state equals the first program state; then programming the memory cell from the first program state towards a second program state which is unequal to the first program state by applying a second program voltage to the memory cell which is unequal to the first program voltage; and then sensing a second actual state of the memory cell upon application of a second reference voltage to the memory cell which is unequal to the first reference voltage and changing the second data in the latch to third data which is indicative of the reference state if the second actual state and the second program state equal the desired program state.
Claim 3
Dependent Claim
55 words
The method of claim 1, wherein said step of programming the memory cell from the first program state towards the second program state is preceded by the step of reprogramming the memory cell from the reference state to the first program state if the first actual state is not equal to the first program state.
Claim 4
Independent Claim
166 words
A method of programming a plurality of nonvolatile multi-state memory cells, comprising the steps of: loading data indicative of a first program state into a first latch; loading data indicative of a second program state that is unequal to the first program state, into a second latch; simultaneously programming first and second memory cells from a reference state to the first program state by applying a first program voltage to a word line coupled to the first and second memory cells; changing the data in the first latch from data indicative of the first program state to data indicative of the reference state; selectively programming the second memory cell but not the first memory cell from the first program state to the second program state by applying a second program voltage to the word line which is unequal to the first program voltage; and changing the data in the second latch from data indicative of the second program state to data indicative of the reference state.
Claim 5
Independent Claim
166 words
A method of programming a plurality of nonvolatile multi-state memory cells, comprising the steps of: loading data indicative of a first program state into a first latch; loading data indicative of a second program state that is unequal to the first program state, into a second latch; simultaneously programming first and second memory cells from a reference state to the first program state by applying a first program voltage to a word line coupled to the first and second memory cells; changing the data in the first latch from data indicative of the first program state to data indicative of the reference state; selectively programming the second memory cell but not the first memory cell from the first program state to the second program state by applying a second program voltage to the word line which is unequal to the first program voltage; and changing the data in the second latch from data indicative of the second program state to data indicative of the reference state.
Claim 6
Dependent Claim
54 words
The method of claim 3, wherein said step of changing the data in the first latch is preceded by the step of verifying that the first and second memory cells are in the first program state by applying a first reference voltage which is unequal to the first program voltage, to the word line.
Claim 7
Dependent Claim
52 words
The method of claim 4, wherein said step of changing the data in the second latch is preceded by the step of verifying that the second memory cell is in the second program state by applying a second reference voltage which is unequal to the second program voltage, to the word line.
Claim 8
Dependent Claim
17 words
The method of claim 5, wherein the second program voltage is greater than the first program voltage.
Claim 9
Dependent Claim
56 words
The method of claim 5, wherein the first and second latches comprise first and second two-bit latches; wherein said step of loading data indicative of a first program state comprises loading "10" into the first latch; and wherein said step of loading data indicative of a second program state comprises loading "01" into the second latch.
Claim 10
Dependent Claim
23 words
The method of claim 7, wherein said step of changing the data in the first latch comprises loading "11" into the first latch.
Claim 11
Dependent Claim
23 words
The method of claim 8, wherein said step of changing the data in the second latch comprises loading "11" into the second latch.
Claim 12
Dependent Claim
26 words
The method of claim 8, wherein said step of changing the data in the second latch follows said step of selectively programming the second memory cell.
Claim 13
Dependent Claim
28 words
The method of claim 10, wherein said step of changing the data in the second latch comprises changing the data in the second latch from "01" to "11".
Claim 14
Independent Claim
222 words
A method of programming a plurality of nonvolatile multi-state memory cells, comprising the steps of: loading data indicative of a first program state into a first latch; loading data indicative of a second program state into a second latch; loading data indicative of a third program state into a third latch; simultaneously programming first, second and third memory cells from a reference state to the first program state by applying a first program voltage to a word line coupled to the first, second and third memory cells; changing the data in the first latch from data indicative of the first program state to data indicative of the reference state; selectively programming the second and third memory cells, but not the first memory cell, from the first program state to the second program state by applying a second program voltage to the word line which is unequal to the first program voltage; changing the data in the second latch to data indicative of the reference state; selectively programming the third memory cell, but not the first or second memory cells, from the second program state to the third program state by applying a third program voltage to the word line which is unequal to the second program voltage; and changing the data in the third latch to data indicative of the reference state.
Claim 15
Independent Claim
222 words
A method of programming a plurality of nonvolatile multi-state memory cells, comprising the steps of: loading data indicative of a first program state into a first latch; loading data indicative of a second program state into a second latch; loading data indicative of a third program state into a third latch; simultaneously programming first, second and third memory cells from a reference state to the first program state by applying a first program voltage to a word line coupled to the first, second and third memory cells; changing the data in the first latch from data indicative of the first program state to data indicative of the reference state; selectively programming the second and third memory cells, but not the first memory cell, from the first program state to the second program state by applying a second program voltage to the word line which is unequal to the first program voltage; changing the data in the second latch to data indicative of the reference state; selectively programming the third memory cell, but not the first or second memory cells, from the second program state to the third program state by applying a third program voltage to the word line which is unequal to the second program voltage; and changing the data in the third latch to data indicative of the reference state.
Claim 16
Dependent Claim
55 words
The method of claim 12, wherein said step of changing the data in the first latch is preceded by the step of verifying that the first, second and third memory cells are in the first program state by applying a first reference voltage which is unequal to the first program voltage, to the word line.
Claim 17
Dependent Claim
54 words
The method of claim 13, wherein said step of changing the data in the second latch is preceded by the step of verifying that the second and third memory cells are in the second program state by applying a second reference voltage which is unequal to the second program voltage, to the word line.
Claim 18
Dependent Claim
77 words
The method of claim 14, wherein the first, second and third latches comprise first, second and third two-bit latches; wherein said step of loading data indicative of a first program state comprises loading "10" into the first latch; wherein said step of loading data indicative of a second program state comprises loading "01" into the second latch; and wherein said step of loading data indicative of a third program state comprises loading "00" into the third latch.
Claim 19
Dependent Claim
23 words
The method of claim 15, wherein said step of changing the data in the first latch comprises loading "11" into the first latch.
Claim 20
Dependent Claim
52 words
The method of claim 16, wherein said step of changing the data in the second latch comprises changing the data in the second latch from "01" to "11"; and wherein said step of changing the data in the third latch comprises changing the data in the third latch from "00" to "11".
References Cited (Backward Citations)
US5583812A
Cited
US5163021A
Cited
US5394362A
Cited
US5450341A
Cited
US5566125A
Cited
US5546042A
Cited
US5523972A
Cited
US5539690A
Cited
US5541886A
Cited
US5566111A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-06-15 | 2001-12-15 | 2002-06-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-06-15 | 2005-12-15 | 2006-06-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-06-15 | 2009-12-15 | 2010-06-16 | $7700.00 | Window Closed / Lapsed |