Erasing method for a non-volatile memory

Abstract: The invention relates to a method of erasing an electrically programmable non-volatile memory device constructed as a multi-sector matrix memory and being of the type with an erase algorithm integrated into the device. The method comprises the following steps: erasing some or all of the matrix sectors in parallel; subsequently reading and checking each erased sector; storing the address of a sector being checked when the issue of a check is unfavorable; carrying out a fresh parallel erasing step; and starting a new reading/checking step from the sector that has checked unfavorably.

Description: Field of the Invention The present invention relates to a method of erasing an electrically programmable non-volatile memory device constructed as a matrix memory with multiple sectors and having an erase algorithm integrated into the device. In particular, but not exclusively, the invention concerns a method of erasing a flash memory constructed as a multi-sector matrix memory, and the description will cover such an application for convenience of illustration. The invention also relates to an electrically programmable/erasable non-volatile memory device constructed as a multi-sector matrix memory and having an integrated resident erase algorithm. As the skilled ones in the art will readily recognize, in non-volatile memory devices which are integrated on a semiconductor and can be electrically programmed --specifically of the flash type -- the erase operation either affects the matrix as a whole or just some of its sectors. Background Art A first known solution to the problem of erasing a flash memory provides an erase procedure which can be regarded as serial. Figure 1 of the accompanying drawings shows an erase algorithm of the serial type for carrying out this first procedure. The algorithm will be described herein below with the references used in the flow chart blocks of Figure 1 put in brackets. According to this procedure, at the end (ENDPULSE?) of the erase phase (ERASE) of a given sector, a checking cycle is initiated which involves reading (READ) the data stored in that sector of the memory. The reading is useful to check that each word has been erased from the memory. If the read/check phase comes out right (READ OK?=1), i.e. if a given memory word is actually erased, an address (INC_ADDR) is increased to read the next memory word to be checked. If that phase comes out wrong (READ OK?=0), the procedure reverts to erasing (ERASE) the whole sector. The checking cycle is terminated when the last memory word (LASTADD?=1) of the sector is read. The erase/check phase is performed sequentially for all the sectors by increasing the sector address (INC_SECT), up to the last sector (LASTSECT?) in the matrix. Such a procedure clearly involves very long erasing times. It has been considered of recent that a flash memory could be erased more efficiently in three basic steps: 1) a pre-programming step, to be carried out for each memory word or byte; 2) an erasing step proper, which affects a whole sector or several sectors in parallel and is carried out by an application of erase pulses; and 3) a sector checking step, carried out on each byte. The erase pulses may be applied in parallel, i.e. simultaneously, even to all of the matrix sectors. The first and third steps are instead carried out individually on each sector. The state of the art already provides a method of parallel erasing, which will be explained herein below by means of a second algorithm, shown in Figure 2. Following a step of parallel erasing (PAR_ERASE) of some or all of the matrix sectors, the erase pulse is checked for its end (ENDPULSE?=1). At this stage, a counter is reset (RES_CONT) and the procedure goes over to the read (READ)/check (READ OK?) step, to be carried out for each byte. If the checking of a given word comes out right (READ OK?=1), the procedure moves to increasing the memory word address (INC_ADDR), up to the last word (LASTADD?) in that sector. On completion of the checking of one sector (LASTADD?=1), the procedure moves to increasing the sector address (INC_SECT) by resetting a flag (RES_FLAG). On the other hand, if the checking comes out wrong (READ OK?=0), the sector address is increased (INC_SECT) at once, and if the sector is other than the last sector for checking (LASTSECT?=0), the counter is reset (RES_CONT) again. When the sector under examination is the last sector to be checked (LASTSECT?=1), a final test is performed to make sure that all the sectors have been erased (ALLERASED?). Thus the procedure can be terminated (END). If not (ALLERASE?=0), the algorithm continues through a fresh erase step (PAR_ERASE). While the above method can provide for the erasing of several sectors in parallel, it has a serious limitation in that, when the checking step does not come out right, it may become necessary to go once again through the checking of all the sectors that have just been erased, because the counter has been reset (RES_CONT). For example, a fresh check may be requested while the check being run is approaching its end; in this case, the checking step would also have to be carried out from the very beginning. There exists a need in this field for a shortened erasing time, which time may total some ten seconds for a whole matrix. A further method of evasing is known from document EP-A-0 678 875. This document represents the basis for the preamble of claim 1. To gain a better idea of the times involved in the erasing of a flash memory, one should consider that the first pre-programming step requires some six seconds; erasing itself may consume as much as one second, and takes longer with the ageing of the memory device; the checking step requires approximately 100 ms. Thus, the erasing time proper usually is dominant; however, with the parallel erase method just described, most of the erasing time may be taken up by the checking step. The underlying technical problem of this invention is to provide an erasing method which can utilize the parallel erasing of several sectors, and at the same time prevent the checking step from prevailing over the erasing proper. This would allow the limitations and drawbacks of the prior art solutions to be overcome. Summary of the Invention The solution idea on which this invention stands is one of storing the address of a sector being checked at the time when an incorrect erasure of a memory word in that sector is detected. The fresh checking step that follows a fresh erase pulse would then start with the sector in question. Based on this solution idea, the technical problem is solved by a method as previously indicated and as defined in the characterizing portion of Claim 1 foll. appended hereto. The technical problem is also solved by a memory device as previously indicated and as defined in Claim 9. The features and advantages of the method according to this invention will be apparent from the following detailed description of an embodiment thereof, given by a way of non-limitative example with reference to the accompanying drawings. Brief Description of the Drawings Figure 1 is a diagram of an algorithm implementing a prior art serial erasing method. Figure 2 is a diagram of an algorithm implementing a prior art parallel erasing method. Figure 3 is a diagram of an algorithm implementing the erasing method of this invention. Detailed Description A description of Figures 1 and 2 has already been provided in the introductory paragraphs of this application, and will not be repeated to avoid overburdening the discussion of this invention. Referring in particular to the example shown in Figure 3, the multi-sector parallel erasing method according to the present invention will be described. The inventive method is particularly, but not exclusively, intended for an electrically programmable/erasable non-volatile memory device which is constructed as a multi-sector matrix memory and includes an integrated resident erase algorithm. The algorithm that implements the method of this invention starts with a parallel erasing step which may affect several of the matrix memory sectors. After this parallel erasing (PAR_ERASE) of some or all of the matrix sectors, the erase pulse is checked for its end (ENDPULSE?). At this stage (ENDPULSE?=1), the algorithm moves to the reading (READ)/checking (READ OK?) step, to be carried out per byte. If a given words checks out right (READ OK?=1), the algorithm moves to increasing the address (INC_ADDR) of the memory word, up to the last word (LASTADD?) of that sector. Once the checking of one sector is completed (LASTADD?=1), the algorithm moves to increasing the sector address (INC_SECT) by resetting a flag (RES_FLAG). Advantageously, according to the invention, if a check comes out wrong (READ OK?=0), that is if the erasing has been ineffectual on a given word, the address of the memory sector in question is stored (STORE ADDR). This is effected into a small-size read/write RAM, not shown because conventional. Instead of storing the sector address, it would be possible to store the first eight bits corresponding to the column address. This storing step precedes a sector address increase (INC_SECT), which is followed by the loading (LOAD ADDR) of the address of the sector that has checked out wrong, from said read/write memory. In essence, when arrived at the last sector the checking step reveals that a given memory word in a given sector has been erased improperly, a fresh erasing/checking step is carried out starting with that sector rather than from the beginning of the previous checking phase. After the address loading step (LOAD ADDR), a test is run to verify if the sector under examination wasn't the last sector to be checked (LASTSECT?=0); in the negative answer, the read/check procedure is resumed. If the sector under examination is really the last to be checked (LASTSECT?=1), a final test is run to make sure that all the sectors have been erased (ALLERASED?=1). If so, the procedure can be terminated (END); otherwise the algorithm moves to a fresh erasing step (PAR_ERASE). The erasing procedure according to this invention is a specially efficient one in that it allows several memory sectors to be erased in parallel and the checking procedure to be only re-run for those sectors that have checked out wrong. It can be shown, by a simulation and plots of probabilistic distribution, that the inventive method allows the erasing step to be carried out in far less time than the prior art methods. By way of example only, the time required to check one memory word or byte may be on the order of 1 ms. Assuming that half a sector of 32 kilobytes is to be checked, the checking step would take 32 ms. Where 100 erase pulses are required, the total time involved in the checking operations would amount to no more than 3.2 seconds. Changes and modifications may be made unto the method of this invention as defined by the scope of the following claims.

Claims: A method of erasing an electrically programmable non-volatile memory device constructed as a matrix memory with multiple sectors and having an erase algorithm integrated into the device, said method comprising: a step of parallel erasing (PAR_ERASE) some or all of the matrix sectors; and a subsequent step of reading (READ) and checking (READ OK?) each erased sector; characterized in that it further comprises the steps of: storing (STORE ADDR) the address of a sector being checked when the issue of the check is unfavorable; carrying out a fresh parallel erasing step (PAR_ERASE); and starting a new reading/checking step from said sector that has checked unfavorably. A method according to Claim 1, characterized in that said device is a flash memory. A method according to Claim 1, characterized in that the reading/checking step is applied to each word in said matrix sector. A method according to Claim 1, wherein the end of the reading/checking step provides for subsequently increasing the address of the sector to be checked, and wherein that said storing step is carried out before said address increase. A method according to Claim 1, wherein the end of the reading/checking step provides for subsequently increasing the address of the sector to be checked, and wherein said end provides for loading the address of said sector being checked after said address increase. A method according to Claim 1, characterized in that, on completion of a sector checking (LASTADD?=1), a flag is reset (RES_FLAG) to have the sector address (INC_SECT) increased. A method according to Claim 5, characterized in that a test (LASTSECT?) is performed, after the address loading step (LOAD ADDR), to verify whether the sector in question was the last sector to be checked: if not, the read/check step is resumed. A method according to Claim 1, characterized in that said storing step is carried out into a read/write memory.

Inventors: BETTINI LUIGI, DEFENDI MARCO, VILLA CORRADO, BETTINI, LUIGI, DEFENDI, MARCO, VILLA, CORRADO
Applicants: ST MICROELECTRONICS SRL, STMICROELECTRONICS S.R.L.
Application year: 1995
Main classification: G11C11
IPC codes: G11C16