Patent Grant
9069659
In a multi-level Flash device the pages are separated by n-levels, corresponding to the number of bits stored per cell.
As may be noticed from the figure, for reading an MSB page, only a single read threshold comparison (comparison to MSB read threshold 24) should be performed. For reading a CSB page, two CSB read thresholds 22 and 26 are to be used in order to determine the bit value of every CSB associated cell. For LSB pages the bit-values are determined using the four LSB read thresholds 21, 23, 25 AND 27.
In
For floating gate devices, an “old” page, may introduce greater overlap between lobes than a new page, since after many program/erase (P/E) cycles there is accumulated trap charge, which is de-trapped over time. After a long duration, every lobe may have a larger standard deviation (std) and may have a different mean location. These affects are also known as retention. These are just two examples for overlapping distributions. There may be many more, such as read disturbs, or programming disturbs, etc.
As an example, we may consider a NAND FLASH array. The NAND FLASH array includes rows and columns (strings). During a read operation, an entire row/page is read from the NAND FLASH array. This is done by applying a bias voltage (or pass voltage) to all rows not being read and a reference read threshold voltage to the row we wish to read. Per each column of the NAND flash memory array one flash memory cell is read (the flash memory cell that belongs to the selected row) while the other flash memory cells are “open” due to the provision of the bias voltage.
The bias voltage allows the FLASH transistors to fully conduct. The cells lying on the row being read will conduct only if the read threshold voltage is sufficiently high to overcome the trapped change in the floating gate. At the bottom of each string there is a comparator which measures the current and outputs either a “1” or a “0” depending whether the current through that string passed a certain read threshold.
An MSB page is read by setting the MSB read threshold 24 between the fourth and fifth lobes 144 and 15. All lobes above the MSB read threshold 24 (lobes 15-18) will be read as “0”s and all lobes below that MSB read threshold 24 (lobes 11-14) will be read as “1”s.
As mentioned above, to read a CSB page two CSB read threshold 22 and 26 are used. Lobes 11 and 12 that are bellow the first CSB read threshold 22 and lobes 17 and 18 that are above the second CSB read threshold 26 will be read as “1”s. Lobes 13-16 that are between the two CSB read thresholds 22 and 26 will be read as “0”s. Similarly, the LSB pages are read by applying the four LSB read thresholds so that lobes 11, 14, 15 and 18 will be read as “1” and lobes 12-13 and 16-17 will be read as “1”.
It is noted that each lobe represents a set of MSB, CSB and LSB read values. Each flash memory cell of the 3 bpc flash memory cell stores such a set of values.
Those of skill in the art will appreciate that following retention, the positions of the lobes shift and they become wider. If during a read operation the same detection levels are used as just following programming, it is most likely that a considerable amount of read errors would occur. To overcome this problem, the read thresholds are modified as the block ages in order to minimize the number of read errors.
There is a growing need to find actual read thresholds to be applied during actual read attempts that will reduce the amount of read errors.
Various embodiments of the invention include a computer readable medium that is non-transitory and may store instructions for performing various stages.
According to an embodiment of the invention there may be provided a non-transitory computer readable medium that stores instructions for: reading a first group of flash memory cells using a reference read threshold to obtain multiple read results; processing the multiple read results by performing at least one out of calculating a distribution of values of the multiple read results and counting a number of read results of a certain value; estimating at least one actual read threshold to be used during future read attempts in response to at least one out of (i) the number of read results of the certain value and (ii) distribution information about a distribution of values of the read results; and reading a second group of flash memory cells using the at least one actual read threshold to provide actual read results.
The non-transitory computer readable medium may store instructions for processing the multiple read results by calculating the distribution of values of the read results.
The non-transitory computer readable medium may store instructions for processing the multiple read results by counting the number of read results of the certain value.
The non-transitory computer readable medium may store instructions for estimating the at least one actual read threshold by applying an estimation function on at least one of (i) the number of read results of the certain value and (ii) distribution information about the distribution of values of the read results
The estimation function may be a linear function.
The estimation function may be a polynomial function.
The estimation function may be a minimum means square estimating function.
The non-transitory computer readable medium may store instructions for updating the estimation function in response to the actual read results.
The non-transitory computer readable medium may store instructions for performing an initial read of an initial group of flash memory cells to obtain initial read results; and selecting the reference read threshold in response to the initial read results.
The non-transitory computer readable medium may store instructions for evaluating a state of the initial group of flash memory cells in response to the initial read results; wherein the selecting of the reference read threshold is responsive to the state of the initial group of flash memory cells.
The non-transitory computer readable medium may store instructions for performing an initial read of an initial group of flash memory cells to obtain initial read results; processing the initial read results by performing at least one out of calculating a distribution of values of the initial read results and counting a number of initial read results of a certain value; and selecting the reference read threshold in response to at least one out of the distribution of values of the initial read results and the number of initial read results of the certain value.
The non-transitory computer readable medium may store instructions for selecting the reference read threshold based upon a physical characteristic of the first group of memory cells.
The physical characteristic may represent a location of the first group of flash memory cells.
The physical characteristic may represent a state of the first group of flash memory cells.
The non-transitory computer readable medium may store instructions for calculating the reference read threshold.
The non-transitory computer readable medium may store instructions for calculating the reference read threshold in response to information about read threshold voltages of a plurality of flash memory cells and about logical values stored by the plurality of flash memory cells.
The non-transitory computer readable medium may store instructions for calculating the reference read threshold by obtaining information about read threshold voltages of a plurality of flash memory cells and about logical values stored by the plurality of flash memory cells; and finding, in response to the information, the reference read threshold that when used during read attempts, minimizes a number of read errors.
The non-transitory computer readable medium may store instructions for reading the first group of flash memory cells using multiple reference read thresholds to obtain the multiple read results.
According to an embodiment of the invention there may be provided a non-transitory computer readable medium may store instructions for reading a first group of flash memory cells using a plurality of reference read thresholds to obtain a plurality of sets of read results, one set of read results per each flash memory cell of the first group of flash memory cells; processing the plurality of sets of read results by performing at least one out of calculating a distribution of values of the plurality of sets of read results and counting a number of sets of read results of a given value; estimating at least one actual read threshold to be used during future read attempts in response to at least one of the distribution of values of the plurality of sets of read results and the number of sets of read results of the given value.
According to an embodiment of the invention there may be provided a non-transitory computer readable medium that may store instructions for acquiring information about read threshold voltages of a plurality of flash memory cells and about logical values stored by the plurality of flash memory cells; selecting, calculating or finding a reference read threshold per one or more groups of flash memory cells; calculating, based upon the information about read threshold voltages of a plurality of flash memory cells and about logical values stored by the plurality of flash memory cells, and for each group of flash memory cells out of the plurality of flash memory cells, one or more suggested read thresholds; reading the flash memory cells of different groups, using the reference read threshold associated with each group, to provide read results; counting, for each group of flash memory cells of the plurality of flash memory cells, a number of read results of a certain value; and finding, per each suggested read threshold, an estimating function that will map the numbers of read result of the certain value per each group to the suggested read threshold.
Additional embodiments of the invention provide a method that may include performing any stages that are preformed by a computerized system that executed the instructions stored in any of the computer readable medium described in the specification and/or claimed in the claims.
According to an embodiment of the invention there may be provided a method that may include reading a first group of flash memory cells using a reference read threshold to obtain multiple read results; processing the multiple read results by performing at least one out of calculating a distribution of values of the multiple read results and counting a number of read results of a certain value; estimating at least one actual read threshold to be used during future read attempts in response to at least one out of (i) the number of read results of the certain value and (ii) distribution information about a distribution of values of the read results; and reading a second group of flash memory cells using the at least one actual read threshold to provide actual read results.
The method may include processing the multiple read results by calculating the distribution of values of the read results.
The method may include processing the multiple read results by counting the number of read results of the certain value.
The method may include estimating the at least one actual read threshold by applying an estimation function on at least one of (i) the number of read results of the certain value and (ii) distribution information about the distribution of values of the read results
The estimation function may be a linear function.
The estimation function may be a polynomial function.
The estimation function may be a minimum means square estimating function.
The method may include updating the estimation function in response to the actual read results.
The method may include performing an initial read of an initial group of flash memory cells to obtain initial read results; and selecting the reference read threshold in response to the initial read results.
The method may include evaluating a state of the initial group of flash memory cells in response to the initial read results; wherein the selecting of the reference read threshold is responsive to the state of the initial group of flash memory cells.
The method may include performing an initial read of an initial group of flash memory cells to obtain initial read results; processing the initial read results by performing at least one out of calculating a distribution of values of the initial read results and counting a number of initial read results of a certain value; and selecting the reference read threshold in response to at least one out of the distribution of values of the initial read results and the number of initial read results of the certain value.
The method may include selecting the reference read threshold based upon a physical characteristic of the first group of memory cells.
The physical characteristic may represent a location of the first group of flash memory cells.
The physical characteristic may represent a state of the first group of flash memory cells.
The method may include calculating the reference read threshold.
The method may include calculating the reference read threshold in response to information about read threshold voltages of a plurality of flash memory cells and about logical values stored by the plurality of flash memory cells.
The method may include calculating the reference read threshold by obtaining information about read threshold voltages of a plurality of flash memory cells and about logical values stored by the plurality of flash memory cells; and finding, in response to the information, the reference read threshold that when used during read attempts, minimizes a number of read errors.
The method may include reading the first group of flash memory cells using multiple reference read thresholds to obtain the multiple read results.
According to an embodiment of the invention there may be provided a method that may include reading a first group of flash memory cells using a plurality of reference read thresholds to obtain a plurality of sets of read results, one set of read results per each flash memory cell of the first group of flash memory cells; processing the plurality of sets of read results by performing at least one out of calculating a distribution of values of the plurality of sets of read results and counting a number of sets of read results of a given value; estimating at least one actual read threshold to be used during future read attempts in response to at least one of the distribution of values of the plurality of sets of read results and the number of sets of read results of the given value.
According to an embodiment of the invention there may be provided a method that may include acquiring information about read threshold voltages of a plurality of flash memory cells and about logical values stored by the plurality of flash memory cells; selecting, calculating or finding a reference read threshold per one or more groups of flash memory cells; calculating, based upon the information about read threshold voltages of a plurality of flash memory cells and about logical values stored by the plurality of flash memory cells, and for each group of flash memory cells out of the plurality of flash memory cells, one or more suggested read thresholds; reading the flash memory cells of different groups, using the reference read threshold associated with each group, to provide read results; counting, for each group of flash memory cells of the plurality of flash memory cells, a number of read results of a certain value; and finding, per each suggested read threshold, an estimating function that will map the numbers of read result of the certain value per each group to the suggested read threshold.
Additional embodiments of the invention include a system arranged to execute any or all of the methods described in the specificaiton and/or claims, including any stages- and any combinations of same.
According to an embodiment of the invention there may be provided a system that may be arranged to: read a first group of flash memory cells using a reference read threshold to obtain multiple read results; process the multiple read results by performing at least one out of calculate a distribution of values of the multiple read results and counting a number of read results of a certain value; estimate at least one actual read threshold to be used during future read attempts in response to at least one out of (i) the number of read results of the certain value and (ii) distribution information about a distribution of values of the read results; and read a second group of flash memory cells using the at least one actual read threshold to provide actual read results.
The system may be arranged to process the multiple read results by calculate the distribution of values of the read results.
The system may be arranged to process the multiple read results by counting the number of read results of the certain value.
The system may be arranged to estimate the at least one actual read threshold by applying an estimating function on at least one of (i) the number of read results of the certain value and (ii) distribution information about the distribution of values of the read results
The estimating function may be a linear function.
The estimating function may be a polynomial function.
The estimating function may be a minimum means square estimating function.
The system may be arranged to update the estimating function in response to the actual read results.
The system may be arranged to perform an initial read of an initial group of flash memory cells to obtain initial read results; and select the reference read threshold in response to the initial read results.
The system may be arranged to evaluate a state of the initial group of flash memory cells in response to the initial read results; wherein the selection of the reference read threshold is responsive to the state of the initial group of flash memory cells.
The system may be arranged to perform an initial read of an initial group of flash memory cells to obtain initial read results; process the initial read results by performing at least one out of calculate a distribution of values of the initial read results and counting a number of initial read results of a certain value; and select the reference read threshold in response to at least one out of the distribution of values of the initial read results and the number of initial read results of the certain value.
The system may be arranged to select the reference read threshold based upon a physical characteristic of the first group of memory cells.
The physical characteristic may represent a location of the first group of flash memory cells.
The physical characteristic may represent a state of the first group of flash memory cells.
The system may be arranged to calculate the reference read threshold.
The system may be arranged to calculate the reference read threshold in response to information about read threshold voltages of a plurality of flash memory cells and about logical values stored by the plurality of flash memory cells.
The system may be arranged to calculate the reference read threshold by obtaining information about read threshold voltages of a plurality of flash memory cells and about logical values stored by the plurality of flash memory cells; and find, in response to the information, the reference read threshold that when used during read attempts, minimizes a number of read errors.
The system may be arranged to read the first group of flash memory cells using multiple reference read thresholds to obtain the multiple read results.
According to an embodiment of the invention there may be provided a system that may be arranged to read a first group of flash memory cells using a plurality of reference read thresholds to obtain a plurality of sets of read results, one set of read results per each flash memory cell of the first group of flash memory cells; process the plurality of sets of read results by performing at least one out of calculate a distribution of values of the plurality of sets of read results and counting a number of sets of read results of a given value; estimate at least one actual read threshold to be used during future read attempts in response to at least one of the distribution of values of the plurality of sets of read results and the number of sets of read results of the given value.
According to an embodiment of the invention there may be provided a system that may be arranged to acquire information about read threshold voltages of a plurality of flash memory cells and about logical values stored by the plurality of flash memory cells; select, calculate or find a reference read threshold per one or more groups of flash memory cells; calculate, based upon the information about read threshold voltages of a plurality of flash memory cells and about logical values stored by the plurality of flash memory cells, and for each group of flash memory cells out of the plurality of flash memory cells, one or more suggested read thresholds; read the flash memory cells of different groups, using the reference read threshold associated with each group, to provide read results; count, for each group of flash memory cells of the plurality of flash memory cells, a number of read results of a certain value; and find, per each suggested read threshold, an estimating function that will map the numbers of read result of the certain value per each group to the suggested read threshold.
According to an embodiment of the invention there may be provided a system, that may include a flash memory controller that is arranged to read a first group of flash memory cells using a reference read threshold to obtain multiple read results; and a host computer that is arranged to: process the multiple read results by performing at least one out of calculating a distribution of values of the multiple read results and counting a number of read results of a certain value; and estimate at least one actual read threshold to be used during future read attempts in response to at least one out of (i) the number of read results of the certain value and (ii) distribution information about a distribution of values of the read results. Wherein the flash memory controller is also arranged to read a second group of flash memory cells using the at least one actual read threshold to provide actual read results.
There may be provided a system that may include a flash memory controller that is arranged to: read a first group of flash memory cells using a reference read threshold to obtain multiple read results; process the multiple read results by performing at least one out of calculating a distribution of values of the multiple read results and counting a number of read results of a certain value; estimate at least one actual read threshold to be used during future read attempts in response to at least one out of (i) the number of read results of the certain value and (ii) distribution information about a distribution of values of the read results; and read a second group of flash memory cells using the at least one actual read threshold to provide actual read results.
There may be provided a system that may include a flash memory controller that is arranged to read a first group of flash memory cells using a plurality of reference read thresholds to obtain a plurality of sets of read results, one set of read results per each flash memory cell of the first group of flash memory cells; and a host computer that is arranged to process the plurality of sets of read results by performing at least one out of: calculating a distribution of values of the plurality of sets of read results and counting a number of sets of read results of a given value; and estimate at least one actual read threshold to be used during future read attempts in response to at least one of the distribution of values of the plurality of sets of read results and the number of sets of read results of the given value.
There may be provided a system that may include a flash memory controller that is arranged to read a first group of flash memory cells using a plurality of reference read thresholds to obtain a plurality of sets of read results, one set of read results per each flash memory cell of the first group of flash memory cells; to process the plurality of sets of read results by performing at least one out of: calculating a distribution of values of the plurality of sets of read results and counting a number of sets of read results of a given value; and estimate at least one actual read threshold to be used during future read attempts in response to at least one of the distribution of values of the plurality of sets of read results and the number of sets of read results of the given value.
There may be provided a system that may include a flash memory controller that is arranged to acquire information about read threshold voltages of a plurality of flash memory cells and about logical values stored by the plurality of flash memory cells; select, calculate or find a reference read threshold per one or more groups of flash memory cells; calculate, based upon the information about read threshold voltages of a plurality of flash memory cells and about logical values stored by the plurality of flash memory cells, and for each group of flash memory cells out of the plurality of flash memory cells, one or more suggested read thresholds; read the flash memory cells of different groups, using the reference read threshold associated with each group, to provide read results; count, for each group of flash memory cells of the plurality of flash memory cells, a number of read results of a certain value; and find, per each suggested read threshold, an estimating function that will map the numbers of read result of the certain value per each group to the suggested read threshold.
The subject matter regarded as the invention is particularly pointed out and distinctly claimed in the concluding portion of the specification. The invention, however, both as to organization and method of operation, together with objects, features, and advantages thereof, may best be understood by reference to the following detailed description when read with the accompanying drawings in which:
It will be appreciated that for simplicity and clarity of illustration, elements shown in the figures have not necessarily been drawn to scale. For example, the dimensions of some of the elements may be exaggerated relative to other elements for clarity. Further, where considered appropriate, reference numerals may be repeated among the figures to indicate corresponding or analogous elements.
In the following detailed description, numerous specific details are set forth in order to provide a thorough understanding of the invention. However, it will be understood by those skilled in the art that the present invention may be practiced without these specific details. In other instances, well-known methods, procedures, and components have not been described in detail so as not to obscure the present invention.
The subject matter regarded as the invention is particularly pointed out and distinctly claimed in the concluding portion of the specification. The invention, however, both as to organization and method of operation, together with objects, features, and advantages thereof, may best be understood by reference to the following detailed description when read with the accompanying drawings.
It will be appreciated that for simplicity and clarity of illustration, elements shown in the figures have not necessarily been drawn to scale. For example, the dimensions of some of the elements may be exaggerated relative to other elements for clarity. Further, where considered appropriate, reference numerals may be repeated among the figures to indicate corresponding or analogous elements.
Because the illustrated embodiments of the present invention may for the most part, be implemented using electronic components and circuits known to those skilled in the art, details will not be explained in any greater extent than that considered necessary as illustrated above, for the understanding and appreciation of the underlying concepts of the present invention and in order not to obfuscate or distract from the teachings of the present invention.
Any reference in the specification to a method should be applied mutatis mutandis to a system capable of executing the method and should be applied mutatis mutandis to a non-transitory computer readable medium that stores instructions that once executed by a computer result in the execution of the method.
Any reference in the specification to a system should be applied mutatis mutandis to a method that can be executed by the system and should be applied mutatis mutandis to a non-transitory computer readable medium that stores instructions that can be executed by the system.
Any reference in the specification to a non-transitory computer readable medium should be applied mutatis mutandis to a system capable of executing the instructions stored in the non-transitory computer readable medium and should be applied mutatis mutandis to method that can be executed by a computer that reads the instructions stored in the non-transitory computer readable medium.
The phrase “reference read threshold” means a read threshold that is applied during one or more reference read attempts that are dedicated for finding one or more actual read thresholds.
The phrase “actual read threshold” means a read threshold that is used during one or more normal read attempt. A normal read attempt is a read attempts that is not dedicated only for finding the actual read threshold. An actual read threshold can be an optimal read threshold or a sub-optimal read threshold in the sense of minimizing read errors. The following text may refer to the actual read threshold as an optimal read threshold but it should be noted that any reference to an optimal read can be also be viewed as a reference to a sub-optimal read threshold.
It is noted that the methods, systems and non-transitory computer readable media can be applied when the ordering of the lobes are as illustrated in
According to various embodiments of the invention there are provided methods, computer readable media and systems that may use reference read thresholds during reference read attempts to provide read results that are processed to provide optimal read thresholds. The processing may include applying an estimation function to find the optimal read thresholds.
The optimal read thresholds can be learnt based upon a limited amount of measurements (read results) available. When a need to re-acquire a read threshold arises, a small amount of measurements (e.g. performing a single or a small number of reference read attempts) and based on the results of these measurements the optimal read thresholds can be estimated.
Training Process
According to various embodiments of the invention a training process may be provided and may include calculating functions that can be used to calculate actual read thresholds.
If, for example, actual read thresholds are calculates based upon the distribution of values of the read results then the training process may be aimed to find an estimation function that will try to find an actual read threshold (that may be an optimal read threshold) as a function of the distribution of values of the read results. Thus—information about the distribution (at least information about two or more values of read results) can be used to estimate actual read results.
Training Process Based Upon Number of “1”s
For simplicity of explanation it is assumed that a single reference read threshold is found per one or more groups of flash memory cells and it is used for estimating actual read thresholds.
If, for example, actual read thresholds are calculated based upon the number of read results of the certain value (for example “1”) then the training process aimed to find an estimation function that will try to find an actual read threshold (that may be an optimal read threshold) as a function of the number of read results of the certain value. The following explanation will refer, for simplicity of explanation to the latter case (number of “1”).
The training process may start by stage 210 of acquiring information about read threshold voltages of a plurality of flash memory cells and about logical values stored by the plurality of flash memory cells. The number of these plurality of flash memory cells can be very large (exceed 10/\q, wherein q may exceed 3) and may be large enough to assure that the number of is will be 50% or any predetermined amount—regardless of the exact content of information stores in these plurality of flash memory cells. Alternatively, the plurality of flash memory cells can be read while knowing the expected content of these flash memory cells.
The exact value of the cells should be know in order to be able to calculate the read threshold values. In addition, it may be assumed that the probability of ‘1’ is 50%.
This information can be stored in a database or any other data structure. The acquisition may include generating the database, updating the database or merely retrieving the information from the database.
The plurality of flash memory cells can include flash be taken from different locations (different rows, different erase blocks, different memory banks, different flash memory dies and even different flash memory devices).
The plurality (N) of flash memory cells may include flash memory cells that differ from each other by state (different wear levels, different program erase P/E cycle count, different retention times, and the like). The retention can be emulated or obtained by baking different flash memory cells.
The plurality of flash memory cells can include flash memory cells of different locations and state.
Database 30 includes values (32) of the threshold voltage of each flash memory cell of the plurality of flash memory cells—such as VT1-VTN, and the logical value (34) that should be stored in each one of these N flash memory cells. The logical values are denoted LV1-LVN.
The training process can find actual read thresholds based upon the entire database or portions thereof. Thus—one or more reference read thresholds can be found per the entire database or per one or more portions of the database. For example—one or more reference read thresholds can be selected per a group of rows, per a range of P/E cycle count, per an erase block, per a die, per a combination of P/E cycle count and erase block, and the like.
Flash memory cells that share the same reference read threshold and the same suggested read thresholds are referred to a set of flash memory cells. A set may include one or more groups of flash memory cells.
Referring back to FIG. 2—stage 210 may be followed by stage 220 of selecting, calculating or finding a reference read threshold per one or more groups of flash memory cells. Referring to the example set forth in FIG. 3—the training process should find a first reference read threshold for set 41(1) and a second reference read threshold for set 41(2). A group of flash memory cells may be a page of flash memory cells or any other group of flash memory cells that may be adjacent to each other.
Stage 220 may include spanning the possible reference read threshold values until finding the read reference value that complies with a criterion such as a minimal amount of read errors is detected. It is noted that other optimal criteria can be provided and that sub-optimal criteria can also be defined for finding the read threshold.
Each logical value should be associated with a range of threshold voltages (such as a threshold voltage lobe) that should be delimited by one or more read thresholds. Comparing the exact voltage threshold of each flash memory cell to a range of threshold voltages that should be associated with that the logical value can indicate whether that flash memory cell is expected to cause a read error or not.
The information can be obtained by performing multiple read attempts of the plurality of flash memory cells with different read thresholds that scan the range of voltage thresholds of the flash memory cells. A voltage threshold scan (VT scan) can generate the voltage threshold distribution illustrated in
Each reference read threshold may be calculated to comply with a criterion such as minimizing the number of read errors.
Stage 210 may also be followed by stage 230 of calculating, based upon the information about read threshold voltages of a plurality of flash memory cells and about logical values stored by the plurality of flash memory cells, and for each group of flash memory cells out of the plurality of flash memory cells, one or more suggested read thresholds. The suggested read thresholds can be optimal or sub-optimal read thresholds.
Stage 220 and 230 may be followed by stage 240 of reading the flash memory cells of different groups, using the reference read threshold associated with each group, to provide read results. As indicated above—one or more groups may form a set and each flash memory cell in the set will be read using the same one or more reference read thresholds to be used when reading other flash memory cells of the set.
Stage 240 may be followed by stage 250 of counting, for each group of flash memory cells of the plurality of flash memory cells, the number of read results of a certain value.
Data structure 50 of
It is assumed that the flash memory cells are 2 bpc flash memory cells (thus there are 3 suggested read thresholds, that there are J different groups of flash memory cells, and that a single reference read threshold is associated with each group.
Each row of data structure 50 is associated with a single group of flash memory cells.
Columns 51(1)-51(3) store the three suggested read thresholds (Thsg1(i)-Thsg3(i), column 52(1) stores the reference read threshold (RRT(i)) and column 53(1) stores the number (N1s(i)) of read results of value “1” obtained when applying the reference read threshold of column 52(1). Index i ranges between 1 and I.
Column 1 stores Thsg1
It is noted that multiple columns can be allocated with different values of reference read thresholds applied to the same group of flash memory cells and multiple columns can be allocated for storing the number of read results of value “1” obtained when applying these reference read results.
Referring back to FIG. 2—stage 250 is followed by stage 260 of finding, per each suggested read threshold, an estimating function that will map the numbers of read result of the certain value per each group to the suggested read threshold.
The estimating functions of different suggested read thresholds may differ from each other.
The estimation function can be any function that provides such a mapping. It may be, for example, a linear function, a polynomial function, a minimum mean square error function and the like or even a function in a form of a table.
The mapping function will be used to set actual read thresholds. When, for example an actual read threshold of a group of flash memory cells should be read—the group of flash memory cells is read using a reference read threshold associated with that group to provide read results, and the number of read results of a certain value is fed to one or more mapping functions to determine one or more actual read thresholds to be used in future read attempts of the group of flash memory cells.
Linear Estimating Function
The actual read threshold is calculated by applying an estimating function of:
actual read threshold=a1*N1s+a0.
Where a1 and a0 are learnt during the training process.
Coefficients a1 and a0 can be selected such as to minimize the following error function:
Error function=sum,taken over all samples(k ranges between l and Nsamples) of |a1*N1s(k)+a0−Thsg(k)/\r,
where r is a given natural number
Wherein:
The above process is repeated for all sets of flash memory cells and the selected read threshold may be the one for which the optimal choice of a1 and a0 minimizes the error function.
A Polynomial Estimating Function.
The actual read threshold is calculated by applying an estimating function of: Actual read threshold=sum, over index i of ai multiplied by N1s by the power of i.
Coefficients ai can be determined during the training process. They may be selected to minimize an error function which equals a first sum, taken over all samples (k ranges between 1 and Nsamples) of |a second sum of ai*N1s(k)/\i−Thsg(k)|/\r, where r is a natural number.
A Minimum Means Square Estimating Function
According to an embodiment of the invention the estimating function can be a minimum means square error estimating function.
Estimating Functions Per Sub-Ranges of Number of Read Results Having a Certain Value
The full range of possible N1s can be split to multiple sub-ranges and an estimating function can be determined per sub-range.
The range of values that N1s can take can be divided into sub-ranges rj, wherein index j ranges between 1 and J.
According to an embodiment of the invention for each sub-range rj a suggested “optimal” read threshold may equal the average of Thsg(k) values for this sub-range and may be equal to the average of Nis in this sub-range.
The choice of the reference read threshold per sub-range can be selected such as to minimize the following error function: Errsample Threshold=Σk=1Nsamples|Thi(N1s)−Thoptk|2.
This error function (which should be minimized when finding read thresholds) slightly differs from the previous error functions—as it is applied only on flash memory cell rows which when read with a given reference th, gives roughlty a same number of ones (i.e., the number of ones falls in the rj range). This is done for each range.
Other error functions may be selected, for example, based on absolute difference values instead of the squared distances.
Single Reference Read Attempt
There may be provided a method for reading a certain amount of data from a designated reference page in a row in a block (in a Flash devices), counting the numbers of read results set to one (or to zero) and based on that number, estimating the optimal or sub-optimal position of the read thresholds.
It is noted that the number of reference read thresholds allocated per a group of flash memory cells can differ from the number of bits stored within each of the flash memory cells. For example, a single reference read threshold can be associated with a 3-bpc flash memory cells. It is expected that the number of reference read thresholds per a group of flash memory cells will not exceed the number of bit per cell of these flash memory cell. Thus, up till three reference read thresholds will be allocated for a group of 3 bpc flash memory cells. Each, reference read may be used to estimate the thresholds of different bit type page in the row.
Method 600 may start by stage 610 of setting reference read thresholds. Prior to performing a reference read which will obtain the required measurable data for the estimation, the read thresholds should be set to their predefined reference value. This assures that we always perform the estimation based on a consistent measurement set.
Stage 610 may be followed by stage 620 of reading data from designated row (in designated block and die). At this stage, a page (or part of it) is read from the row for which we wish to optimize the read thresholds.
Stage 620 may be followed by stage 630 of counting the number of read results that equal “1”. Based on the number of “1” in the binary representation of the data we can perform an estimation of the actual read thresholds.
Stage 630 may be followed by stage 640 of estimating actual read thresholds. It may include applying an estimating function on N1s to find each actual read threshold.
Stage 640 may be followed by stage 650 of setting the actual read thresholds to the values calculated in stage 640.
Stage 640 of estimating the optimal read thresholds may be responsive to (a) an estimating function that maps the Nls (number of “1” counted in stage 630) and (b) an actual read threshold value.
The first set of actual read thresholds includes first actual read thresholds 71(1)-71(3) and the second set of actual read thresholds includes second actual read thresholds 72(1)-72(3). These sets differ from each other and were obtained by applying the same estimating function on two different values of N1s.
Multiple Reference Reads Attempts
In some cases, more accurate read threshold estimations may be obtained if the estimation of the actual read thresholds is based on several read measurements. For example, if a flash memory device suffers both from retention and from read disturb, there will be seen two contradictory behaviors which affect different optimal read thresholds. In this case, most actual read thresholds will tend to be lower than the original values, just after programming. However, the first read threshold may be higher due to the read disturb. In order to sense both the read disturb and retention phenomenon, it may be required to perform two or more read attempts using two or more reference read thresholds.
If, for example, a single read attempt provide read results that represent a comparison between two reference read thresholds it may not be clear if the number of is in the read result are due to the first or second reference read threshold.
Reading more than one reference read may allow us to distinguish between the effects of each read threshold comparison.
Method 800 may include various stages that are repeated per reference read attempt (out of one or more reference read attempts).
Thus, method 800 may include:
Again, the decision of the reference read threshold and the determination of the estimation function can be done based on database collected offline. Similar linear, polynomial and any other non-linear estimating functions can be applied in this case as well where the input is no longer scalar but a vector (of 8 values, for example).
Multiple Staggered Reference Reads
According to an embodiment of the invention there is provided a method that may modify the reference read threshold to be applied during different reference read attempts between one reference read attempt and the next, depending on the read results.
For example, the first reference read attempts may give some coarse information with regard to the state of the read flash memory cells and then, next reference read attempts may be more accurate in the sense that they involve applying reference read thresholds that are matched to the state of the flash memory cells.
This may involve performing an initial read of an initial group of flash memory cells to obtain initial read results; processing the initial read results by performing at least one out of calculating a distribution of values of the initial read results and counting a number of initial read results of a certain value; and selecting the reference read threshold in response to at least one out of the distribution of values of the initial read results and the number of initial read results of the certain value.
Method 900 may include the following stages:
The above method can be generalized to more than two stages. Furthermore, it may be generalized to the case where each stage includes performing several reference read attempts and prior to performing the next set of reference read attempts it is determined which read thresholds to used based on the outcome of previous reference read attempts.
According to yet another embodiment of the invention the estimating (980) can be responsive not just to the number of ones but to the distribution of values. If multiple bits per cell flash memory cells are read then the estimation may be responsive to the distribution of values of the combination of read values.
The estimating function may be constructed based on a database obtained offline as described in the previous methods.
Online Learning of Estimation Parameters
In the above, all methods relied on an offline database to learn the optimal values for the reference read thresholds and estimating functions. However, the estimating functions and/or the reference read thresholds can be updated over time.
According to an embodiment of the invention such an update can be responsive on the estimated accuracy of the suggested read thresholds generated by any of the mentioned above methods.
For example—after reading real data using actual read thresholds, the method can proceed to determine the number of errors that were found in that read attempt and determine whether the actual read thresholds were accurate or not. Depending on this result, the method may modify the estimating function.
System 1100 may execute any of the method illustrated above.
System 1100 is illustrated as including a flash memory controller 1110, a flash memory device 1120 and a host computer 1130 that may be arranged to calculate the reference read thresholds and the suggested read thresholds. The flash memory controller 1100 may perform the read operations (it may include a read circuit, a write circuit, a programming circuit, may include an estimator and processor for processing the read results and estimating at least one actual read threshold respectively. Alternatively—the processor can perform both functions). Alternatively, the flash memory controller 1110 can calculate the reference read thresholds and the suggested read thresholds.
The invention may also be implemented in a computer program for running on a computer system, at least including code portions for performing steps of a method according to the invention when run on a programmable apparatus, such as a computer system or enabling a programmable apparatus to perform functions of a device or system according to the invention.
A computer program is a list of instructions such as a particular application program and/or an operating system. The computer program may for instance include one or more of: a subroutine, a function, a procedure, an object method, an object implementation, an executable application, an applet, a servlet, a source code, an object code, a shared library/dynamic load library and/or other sequence of instructions designed for execution on a computer system.
The computer program may be stored internally on a non-transitory computer readable medium. All or some of the computer program may be provided on computer readable media permanently, removably or remotely coupled to an information processing system. The computer readable media may include, for example and without limitation, any number of the following: magnetic storage media including disk and tape storage media; optical storage media such as compact disk media (e.g., CD-ROM, CD-R, etc.) and digital video disk storage media; nonvolatile memory storage media including semiconductor-based memory units such as FLASH memory, EEPROM, EPROM, ROM; ferromagnetic digital memories; MRAM; volatile storage media including registers, buffers or caches, main memory, RAM, etc.
A computer process typically includes an executing (running) program or portion of a program, current program values and state information, and the resources used by the operating system to manage the execution of the process. An operating system (OS) is the software that manages the sharing of the resources of a computer and provides programmers with an interface used to access those resources. An operating system processes system data and user input, and responds by allocating and managing tasks and internal system resources as a service to users and programs of the system.
The computer system may for instance include at least one processing unit, associated memory and a number of input/output (I/O) devices. When executing the computer program, the computer system processes information according to the computer program and produces resultant output information via I/O devices.
In the foregoing specification, the invention has been described with reference to specific examples of embodiments of the invention. It will, however, be evident that various modifications and changes may be made therein without departing from the broader spirit and scope of the invention as set forth in the appended claims.
Moreover, the terms “front,” “back,” “top,” “bottom,” “over,” “under” and the like in the description and in the claims, if any, are used for descriptive purposes and not necessarily for describing permanent relative positions. It is understood that the terms so used are interchangeable under appropriate circumstances such that the embodiments of the invention described herein are, for example, capable of operation in other orientations than those illustrated or otherwise described herein.
Those skilled in the art will recognize that the boundaries between logic blocks are merely illustrative and that alternative embodiments may merge logic blocks or circuit elements or impose an alternate decomposition of functionality upon various logic blocks or circuit elements. Thus, it is to be understood that the architectures depicted herein are merely exemplary, and that in fact many other architectures can be implemented which achieve the same functionality.
Any arrangement of components to achieve the same functionality is effectively “associated” such that the desired functionality is achieved. Hence, any two components herein combined to achieve a particular functionality can be seen as, “associated with” each other such that the desired functionality is achieved, irrespective of architectures or intermedial components. Likewise, any two components so associated can also be viewed as being “operably connected,” or “operably coupled,” to each other to achieve the desired functionality.
Furthermore, those skilled in the art will recognize that boundaries between the above described operations merely illustrative. The multiple operations may be combined into a single operation, a single operation may be distributed in additional operations and operations may be executed at least partially overlapping in time. Moreover, alternative embodiments may include multiple instances of a particular operation, and the order of operations may be altered in various other embodiments.
Also for example, in one embodiment, the illustrated examples may be implemented as circuitry located on a single integrated circuit or within a same device. Alternatively, the examples may be implemented as any number of separate integrated circuits or separate devices interconnected with each other in a suitable manner.
Also for example, the examples, or portions thereof, may implemented as soft or code representations of physical circuitry or of logical representations convertible into physical circuitry, such as in a hardware description language of any appropriate type.
Also, the invention is not limited to physical devices or units implemented in non-programmable hardware but can also be applied in programmable devices or units able to perform the desired device functions by operating in accordance with suitable program code, such as mainframes, minicomputers, servers, workstations, personal computers, notepads, personal digital assistants, electronic games, automotive and other embedded systems, cell phones and various other wireless devices, commonly denoted in this application as ‘computer systems’.
However, other modifications, variations and alternatives are also possible. The specifications and drawings are, accordingly, to be regarded in an illustrative rather than in a restrictive sense.
In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word ‘comprising’ does not exclude the presence of other elements or steps then those listed in a claim. Furthermore, the terms “a” or “an,” as used herein, are defined as one or more than one. Also, the use of introductory phrases such as “at least one” and “one or more” in the claims should not be construed to imply that the introduction of another claim element by the indefinite articles “a” or “an” limits any particular claim containing such introduced claim element to inventions containing only one such element, even when the same claim includes the introductory phrases “one or more” or “at least one” and indefinite articles such as “a” or “an.” The same holds true for the use of definite articles. Unless stated otherwise, terms such as “first” and “second” are used to arbitrarily distinguish between the elements such terms describe. Thus, these terms are not necessarily intended to indicate temporal or other prioritization of such elements The mere fact that certain measures are recited in mutually different claims does not indicate that a combination of these measures cannot be used to advantage.
Any system, apparatus or device referred to this patent application includes at least one hardware component.
While certain features of the invention have been illustrated and described herein, many modifications, substitutions, changes, and equivalents will now occur to those of ordinary skill in the art. It is, therefore, to be understood that the appended claims are intended to cover all such modifications and changes as fall within the true spirit of the invention.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4430701 | Christian et al. | Feb 1984 | A |
| 4463375 | Macovski | Jul 1984 | A |
| 4584686 | Fritze | Apr 1986 | A |
| 4589084 | Fling et al. | May 1986 | A |
| 4777589 | Boettner et al. | Oct 1988 | A |
| 4866716 | Weng | Sep 1989 | A |
| 5003597 | Merkle | Mar 1991 | A |
| 5077737 | Leger et al. | Dec 1991 | A |
| 5297153 | Baggen et al. | Mar 1994 | A |
| 5305276 | Uenoyama | Apr 1994 | A |
| 5592641 | Doyle et al. | Jan 1997 | A |
| 5623620 | Ranjeet et al. | Apr 1997 | A |
| 5640529 | Hasbun | Jun 1997 | A |
| 5657332 | Auclair et al. | Aug 1997 | A |
| 5663901 | Harari et al. | Sep 1997 | A |
| 5724538 | Bryg et al. | Mar 1998 | A |
| 5729490 | Calligaro et al. | Mar 1998 | A |
| 5740395 | Hasbun et al. | Apr 1998 | A |
| 5745418 | Hu et al. | Apr 1998 | A |
| 5778430 | Giovannetti et al. | Jul 1998 | A |
| 5793774 | Usui et al. | Aug 1998 | A |
| 5920578 | Zook et al. | Jul 1999 | A |
| 5926409 | Engh et al. | Jul 1999 | A |
| 5933368 | Hu et al. | Aug 1999 | A |
| 5956268 | Lee | Sep 1999 | A |
| 5956473 | Hu et al. | Sep 1999 | A |
| 5968198 | Balachandran | Oct 1999 | A |
| 5982659 | Irrinki et al. | Nov 1999 | A |
| 6011741 | Harari et al. | Jan 2000 | A |
| 6016275 | Han | Jan 2000 | A |
| 6038634 | Ji et al. | Mar 2000 | A |
| 6081878 | Estakhri et al. | Jun 2000 | A |
| 6094465 | Stein et al. | Jul 2000 | A |
| 6119245 | Hiratsuka | Sep 2000 | A |
| 6182261 | Haller et al. | Jan 2001 | B1 |
| 6192497 | Yang et al. | Feb 2001 | B1 |
| 6195287 | Hirano | Feb 2001 | B1 |
| 6199188 | Shen et al. | Mar 2001 | B1 |
| 6209114 | Wolf et al. | Mar 2001 | B1 |
| 6259627 | Wong | Jul 2001 | B1 |
| 6272052 | Miyauchi | Aug 2001 | B1 |
| 6278633 | Wong et al. | Aug 2001 | B1 |
| 6279133 | Vafai et al. | Aug 2001 | B1 |
| 6301151 | Engh et al. | Oct 2001 | B1 |
| 6370061 | Yachareni et al. | Apr 2002 | B1 |
| 6374383 | Weng | Apr 2002 | B1 |
| 6504891 | Chevallier | Jan 2003 | B1 |
| 6532169 | Mann et al. | Mar 2003 | B1 |
| 6532556 | Wong et al. | Mar 2003 | B1 |
| 6553533 | Demura et al. | Apr 2003 | B2 |
| 6560747 | Weng | May 2003 | B1 |
| 6637002 | Weng et al. | Oct 2003 | B1 |
| 6639865 | Kwon | Oct 2003 | B2 |
| 6674665 | Mann et al. | Jan 2004 | B1 |
| 6675281 | Oh et al. | Jan 2004 | B1 |
| 6704902 | Shinbashi et al. | Mar 2004 | B1 |
| 6751766 | Guterman et al. | Jun 2004 | B2 |
| 6772274 | Estakhri | Aug 2004 | B1 |
| 6781910 | Smith | Aug 2004 | B2 |
| 6792569 | Cox et al. | Sep 2004 | B2 |
| 6873543 | Smith et al. | Mar 2005 | B2 |
| 6891768 | Smith et al. | May 2005 | B2 |
| 6914809 | Hilton et al. | Jul 2005 | B2 |
| 6915477 | Gollamudi et al. | Jul 2005 | B2 |
| 6952365 | Gonzalez et al. | Oct 2005 | B2 |
| 6961890 | Smith | Nov 2005 | B2 |
| 6968421 | Conley | Nov 2005 | B2 |
| 6990012 | Smith et al. | Jan 2006 | B2 |
| 6996004 | Fastow et al. | Feb 2006 | B1 |
| 6999854 | Roth | Feb 2006 | B2 |
| 7010739 | Feng et al. | Mar 2006 | B1 |
| 7012835 | Gonzalez et al. | Mar 2006 | B2 |
| 7038950 | Hamilton et al. | May 2006 | B1 |
| 7068539 | Guterman et al. | Jun 2006 | B2 |
| 7079436 | Perner et al. | Jul 2006 | B2 |
| 7149950 | Spencer et al. | Dec 2006 | B2 |
| 7177977 | Chen et al. | Feb 2007 | B2 |
| 7188228 | Chang et al. | Mar 2007 | B1 |
| 7191379 | Adelmann et al. | Mar 2007 | B2 |
| 7196946 | Chen et al. | Mar 2007 | B2 |
| 7203874 | Roohparvar | Apr 2007 | B2 |
| 7212426 | Park et al | May 2007 | B2 |
| 7290203 | Emma et al. | Oct 2007 | B2 |
| 7292365 | Knox | Nov 2007 | B2 |
| 7301928 | Nakabayashi et al. | Nov 2007 | B2 |
| 7315916 | Bennett et al. | Jan 2008 | B2 |
| 7388781 | Litsyn et al. | Jun 2008 | B2 |
| 7395404 | Gorobets et al. | Jul 2008 | B2 |
| 7441067 | Gorobets et al. | Oct 2008 | B2 |
| 7443729 | Li et al. | Oct 2008 | B2 |
| 7450425 | Aritome | Nov 2008 | B2 |
| 7454670 | Kim et al. | Nov 2008 | B2 |
| 7466575 | Shalvi et al. | Dec 2008 | B2 |
| 7533328 | Alrod et al. | May 2009 | B2 |
| 7558109 | Brandman et al. | Jul 2009 | B2 |
| 7593263 | Sokolov et al. | Sep 2009 | B2 |
| 7610433 | Randell et al. | Oct 2009 | B2 |
| 7613043 | Cornwell et al. | Nov 2009 | B2 |
| 7619922 | Li et al. | Nov 2009 | B2 |
| 7697326 | Sommer et al. | Apr 2010 | B2 |
| 7706182 | Shalvi et al. | Apr 2010 | B2 |
| 7716538 | Gonzalez et al. | May 2010 | B2 |
| 7804718 | Kim | Sep 2010 | B2 |
| 7805663 | Brandman et al. | Sep 2010 | B2 |
| 7805664 | Yang et al. | Sep 2010 | B1 |
| 7844877 | Litsyn et al. | Nov 2010 | B2 |
| 7911848 | Eun et al. | Mar 2011 | B2 |
| 7961797 | Yang et al. | Jun 2011 | B1 |
| 7975192 | Sommer et al. | Jul 2011 | B2 |
| 8020073 | Emma et al. | Sep 2011 | B2 |
| 8108590 | Chow et al. | Jan 2012 | B2 |
| 8122328 | Liu et al. | Feb 2012 | B2 |
| 8159881 | Yang | Apr 2012 | B2 |
| 8190961 | Yang et al. | May 2012 | B1 |
| 8250324 | Haas et al. | Aug 2012 | B2 |
| 8300823 | Bojinov et al. | Oct 2012 | B2 |
| 8305812 | Levy et al. | Nov 2012 | B2 |
| 8327246 | Weingarten et al. | Dec 2012 | B2 |
| 8407560 | Ordentlich et al. | Mar 2013 | B2 |
| 8417893 | Khmelnitsky et al. | Apr 2013 | B2 |
| 20010034815 | Dugan et al. | Oct 2001 | A1 |
| 20020063774 | Hillis et al. | May 2002 | A1 |
| 20020085419 | Kwon et al. | Jul 2002 | A1 |
| 20020154769 | Petersen et al. | Oct 2002 | A1 |
| 20020156988 | Tsutomu et al. | Oct 2002 | A1 |
| 20020174156 | Birru et al. | Nov 2002 | A1 |
| 20030014582 | Nakanishi | Jan 2003 | A1 |
| 20030065876 | Lasser | Apr 2003 | A1 |
| 20030101404 | Zhao et al. | May 2003 | A1 |
| 20030105620 | Bowen | Jun 2003 | A1 |
| 20030177300 | Jeong et al. | Sep 2003 | A1 |
| 20030192007 | Miller et al. | Oct 2003 | A1 |
| 20040015771 | Lasser et al. | Jan 2004 | A1 |
| 20040030971 | Tanaka et al. | Feb 2004 | A1 |
| 20040059768 | Denk et al. | Mar 2004 | A1 |
| 20040080985 | Chang et al. | Apr 2004 | A1 |
| 20040153722 | Lee | Aug 2004 | A1 |
| 20040153817 | Norman et al. | Aug 2004 | A1 |
| 20040181735 | Xin | Sep 2004 | A1 |
| 20040203591 | Lee | Oct 2004 | A1 |
| 20040210706 | In et al. | Oct 2004 | A1 |
| 20050013165 | Ban | Jan 2005 | A1 |
| 20050018482 | Cemea et al. | Jan 2005 | A1 |
| 20050083735 | Chen et al. | Apr 2005 | A1 |
| 20050117401 | Chen et al. | Jun 2005 | A1 |
| 20050120265 | Pline et al. | Jun 2005 | A1 |
| 20050128811 | Kato et al. | Jun 2005 | A1 |
| 20050138533 | Le Bars et al. | Jun 2005 | A1 |
| 20050144213 | Simkins et al. | Jun 2005 | A1 |
| 20050144368 | Chung et al. | Jun 2005 | A1 |
| 20050169057 | Shibata et al. | Aug 2005 | A1 |
| 20050172179 | Brandenberger et al. | Aug 2005 | A1 |
| 20050213393 | Lasser | Sep 2005 | A1 |
| 20050243626 | Ronen | Nov 2005 | A1 |
| 20060059406 | Micheloni et al. | Mar 2006 | A1 |
| 20060059409 | Lee | Mar 2006 | A1 |
| 20060064537 | Oshima et al. | Mar 2006 | A1 |
| 20060101193 | Murin | May 2006 | A1 |
| 20060195651 | Estakhri et al. | Aug 2006 | A1 |
| 20060203587 | Li et al. | Sep 2006 | A1 |
| 20060221692 | Chen | Oct 2006 | A1 |
| 20060248434 | Radke et al. | Nov 2006 | A1 |
| 20060268608 | Noguchi et al. | Nov 2006 | A1 |
| 20060282411 | Fagin et al. | Dec 2006 | A1 |
| 20060284244 | Forbes et al. | Dec 2006 | A1 |
| 20060294312 | Walmsley | Dec 2006 | A1 |
| 20070025157 | Wan et al. | Feb 2007 | A1 |
| 20070063180 | Asano et al. | Mar 2007 | A1 |
| 20070081388 | Joo | Apr 2007 | A1 |
| 20070098069 | Gordon | May 2007 | A1 |
| 20070103992 | Sakui et al. | May 2007 | A1 |
| 20070104004 | So et al. | May 2007 | A1 |
| 20070109858 | Conley et al. | May 2007 | A1 |
| 20070124652 | Litsyn et al. | May 2007 | A1 |
| 20070140006 | Chen et al. | Jun 2007 | A1 |
| 20070143561 | Gorobets | Jun 2007 | A1 |
| 20070150694 | Chang et al. | Jun 2007 | A1 |
| 20070168625 | Cornwell et al. | Jul 2007 | A1 |
| 20070171714 | Wu et al. | Jul 2007 | A1 |
| 20070171730 | Ramamoorthy et al. | Jul 2007 | A1 |
| 20070180346 | Murin | Aug 2007 | A1 |
| 20070223277 | Tanaka et al. | Sep 2007 | A1 |
| 20070226582 | Tang et al. | Sep 2007 | A1 |
| 20070226592 | Radke | Sep 2007 | A1 |
| 20070228449 | Takano et al. | Oct 2007 | A1 |
| 20070253249 | Kang et al. | Nov 2007 | A1 |
| 20070253250 | Shibata et al. | Nov 2007 | A1 |
| 20070263439 | Cornwell et al. | Nov 2007 | A1 |
| 20070266291 | Toda et al. | Nov 2007 | A1 |
| 20070271494 | Gorobets | Nov 2007 | A1 |
| 20070297226 | Mokhlesi | Dec 2007 | A1 |
| 20080010581 | Alrod et al. | Jan 2008 | A1 |
| 20080028014 | Hilt et al. | Jan 2008 | A1 |
| 20080049497 | Mo | Feb 2008 | A1 |
| 20080055989 | Lee et al. | Mar 2008 | A1 |
| 20080082897 | Brandman et al. | Apr 2008 | A1 |
| 20080092026 | Brandman et al. | Apr 2008 | A1 |
| 20080104309 | Cheon et al. | May 2008 | A1 |
| 20080112238 | Kim et al. | May 2008 | A1 |
| 20080116509 | Harari et al. | May 2008 | A1 |
| 20080126686 | Sokolov et al. | May 2008 | A1 |
| 20080127104 | Li et al. | May 2008 | A1 |
| 20080128790 | Jung | Jun 2008 | A1 |
| 20080130341 | Shalvi et al. | Jun 2008 | A1 |
| 20080137413 | Kong et al. | Jun 2008 | A1 |
| 20080137414 | Park et al. | Jun 2008 | A1 |
| 20080141043 | Flynn et al. | Jun 2008 | A1 |
| 20080148115 | Sokolov et al. | Jun 2008 | A1 |
| 20080158958 | Shalvi et al. | Jul 2008 | A1 |
| 20080159059 | Moyer | Jul 2008 | A1 |
| 20080162079 | Astigarraga et al. | Jul 2008 | A1 |
| 20080168216 | Lee | Jul 2008 | A1 |
| 20080168320 | Cassuto et al. | Jul 2008 | A1 |
| 20080181001 | Shalvi | Jul 2008 | A1 |
| 20080198650 | Shalvi et al. | Aug 2008 | A1 |
| 20080198652 | Shalvi et al. | Aug 2008 | A1 |
| 20080201620 | Gollub | Aug 2008 | A1 |
| 20080209114 | Chow et al. | Aug 2008 | A1 |
| 20080219050 | Shalvi et al. | Sep 2008 | A1 |
| 20080225599 | Chae | Sep 2008 | A1 |
| 20080250195 | Chow et al. | Oct 2008 | A1 |
| 20080263262 | Sokolov et al. | Oct 2008 | A1 |
| 20080282106 | Shalvi et al. | Nov 2008 | A1 |
| 20080285351 | Shlick et al. | Nov 2008 | A1 |
| 20080301532 | Uchikawa et al. | Dec 2008 | A1 |
| 20090024905 | Shalvi et al. | Jan 2009 | A1 |
| 20090027961 | Park et al. | Jan 2009 | A1 |
| 20090043951 | Shalvi et al. | Feb 2009 | A1 |
| 20090046507 | Aritome | Feb 2009 | A1 |
| 20090072303 | Prall et al. | Mar 2009 | A9 |
| 20090091979 | Shalvi | Apr 2009 | A1 |
| 20090103358 | Sommer et al. | Apr 2009 | A1 |
| 20090106485 | Anholt | Apr 2009 | A1 |
| 20090113275 | Chen et al. | Apr 2009 | A1 |
| 20090125671 | Flynn et al. | May 2009 | A1 |
| 20090132755 | Radke | May 2009 | A1 |
| 20090144598 | Yoon et al. | Jun 2009 | A1 |
| 20090144600 | Perlmutter et al. | Jun 2009 | A1 |
| 20090150599 | Bennett | Jun 2009 | A1 |
| 20090150748 | Egner et al. | Jun 2009 | A1 |
| 20090157964 | Kasorla et al. | Jun 2009 | A1 |
| 20090158126 | Perlmutter et al. | Jun 2009 | A1 |
| 20090168524 | Golov et al. | Jul 2009 | A1 |
| 20090187803 | Anholt et al. | Jul 2009 | A1 |
| 20090199074 | Sommer | Aug 2009 | A1 |
| 20090213653 | Perlmutter et al. | Aug 2009 | A1 |
| 20090213654 | Perlmutter et al. | Aug 2009 | A1 |
| 20090228761 | Perlmutter et al. | Sep 2009 | A1 |
| 20090240872 | Perlmutter et al. | Sep 2009 | A1 |
| 20090282185 | Van Cauwenbergh | Nov 2009 | A1 |
| 20090282186 | Mokhlesi et al. | Nov 2009 | A1 |
| 20090287930 | Nagaraja | Nov 2009 | A1 |
| 20090300269 | Radke et al. | Dec 2009 | A1 |
| 20090323942 | Sharon et al. | Dec 2009 | A1 |
| 20100005270 | Jiang | Jan 2010 | A1 |
| 20100025811 | Bronner et al. | Feb 2010 | A1 |
| 20100030944 | Hinz | Feb 2010 | A1 |
| 20100058146 | Weingarten et al. | Mar 2010 | A1 |
| 20100064096 | Weingarten et al. | Mar 2010 | A1 |
| 20100088557 | Weingarten et al. | Apr 2010 | A1 |
| 20100091535 | Sommer et al. | Apr 2010 | A1 |
| 20100095186 | Weingarten | Apr 2010 | A1 |
| 20100110787 | Shalvi et al. | May 2010 | A1 |
| 20100115376 | Shalvi et al. | May 2010 | A1 |
| 20100122113 | Weingarten et al. | May 2010 | A1 |
| 20100124088 | Shalvi et al. | May 2010 | A1 |
| 20100131580 | Kanter et al. | May 2010 | A1 |
| 20100131806 | Weingarten et al. | May 2010 | A1 |
| 20100131809 | Katz | May 2010 | A1 |
| 20100131826 | Shalvi et al. | May 2010 | A1 |
| 20100131827 | Sokolov et al. | May 2010 | A1 |
| 20100131831 | Weingarten et al. | May 2010 | A1 |
| 20100146191 | Katz | Jun 2010 | A1 |
| 20100146192 | Weingarten et al. | Jun 2010 | A1 |
| 20100149881 | Lee et al. | Jun 2010 | A1 |
| 20100172179 | Gorobets et al. | Jul 2010 | A1 |
| 20100174853 | Lee et al. | Jul 2010 | A1 |
| 20100180073 | Weingarten et al. | Jul 2010 | A1 |
| 20100199149 | Weingarten et al. | Aug 2010 | A1 |
| 20100211724 | Weingarten | Aug 2010 | A1 |
| 20100211833 | Weingarten | Aug 2010 | A1 |
| 20100211856 | Weingarten | Aug 2010 | A1 |
| 20100241793 | Sugimoto et al. | Sep 2010 | A1 |
| 20100246265 | Moschiano et al. | Sep 2010 | A1 |
| 20100251066 | Radke | Sep 2010 | A1 |
| 20100253555 | Weingarten et al. | Oct 2010 | A1 |
| 20100257309 | Barsky et al. | Oct 2010 | A1 |
| 20100269008 | Leggette et al. | Oct 2010 | A1 |
| 20100293321 | Weingarten | Nov 2010 | A1 |
| 20100318724 | Yeh | Dec 2010 | A1 |
| 20110051521 | Levy et al. | Mar 2011 | A1 |
| 20110055461 | Steiner et al. | Mar 2011 | A1 |
| 20110093650 | Kwon et al. | Apr 2011 | A1 |
| 20110096612 | Steiner et al. | Apr 2011 | A1 |
| 20110099460 | Dusija et al. | Apr 2011 | A1 |
| 20110119562 | Steiner et al. | May 2011 | A1 |
| 20110153919 | Sabbag | Jun 2011 | A1 |
| 20110161775 | Weingarten | Jun 2011 | A1 |
| 20110194353 | Hwang et al. | Aug 2011 | A1 |
| 20110209028 | Post et al. | Aug 2011 | A1 |
| 20110214029 | Steiner et al. | Sep 2011 | A1 |
| 20110214039 | Steiner et al. | Sep 2011 | A1 |
| 20110246792 | Weingarten | Oct 2011 | A1 |
| 20110246852 | Sabbag | Oct 2011 | A1 |
| 20110252187 | Segal et al. | Oct 2011 | A1 |
| 20110252188 | Weingarten | Oct 2011 | A1 |
| 20110271043 | Segal et al. | Nov 2011 | A1 |
| 20110302428 | Weingarten | Dec 2011 | A1 |
| 20120001778 | Steiner et al. | Jan 2012 | A1 |
| 20120005554 | Steiner et al. | Jan 2012 | A1 |
| 20120005558 | Steiner et al. | Jan 2012 | A1 |
| 20120005560 | Steiner et al. | Jan 2012 | A1 |
| 20120008401 | Katz et al. | Jan 2012 | A1 |
| 20120008414 | Katz et al. | Jan 2012 | A1 |
| 20120017136 | Ordentlich et al. | Jan 2012 | A1 |
| 20120051144 | Weingarten et al. | Mar 2012 | A1 |
| 20120063227 | Weingarten et al. | Mar 2012 | A1 |
| 20120066441 | Weingarten | Mar 2012 | A1 |
| 20120110250 | Sabbag et al. | May 2012 | A1 |
| 20120124273 | Goss et al. | May 2012 | A1 |
| 20120246391 | Meir et al. | Sep 2012 | A1 |
| 20140056066 | Baum et al. | Feb 2014 | A1 |
| Entry |
|---|
| Search Report of PCT Patent Application WO 2009/118720 A3, Mar 4, 2010. |
| Search Report of PCT Patent Application WO 2009/095902 A3, Mar 4, 2010. |
| Search Report of PCT Patent Application WO 2009/078006 A3, Mar 4, 2010. |
| Search Report of PCT Patent Application WO 2009/074979 A3, Mar 4, 2010. |
| Search Report of PCT Patent Application WO 2009/074978 A3, Mar 4, 2010. |
| Search Report of PCT Patent Application WO 2009/072105 A3, Mar 4, 2010. |
| Search Report of PCT Patent Application WO 2009/072104 A3, Mar 4, 2010. |
| Search Report of PCT Patent Application WO 2009/072103 A3, Mar 4, 2010. |
| Search Report of PCT Patent Application WO 2009/072102 A3, Mar 4, 2010. |
| Search Report of PCT Patent Application WO 2009/072101 A3, Mar 4, 2010. |
| Search Report of PCT Patent Application WO 2009/072100 A3, Mar 4, 2010. |
| Search Report of PCT Patent Application WO 2009/053963 A3, Mar 4, 2010. |
| Search Report of PCT Patent Application WO 2009/053962 A3, Mar 4, 2010. |
| Search Report of PCT Patent Application WO 2009/053961 A3, Mar 4, 2010. |
| Search Report of PCT Patent Application WO 2009/037697 A3, Mar 4, 2010. |
| Yani Chen, Kcshab K. Parhi, “Small Area Parallel Chien Search Architectures for Long BCH Codes”, Ieee Transactions on Very Large Scale Integration(VLSI) Systems, vol. 12, No. 5, May 2004. |
| Yuejian Wu, “Low Power Decoding of BCH Codes”, Nortel Networks, Ottawa, Ont., Canada, in Circuits and systems, 2004. ISCAS '04. Proceeding of the 2004 International Symposium on Circuits and Systems, published May 23-26, 2004, vol. 2, pp. II-369-II-372 vol. 2. |
| Michael Purser, “Introduction to Error Correcting Codes”, Artech House Inc., 1995. |
| Ron M. Roth, “Introduction to Coding Theory”, Cambridge University Press, 2006. |
| Akash Kumar, Sergei Sawitzki, “High-Throughput and Low Power Architectures for Reed Solomon Decoder”, (a.kumar at tue.nl, Eindhoven University of Technology and sergei.sawitzki at philips.com), Oct. 2005. |
| Todd K.Moon, “Error Correction Coding Mathematical Methods and Algorithms”, A John Wiley & Sons, Inc., 2005. |
| Richard E. Blahut, “Algebraic Codes for Data Transmission”, Cambridge University Press, 2003. |
| David Esseni, Bruno Ricco, “Trading-Off Programming Speed and Current Absorption in Flash Memories with the Ramped-Gate Programming Technique”, Ieee Transactions on Electron Devices, vol. 47, No. 4, Apr. 2000. |
| Giovanni Campardo, Rino Micheloni, David Novosel, “VLSI-Design of Non-Volatile Memories”, Springer Berlin Heidelberg New York, 2005. |
| John G. Proakis, “Digital Communications”, 3rd ed., New York: McGraw-Hill, 1995. |
| J.M. Portal, H. Aziza, D. Nee, “EEPROM Memory: Threshold Voltage Built in Self Diagnosis”, ITC International Test Conference, Paper 2.1, Feb. 2005. |
| J.M. Portal, H. Aziza, D. Nee, “EEPROM Diagnosis Based on Threshold Voltage Embedded Measurement”, Journal of Electronic Testing: Theory and Applications 21, 33-42, 2005. |
| G. Tao, A. Scarpa, J. Dijkstra, W. Stidl, F. Kuper, “Data retention prediction for modern floating gate non-volatile memories”, Microelectronics Reliability 40 (2000), 1561-1566. |
| T. Hirncno, N. Matsukawa, H. Hazama, K. Sakui, M. Oshikiri, K. Masuda, K. Kanda, Y. Itoh, J. Miyamoto, “A New Technique for Measuring Threshold Voltage Distribution in Flash EEPROM Devices”, Proc. IEEE 1995 Int. Conference on Microelectronics Test Structures, vol. 8, Mar. 1995. |
| Boaz Eitan, Guy Cohen, Assaf Shappir, Eli Lusky, Amichai Givant, Meir Janai, Ilan Bloom, Yan Polansky, Oleg Dadashev, Avi Lavan, Ran Sahar, Eduardo Maayan, “4-bit per Cell NROM Reliability”, Appears on the website of Saifun.com , 2005. |
| Paulo Cappelletti, Clara Golla, Piero Olivo, Enrico Zanoni, “Flash Memories”, Kluwer Academic Publishers, 1999. |
| JEDEC Standard, “Stress-Test-Driven Qualification of Integrated Circuits”, JEDEC Solid State Technology Association. JEDEC Standard No. 47F pp. 1-26, Dec. 2007. |
| Dempster, et al., “Maximum Likelihood from Incomplete Data via the EM Algorithm”, Journal of the Royal Statistical Society. Series B (Methodological), vol. 39, No. 1 (1997), pp. 1-38. |
| Mielke, et al., “Flash EEPROM Threshold Instabilities due to Charge Trapping During Program/Erase Cycling”, IEEE Transactions on Device and Materials Reliability, vol. 4, No. 3, Sep. 2004, pp. 335-344. |
| Daneshbeh, “Bit Serial Systolic Architectures for Multiplicative Inversion and Division over GF (2)”, A thesis presented to the University of Waterloo, Ontario, Canada, 2005, pp. 1-118. |
| Chen, Formulas for the solutions of Quadratic Equations over GF (2), IEEE Trans. Inform. Theory, vol. IT-28, No. 5, Sep. 1982, pp. 792-794. |
| Berlekamp et al., “On the Solution of Algebraic Equations over Finite Fields”, Inform. Cont. 10, Oct. 1967, pp. 553-564. |
