US5619451A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for the erasure of a memory, and circuits for the implementation thereof
Assignee: STMicroelectronics SA
•
Filing: 1995-04-12
•
Granted: 1997-04-08
•
Expires: 2015-04-12
Abstract
Abstract A method for erasing a non-volatile electrically erasable and programmable integrated circuit memory that is divided into N sectors selected separately by addressing circuits and the cells for each sector being selected by row and column addressing circuits wherein an erasure pulse is applied simultaneously to all the sectors. The checking of the erasure of each sector leads to the locking of the sector when no defect is detected. A new erasure pulse is applied only to the unlocked sectors and only the unlocked sectors are rechecked. Also, a circuit for locking sectors in order to implement the method is disclosed.
Inventors
- 👤 Claude Costabello
- 👤 Jean-Marie Gaultier
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 21:33
CPC Classifications
G; G11; G11C; G11C16/00; G11C16/02; G11C16/06; G11C16/10; G11C16/14; G11C16/16
Claims Analysis
Total Claims: 27
Claim 1
Independent Claim
158 words
A method for erasing a non-volatile electrically erasable and programmable integrated circuit memory that is divided into N sectors selected separately by addressing circuits having a sector counter, wherein the N sectors are arranged in m groups of n sectors each, the cells of each sector being selected by addressing circuits for addressing by rows and columns having an address counter, wherein said method comprises the following steps: (A) erasing the cells of the memory by the simultaneous application of a pulse to at least all the sectors of a group; (B) detecting erasure of cells of the memory in each sector of the group, until one of an unerased cell and the last cell of a sector is detected; (C) locking each sector for which no unerased cell is detected; (D) determining whether all the sectors are locked; (E) applying an erasure pulse to the unlocked sectors of a next group; and (F) returning to step (B).
Claim 2
Independent Claim
158 words
A method for erasing a non-volatile electrically erasable and programmable integrated circuit memory that is divided into N sectors selected separately by addressing circuits having a sector counter, wherein the N sectors are arranged in m groups of n sectors each, the cells of each sector being selected by addressing circuits for addressing by rows and columns having an address counter, wherein said method comprises the following steps: (A) erasing the cells of the memory by the simultaneous application of a pulse to at least all the sectors of a group; (B) detecting erasure of cells of the memory in each sector of the group, until one of an unerased cell and the last cell of a sector is detected; (C) locking each sector for which no unerased cell is detected; (D) determining whether all the sectors are locked; (E) applying an erasure pulse to the unlocked sectors of a next group; and (F) returning to step (B).
Claim 3
Dependent Claim
72 words
A method according to claim 1, wherein the step (A) includes the following steps: (a) unlocking the sectors to enable erasure and determination of erasure of cells in the sectors; (b) determining whether total erasure is to be performed; (c) resetting the sector counter and the address counter inside each sector if total erasure is to be performed; (d) applying an erasure pulse to at least all the sectors of a group.
Claim 4
Dependent Claim
26 words
A method according to claim 1, wherein step (A) includes the step of simultaneously applying an erasure pulse to all the sectors of all the groups.
Claim 5
Dependent Claim
78 words
A method according claim 1, wherein the step (B) includes the following steps: (e) determining erasure of a cell at the address of the address counter; (f) Proceeding to step (C) if the cell is not erased; (g) incrementing the address of the address counter if the cell is erased; (h) determining if the address of the address counter is greater than the address of the last cell in the sector; and (i) repeating steps (e) through (i).
Claim 6
Dependent Claim
83 words
The method according to claim 1, wherein step (C) comprises the following steps: (k) locking the sector if no unerased cell is detected; (l) resetting the address counter; (m) incrementing the sector counter; (n) going to step (D) if the sector counter is greater than the last sector of the group; (o) determining whether the next sector is locked; (p) repeating steps (m) through (o) if the next sector is locked; (q) going to step (B) if the next sector is not locked.
Claim 7
Dependent Claim
48 words
A method according to claim 1, wherein step (D) includes the following steps: (r) checking whether all of the sectors are locked; (s) terminating operation if all sectors are locked; (t) resetting the address counter; (u) incrementing the sector counter to the first sector of the next group.
Claim 8
Dependent Claim
133 words
A circuit for locking a sector in a non-volatile electrically erasable and programmable integrated circuit memory that is divided into N sectors selected separately by addressing circuits having a sector counter, wherein the N sectors are arranged in m groups of n sectors each, the cells of each sector being selected by circuits for addressing by rows and columns having an address counter, the erasure of the memory being obtained by the simultaneous application of an erasure pulse to at lease all the sectors of a group, wherein said circuit comprises: a gate circuit on a circuit for supplying the erasure pulse to the sector; and a logic circuit for selectively closing and opening the gate circuit so that the sector is erased only if said sector has at least one unerased cell.
Claim 9
Dependent Claim
133 words
A circuit for locking a sector in a non-volatile electrically erasable and programmable integrated circuit memory that is divided into N sectors selected separately by addressing circuits having a sector counter, wherein the N sectors are arranged in m groups of n sectors each, the cells of each sector being selected by circuits for addressing by rows and columns having an address counter, the erasure of the memory being obtained by the simultaneous application of an erasure pulse to at lease all the sectors of a group, wherein said circuit comprises: a gate circuit on a circuit for supplying the erasure pulse to the sector; and a logic circuit for selectively closing and opening the gate circuit so that the sector is erased only if said sector has at least one unerased cell.
Claim 10
Dependent Claim
47 words
A locking circuit according to claim 7, wherein the logic circuit includes: a locking/unlocking circuit for opening the gate circuit at the start of the erasure operation; a circuit for detecting the locking of the sector; and a circuit for detecting the locking of all the sectors.
Claim 11
Dependent Claim
62 words
A locking circuit according to claim 8, wherein an erasure pulse is applied to sectors of a group, and wherein the locking/unlocking circuit includes: a group counter with m states which is activated by the erasure pulses, and a multiplexer controlled by the state signals of said group counter to select the group the sectors of which will receive the erasure pulse.
Claim 12
Dependent Claim
37 words
A locking circuit according to claim 7, wherein said gate circuit includes: a pulse control circuit for selectively applying an erasure pulse; and a lock detection circuits for inhibiting said erasure pulse if said sector is locked.
Claim 13
Dependent Claim
56 words
A locking circuit according to claim 7, further comprising: a plurality of gate circuits, each corresponding to one of said sectors; a plurality of locking/unlocking circuits, each corresponding to one of said sectors; and a lock determining circuit, connected to each of said plurality of locking/unlocking circuits, for determining whether all of said sectors are locked.
Claim 14
Dependent Claim
40 words
A locking circuit according to claim 11, further comprising a group circuit for selectively identifying a group of sectors, and wherein said locking/unlocking circuit locks said sector when said sector is not in the group identified by said group circuit.
Claim 15
Independent Claim
62 words
A method for erasing a non-volatile electrically erasable and programmable integrated circuit memory, comprising the steps of: unlocking sectors of said memory to be erased; applying an erasure pulse to said unlocked sectors; detecting cells in each sector until an unerased cell is detected; locking sectors which have no unerased cells; repeating the applying and locking steps until all sectors are locked.
Claim 16
Independent Claim
62 words
A method for erasing a non-volatile electrically erasable and programmable integrated circuit memory, comprising the steps of: unlocking sectors of said memory to be erased; applying an erasure pulse to said unlocked sectors; detecting cells in each sector until an unerased cell is detected; locking sectors which have no unerased cells; repeating the applying and locking steps until all sectors are locked.
Claim 17
Dependent Claim
33 words
The method of claim 13, wherein said unlocking step includes closing a gate on a supply circuit supplying said erasure pulse to a sector, and wherein said locking step includes opening said gate.
Claim 18
Dependent Claim
33 words
The method of claim 14, further comprising the step of determining whether all of said sectors are locked, wherein said determining step determines whether a gate for each of said sectors is open.
Claim 19
Dependent Claim
17 words
The method of claim 13, wherein said erasure pulse is simultaneously applied to all of said sectors.
Claim 20
Dependent Claim
17 words
The method of claim 13, wherein said erasure pulse is consecutively applied to groups of said sectors.
Claim 21
Dependent Claim
70 words
A erasure circuit for erasing a non-volatile electronically erasable and programmable integrated circuit memory comprising: erasure pulse means for selectively applying an erasure pulse to sectors of said memory; and erasure determining means for determining if each cell of a sector has been erased until an unerased cell is found; locking means connected to the erasure determining means for locking a sector if all cells of said sector are erased.
Claim 22
Dependent Claim
70 words
A erasure circuit for erasing a non-volatile electronically erasable and programmable integrated circuit memory comprising: erasure pulse means for selectively applying an erasure pulse to sectors of said memory; and erasure determining means for determining if each cell of a sector has been erased until an unerased cell is found; locking means connected to the erasure determining means for locking a sector if all cells of said sector are erased.
Claim 23
Dependent Claim
33 words
The erasure circuit of claim 18, further comprising: means for dividing said sectors into groups; and group application means for simultaneously applying said erasure pulse to all of the sectors in a group.
Claim 24
Dependent Claim
46 words
The erasure circuit of claim 19, wherein said group application means includes: a group counter having states for each of said groups; and a multiplexer controlled by state signals from said group counter for selecting a group of sectors to which the erasure pulse is applied.
Claim 25
Dependent Claim
31 words
The erasure circuit of claim 18, wherein said erasure pulse means includes a gate circuit, and wherein said locking means includes a control circuit for opening and closing said gate circuit.
Claim 26
Dependent Claim
21 words
The erasure circuit of claim 18, further comprising lock determining means for determining whether all sectors of said memory are locked.
Claim 27
Dependent Claim
27 words
The erasure circuit of claim 22, wherein said lock determining means includes a plurality of gates corresponding to each of said sectors connected to respective locking means.
References Cited (Backward Citations)
US5095461A
Cited
EP0392895B1
Cited
DE4119394A1
Cited
US5297096A
Cited
US5270979A
Cited
US5270980A
Cited
US5384743A
Cited
US5274599A
Cited
US5388083A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-04-07 | 2000-10-07 | 2001-04-08 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-04-07 | 2004-10-07 | 2005-04-08 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-04-07 | 2008-10-07 | 2009-04-08 | $7700.00 | Window Closed / Lapsed |