Erasing programming verification method, erasing programming verification system and memory

By performing time-sharing on the timeline, using the synchronization mechanism of overlapping timings, the problem of low memory verification efficiency is solved, and a faster verification process is achieved.

CN115064203BActive Publication Date: 2024-11-12WUHAN XINXIN SEMICON MFG CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202210768551.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-06-30
Publication Date
2024-11-12
Estimated Expiration
2042-06-30

AI Technical Summary

Technical Problem

Existing memory needs a long time to verify after erasing and programming, resulting in inefficient verification.

Method used

By performing time-sharing reading operations and verification operations on the timeline, read and verification operations are performed simultaneously in the overlapping time period of the first and second timings, including read operations sub-items and latch operations sub-items, using the overlapping time period of the first and second timings, , and compare and write operations sub-items to ensure the efficiency of verification is improved.

Benefits of technology

The time required to verify whether the rewritten action is completed is reduced, the verification efficiency is improved, and the verification process of the memory is more efficient.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115064203B_ABST
    Figure CN115064203B_ABST
Patent Text Reader

Abstract

The present application discloses an erase programming verification method, an erase programming verification system and a memory. The erase programming verification method executes multiple read operation items in a time-sharing manner based on a first timing sequence, and executes multiple verification operation items in a time-sharing manner based on a second timing sequence. In addition, by synchronously or simultaneously executing the read operation items and the verification operation items in the overlapping time period of the first timing sequence and the second timing sequence on the time axis, compared with only executing the read operation items or the verification operation items in the same time period, the time required for verifying whether the erase operation is completed is saved or reduced, thereby improving the verification efficiency.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of storage technology, and in particular to an erase programming verification method, an erase programming verification system and a memory. Background Art

[0002] In order to ensure the correctness of data, the memory needs to verify whether the internal data has completed the corresponding erasing and programming actions after erasing and / or programming. However, it usually takes a long time to verify whether the erasing and programming actions are completed. Summary of the invention

[0003] The present application provides an erase programming verification method, an erase programming verification system and a memory, so as to reduce the technical problem that it takes a long time to verify whether the erase operation is completed.

[0004] In a first aspect, the present application provides an erase programming verification method, which includes: executing multiple read operation items in a time-sharing manner based on a first timing; executing multiple verification operation items in a time-sharing manner based on a second timing, the second timing lags behind the first timing, and the verification operation items are different from the read operation items; and in response to the overlap of the first timing and the second timing on the time axis, synchronously executing the read operation items and the verification operation items.

[0005] In some embodiments, the erase programming verification method also includes: executing a first read operation item based on a first timing; based on the first timing and the second timing, synchronously and cyclically executing the N+1th read operation item and the Nth verification operation item, the Nth verification operation item being a subsequent operation item of the Nth read operation item, wherein N is an integer greater than or equal to 0; and executing the last verification operation item based on the second timing.

[0006] In some implementation modes, the erase programming verification method further includes: configuring each read operation item to include a read operation sub-item and a latch operation sub-item; and sequentially executing the read operation sub-item and the latch operation sub-item according to a first timing sequence.

[0007] In some of the embodiments, the erase programming verification method further includes: configuring each verification operation item to include at least one comparison operation sub-item; and sequentially executing the at least one comparison operation sub-item according to a second timing sequence.

[0008] In some of the embodiments, the erase programming verification method also includes: configuring each comparison operation sub-item to compare whether the latch object of the latch operation sub-item is consistent with 1; if the latch object of the latch operation sub-item is consistent with 1, the storage unit read by the read operation sub-item has passed the erase verification.

[0009] In some of the embodiments, the erase programming verification method further includes: configuring each verification operation item to include at least one write operation sub-item; and sequentially executing the at least one write operation sub-item according to a second timing sequence.

[0010] In some of the embodiments, the erase programming verification method also includes: configuring the Mth write operation sub-item to store the comparison result of the Mth comparison operation sub-item, where M is an integer greater than or equal to 0; configuring the M+1th write operation sub-item to store the comparison result of the M+1th comparison operation sub-item; and sequentially executing the Mth comparison operation sub-item, the Mth write operation sub-item, the M+1th comparison operation sub-item and the M+1th write operation sub-item according to the second timing.

[0011] In some of the embodiments, the erase programming verification method also includes: configuring the Mth write operation sub-item to store the comparison result of the Mth comparison operation sub-item; configuring the M+1th write operation sub-item to store the comparison result of the M+1th comparison operation sub-item; executing the first comparison operation sub-item according to the second timing; synchronously and cyclically executing the M+1th comparison operation sub-item and the Mth write operation sub-item according to the second timing; and executing the last write operation sub-item according to the second timing.

[0012] In some of the embodiments, the erase programming verification method also includes: configuring each comparison operation sub-item to compare the latch object of the latch operation sub-item and whether the data to be programmed corresponding to the latch object is consistent; if not consistent, the comparison result of the comparison operation sub-item is 0; if consistent, the comparison result of the comparison operation sub-item is 1.

[0013] In some of the embodiments, the erase programming verification method further includes: configuring each write operation sub-item to temporarily store the comparison result of the corresponding comparison operation sub-item; if the comparison results of all comparison operation sub-items are 1, the storage unit read by the read operation sub-item has passed the programming verification.

[0014] In some implementation modes, the erase programming verification method further includes: configuring a read operation item as a read operation item; configuring a verification operation item as a verification operation item.

[0015] In a second aspect, the present application provides an erasure programming verification system, which executes the erasure programming verification method in at least one of the above-mentioned embodiments during operation.

[0016] In some embodiments, the erase program verification system includes a latch, and the latch is used to cache the execution results of multiple read operation items.

[0017] In a third aspect, the present application provides a memory, which includes the erasure programming verification system in at least one of the above-mentioned embodiments.

[0018] The erase programming verification method, erase programming verification system and memory provided by the present application save or reduce the time required to verify whether the erase and write operation is completed, compared with only executing the read operation or the verification operation in the same time period of the first timing sequence and the second timing sequence on the time axis, thereby improving the verification efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] The technical solution and other beneficial effects of the present application will be made apparent by describing in detail the specific implementation methods of the present application in conjunction with the accompanying drawings.

[0020] Figure 1 A flowchart of an erase program verification method provided in an embodiment of the present application.

[0021] Figure 2 A schematic diagram of the erase verification process of the erase programming verification method provided in an embodiment of the present application.

[0022] Figure 3 A schematic diagram of the first programming verification process of the erase programming verification method provided in an embodiment of the present application.

[0023] Figure 4 A schematic diagram of a second programming verification process of the erase programming verification method provided in an embodiment of the present application. DETAILED DESCRIPTION

[0024] The technical solutions in the embodiments of the present application will be described clearly and completely below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, rather than all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present application.

[0025] This embodiment provides an erase program verification method. Figures 1 to 4 ,like Figure 1 As shown, the erase programming verification method includes the following steps:

[0026] Step S10: Execute a plurality of read operations in a time-sharing manner based on the first timing sequence.

[0027] Among them, the first time sequence is as follows Figures 2 to 4The first read data, latching the first read data, the second read data, latching the second read data... the Nth read data, latching the Nth read data are executed in the timing sequence. Each read operation item includes a read operation sub-item and a latch operation sub-item. The read operation sub-item can be, for example Figures 2 to 4 The first read data, the second read data, ... the Nth read data, etc. shown in FIG. , the latch operation sub-item may be, for example, Figures 2 to 4 As shown in FIG. , the first read data is latched, the second read data is latched, ... the Nth read data is latched, etc. Wherein, N may be a positive integer.

[0028] Step S20: performing multiple verification operations in a time-sharing manner based on the second timing sequence, wherein the second timing sequence lags behind the first timing sequence, and the verification operations are different from the reading operations.

[0029] The second timing can be as follows: Figure 2 The comparison timing of the first reading of data, the second reading of data...the Nth reading of data may be performed in sequence, or may be firstly comparing the first batch of the first reading of data, writing the comparison result of the first batch of the first reading of data into the temporary register, comparing the second batch of the first reading of data, writing the comparison result of the second batch of the first reading of data into the temporary register...comparing the Mth batch of the first reading of data, writing the comparison result of the Mth batch of the first reading of data into the temporary register, then comparing the first batch of the second reading of data, writing the comparison result of the first batch of the second reading of data into the temporary register, and then comparing the second batch of the second reading of data, writing the comparison result of the first batch of the second reading of data into the temporary register, and then comparing the second batch of the second reading of data, writing the comparison result of the first batch of the second reading of data into the temporary register, and then comparing the second batch of the first reading of data, writing the comparison result of the second batch of the second reading of data into the temporary register, and then comparing the first batch of the second reading of data, writing the comparison result of the first batch of the second reading of data into the temporary register, and then comparing the second batch of the first reading of data, writing the comparison result of the second batch of the first ... Compare the second batch of the second read data, write the comparison result of the second batch of the second read data into the register...compare the Mth batch of the second read data, write the comparison result of the Mth batch of the second read data into the register...finally compare the first batch of the Nth read data, write the comparison result of the first batch of the Nth read data into the register, compare the second batch of the Nth read data, write the comparison result of the second batch of the Nth read data into the register...compare the Mth batch of the Nth read data, write the comparison result of the Mth batch of the Nth read data into the register. Among them, Figure 3 It is shown that during the process of reading data this time, the data read last time is also compared in batches and the results of the batch comparison are written into the temporary register; Figure 3 The difference is, Figure 4 In the above, the batch comparison results are written while the last read data is being compared in batches. In summary, the first time series and the second time series are both performed along the time axis, the difference being that the starting point of the first time series is earlier than the starting point of the second time series, and the end point of the first time series is earlier than the end point of the second time series.

[0030] It should be noted that the above N and M may be the same or different, and are not specifically limited here. Wherein, M is an integer greater than or equal to 0.

[0031] Each verification operation may include: Figure 2 The first batch of the data read for the first time is compared, the second batch of the data read for the first time is compared, ... the Mth batch of the data read for the first time is compared, and / or each verification operation item may include Figure 2 The first batch of the second read data is compared in the comparison, the second batch of the second read data is compared in the comparison...the Mth batch of the second read data is compared, and / or each verification operation item may include Figure 2 The first batch of the data read for the Nth time is compared, the second batch of the data read for the Nth time is compared, and the Mth batch of the data read for the Nth time is compared.

[0032] In some embodiments, each verification operation item may include Figure 3 or Figure 4 The comparison of the first batch of the first read data, writing the comparison result of the first batch of the first read data to the temporary register, comparing the second batch of the first read data, writing the comparison result of the second batch of the first read data to the temporary register... comparing the Mth batch of the first read data, writing the comparison result of the Mth batch of the first read data to the temporary register, and / or each verification operation item may include Figure 3 or Figure 4 The comparison operation items may include: comparing the first batch of the second read data, writing the comparison result of the first batch of the second read data to the temporary register, comparing the second batch of the second read data, writing the comparison result of the second batch of the second read data to the temporary register... comparing the Mth batch of the second read data, writing the comparison result of the Mth batch of the second read data to the temporary register, and / or, each verification operation item may include Figure 3 or Figure 4 Compare the first batch of the Nth read data, write the comparison result of the first batch of the Nth read data to the register, compare the second batch of the Nth read data, write the comparison result of the second batch of the Nth read data to the register...compare the Mth batch of the Nth read data, write the comparison result of the Mth batch of the Nth read data to the register.

[0033] It should be noted that in order to reduce Figures 2 to 4 Abbreviations are used for relevant expressions in, for example, the real meaning of "compare the first batch" is to compare the first batch of data read for the first time, and the same can be said for others; the real meaning of "write the first batch results to the register" is to write the comparison results of the first batch of data read for the first time to the register.

[0034] Among them, the first and second batches in this application can be continuous in order, or two independent objects that are unrelated in order, and the same applies to the others. Similarly, the first and second batches in this application can be continuous in order, or two independent objects that are unrelated in order, and the same applies to the others.

[0035] And step S30: in response to the overlap of the first timing sequence and the second timing sequence on the time axis, synchronously executing the reading operation item and the verification operation item.

[0036] It can be understood that the erase programming verification method provided in this embodiment saves or reduces the time required to verify whether the erase and write operation is completed, compared to executing only the read operation or the verification operation in the same time period of the first timing sequence and the second timing sequence on the time axis, thereby improving the verification efficiency.

[0037] In one embodiment, the erase programming verification method also includes: executing a first read operation item based on a first timing sequence; based on the first timing sequence and the second timing sequence, synchronously and cyclically executing the N+1th read operation item and the Nth verification operation item, the Nth verification operation item being a subsequent operation item of the Nth read operation item, wherein N is an integer greater than or equal to 0; and executing the last verification operation item based on the second timing sequence.

[0038] It should be noted that the multiple read operation items may include the first read operation item, at least one intermediate read operation item, and the last read operation item; similarly, the multiple verification operation items may also include the first verification operation item, at least one intermediate verification operation item, and the last verification operation item. Among them, the first read operation item is executed separately at the earliest time sequence, followed by the second read operation item and the first verification operation item, and then the third read operation item and the second verification operation item are executed simultaneously, and so on, and then the N+1th read operation item and the Nth verification operation item are executed simultaneously, and the N+1th verification operation item is executed separately at the end.

[0039] In one embodiment, if Figures 2 to 4 As shown, the erase programming verification method further includes: executing the read operation sub-item and the latch operation sub-item in sequence according to the first timing sequence. For example, after the first read data is executed, the first read data is latched, and then after the second read data is executed, the second read data is latched... and then after the Nth read data is executed, the Nth read data is latched.

[0040] In one of the embodiments, the erase programming verification method further includes: configuring each verification operation item to include at least one comparison operation sub-item; and sequentially executing the at least one comparison operation sub-item according to a second timing sequence.

[0041] It should be noted that each comparison operation sub-item can be Figures 2 to 4 One of the "compare the first batch to the first time", "compare the first batch to the second time" or "compare the first batch to the Mth time" shown in , can also be Figures 2 to 4 One of the "compare the second first batch", "compare the second second batch" or "compare the second M batch" shown in , can also be Figures 2 to 4 One of the "compare the first batch for the Nth time", "compare the second batch for the Nth time" or "compare the Mth batch for the Nth time" shown in the figure, etc. Among them, the execution order of "compare the first batch for the first time" to "compare the Mth batch for the Nth time" can be performed successively.

[0042] Among them, a single read data, such as the first read data, the second read data or the Nth read data, can also be completed through one or more comparisons. The length of the data read each time can be an integer multiple of bytes, for example, one byte, two bytes, three bytes, four bytes, or more bytes, etc., so that data operations can be performed more flexibly, especially after temporarily storing the data to be stored in the temporary register through a write command, the data to be stored in the temporary register can be programmed in units of single bits.

[0043] In one of the embodiments, the erase programming verification method also includes: configuring each comparison operation sub-item to compare whether the latch object of the latch operation sub-item is consistent with 1; if the latch object of the latch operation sub-item is consistent with 1, the storage unit read by the read operation sub-item has passed the erase verification.

[0044] It should be noted that this embodiment is a verification of the erase operation, and the latch object is the latched read data, for example Figure 2 The first read data, the second read data, ... the Nth read data, etc. The latch operation sub-item is a latch operation performed on one or more of the first read data, the second read data, ... the Nth read data, etc.

[0045] In one of the embodiments, the erase programming verification method further includes: configuring each verification operation item to include at least one write operation sub-item; and executing the at least one write operation sub-item in sequence according to the second timing.

[0046] It should be noted that during the programming verification process, the comparison result of each comparison operation sub-item needs to be stored or temporarily stored in the register, so as to check the completion status of the programming operation later. In addition, during the programming verification process, each comparison operation sub-item needs to compare the stored data in the storage array or storage unit via the register with the temporary data corresponding to the stored data in the register, so as to determine whether the inspection is passed or completed according to the comparison result. The specific comparison process of the programming verification will be described in detail in the subsequent embodiments.

[0047] In one of the embodiments, the erase programming verification method also includes: configuring each comparison operation sub-item to compare the latch object of the latch operation sub-item and whether the data to be programmed corresponding to the latch object is consistent; if not consistent, the comparison result of the comparison operation sub-item is 0; if consistent, the comparison result of the comparison operation sub-item is 1.

[0048] It should be noted that, in this embodiment, if the latch object of the latch operation sub-item is 1 and the data to be programmed corresponding to the latch object is 1, then the comparison result of the corresponding comparison operation sub-item is 1, and the storage result of the comparison result in the temporary register is also 1. If the latch object of the latch operation sub-item is 0 and the data to be programmed corresponding to the latch object is 0, then the comparison result of the corresponding comparison operation sub-item is 1, and the storage result of the comparison result in the temporary register is also 1.

[0049] In one embodiment, if Figure 3 As shown, the erase programming verification method also includes: configuring the Mth write operation sub-item to store the comparison result of the Mth comparison operation sub-item; configuring the M+1th write operation sub-item to store the comparison result of the M+1th comparison operation sub-item; and sequentially executing the Mth comparison operation sub-item, the Mth write operation sub-item, the M+1th comparison operation sub-item and the M+1th write operation sub-item according to the second timing.

[0050] It should be noted that, in this embodiment, each comparison result is written into the write operation, and then the next comparison operation sub-item is performed, so as to store or temporarily store each comparison result in time.

[0051] In one embodiment, if Figure 4 As shown, the erase programming verification method also includes: configuring the Mth write operation sub-item to store the comparison result of the Mth comparison operation sub-item; configuring the M+1th write operation sub-item to store the comparison result of the M+1th comparison operation sub-item; executing the first comparison operation sub-item according to the second timing; synchronously and cyclically executing the M+1th comparison operation sub-item and the Mth write operation sub-item according to the second timing; and executing the last write operation sub-item according to the second timing.

[0052] It should be noted that in this embodiment, the M+1th comparison operation sub-item and the Mth write operation sub-item are synchronously executed cyclically, for example, while comparing the second batch in the first read data, the comparison result of the first batch in the first read data is written to the register; and / or, while comparing the second batch in the second read data, the comparison result of the first batch in the second read data is written to the register; and / or, while comparing the second batch in the Nth read data, the comparison result of the first batch in the Nth read data is written to the register, and so on. It can be understood that this can further save the execution time of the verification operation items, and thus can further improve the verification efficiency of the memory.

[0053] In one of the embodiments, the erase programming verification method further includes: configuring each write operation sub-item to temporarily store the comparison result of the corresponding comparison operation sub-item; if the comparison results of all comparison operation sub-items are 1, the storage unit read by the read operation sub-item has passed the programming verification.

[0054] It should be noted that the comparison results of at least one comparison operation sub-item are temporarily stored in the temporary register. When the comparison results in the temporary register are all 1, it means that the verification of the programming has passed or been completed.

[0055] In one of the embodiments, the erase programming verification method also includes: if the comparison result of the comparison operation sub-item is 0, the storage unit read by the read operation sub-item needs to be programmed; if the comparison result of the comparison operation sub-item is 1, the storage unit read by the read operation sub-item does not need to be programmed.

[0056] It should be noted that this embodiment describes the conditions for performing a programming operation, based on which it can be determined whether a programming operation is required.

[0057] In one embodiment, the erase programming verification method further includes: configuring the read operation item as a read operation item; configuring the verification operation item as a verification operation item. It should be noted that this embodiment divides the erase programming verification process into two operation items, namely, the read operation item and the verification operation item, and the read operation item and the verification operation item respectively include one or more different operation sub-items, and the specific operation sub-items can refer to the introduction in other embodiments.

[0058] In one of the embodiments, the present embodiment provides an erasure programming verification system, which executes the erasure programming verification method in at least one of the above embodiments during operation.

[0059] It can be understood that the erase programming verification system provided in this embodiment saves or reduces the time required to verify whether the erase and write operation is completed, compared to executing only the read operation or the verification operation in the same time period of the first timing sequence and the second timing sequence on the time axis, thereby improving the verification efficiency.

[0060] In one embodiment, the erase program verification system includes a latch, and the latch is used to cache the execution results of multiple read operation items.

[0061] It is understandable that conventional erasing and verification operations are difficult to implement pipeline operations. Since this embodiment adds a latch to latch the read information in the latch, it enables seamless connection between the reading operation items and the verification operation items, promotes the implementation of pipeline operations, and can effectively improve the verification efficiency.

[0062] In one of the embodiments, the present embodiment provides a memory, which includes the erasure programming verification system in at least one of the above embodiments.

[0063] It can be understood that the memory provided in this embodiment saves or reduces the time required to verify whether the erase and write operations are completed, by synchronously or simultaneously executing the read operation items and the verification operation items in the overlapping time period of the first timing sequence and the second timing sequence on the time axis, compared with only executing the read operation items or the verification operation items in the same time, thereby improving the verification efficiency.

[0064] It should be noted that the memory of this embodiment may be a memory chip, such as Nor Flash, and may also be other types of memory chips to which the erasure programming verification technology provided by this application is applicable.

[0065] In the above embodiments, the description of each embodiment has its own emphasis. For parts that are not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0066] The above is a detailed introduction to the erase programming verification method, erase programming verification system and memory provided in the embodiments of the present application. Specific examples are used in this article to illustrate the principles and implementation methods of the present application. The description of the above embodiments is only used to help understand the technical solution and its core idea of ​​the present application. Ordinary technicians in this field should understand that they can still modify the technical solutions recorded in the aforementioned embodiments, or replace some of the technical features therein with equivalents; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the scope of the technical solutions of the embodiments of the present application.

Claims

1. An erase programming verification method, characterized in that: include: Execute multiple read operations in a time-sharing manner based on the first timing sequence; executing a plurality of verification operation items in a time-sharing manner based on a second timing sequence, wherein the second timing sequence lags behind the first timing sequence, and the verification operation items are different from the read operation items; as well as In response to the overlap of the first timing sequence and the second timing sequence on the time axis, synchronously executing the read operation item and the verify operation item; Configuring each of the verification operation items to include at least one comparison operation sub-item; Execute the at least one comparison operation sub-item in sequence according to the second timing sequence; Configuring each of the verification operation items to further include at least one write operation sub-item; The at least one write operation sub-item is executed sequentially according to the second timing.

2. The erase program verification method according to claim 1, characterized in that: The erase program verification method further comprises: Execute a first read operation based on the first timing; Based on the first timing sequence and the second timing sequence, synchronously and cyclically execute the N+1th read operation item and the Nth verification operation item, wherein the Nth verification operation item is a subsequent operation item of the Nth read operation item, wherein N is an integer greater than or equal to 0; and A last verification operation item is performed based on the second timing.

3. The erase program verification method according to claim 1, characterized in that: The erase program verification method further comprises: Configuring each of the read operation items to include a read operation sub-item and a latch operation sub-item; The read operation sub-item and the latch operation sub-item are executed sequentially according to the first timing.

4. The erase program verification method according to claim 3, characterized in that: The erase program verification method further comprises: Configuring each of the comparison operation sub-items to compare whether the latch object of the latch operation sub-item is consistent with 1; If the latch object of the latch operation sub-item is consistent with 1, the storage unit read by the read operation sub-item has passed the erase verification.

5. The erase program verification method according to claim 1, characterized in that: The erase program verification method further comprises: The Mth write operation sub-item is configured to store the comparison result of the Mth comparison operation sub-item, where M is an integer greater than or equal to 0; The M+1th write operation sub-item is configured to store the comparison result of the M+1th comparison operation sub-item; The Mth comparison operation sub-item, the Mth write operation sub-item, the M+1th comparison operation sub-item and the M+1th write operation sub-item are executed in sequence according to the second timing.

6. The erase program verification method according to claim 1, characterized in that: The erase program verification method further comprises: The Mth write operation sub-item is configured to store the comparison result of the Mth comparison operation sub-item; The M+1th write operation sub-item is configured to store the comparison result of the M+1th comparison operation sub-item; Execute the first comparison operation sub-item according to the second timing sequence; Execute the M+1th comparison operation sub-item and the Mth write operation sub-item according to the second timing synchronization cycle; and The last write operation sub-item is executed according to the second timing.

7. The erase program verification method according to claim 1, characterized in that: The erase program verification method further comprises: Configuring each of the comparison operation sub-items to compare the latch object of the latch operation sub-item and whether the data to be programmed corresponding to the latch object is consistent; If they are not consistent, the comparison result of the comparison operation sub-item is 0; If they are consistent, the comparison result of the comparison operation sub-item is 1.

8. The erase program verification method according to claim 7, characterized in that: The erase program verification method further comprises: Configuring each of the write operation sub-items to temporarily store the comparison result corresponding to the compare operation sub-item; If the comparison results of all the comparison operation sub-items are 1, the storage unit read by the read operation sub-item has passed the programming verification.

9. An erase programming verification system, characterized in that: The erasure programming verification system executes the erasure programming verification method according to any one of claims 1 to 8 during operation.

10. The erasure programming verification system according to claim 9, characterized in that: The erase programming verification system includes a latch, and the latch is used to cache the execution results of the multiple read operation items.

11. A memory, characterized in that: The memory comprises the erase programming verification system as described in any one of claims 9-10.