The present invention relates generally to flash memory devices and more particularly to generating threshold values for use when reading flash memory devices.
A variety of conventional flash memory devices are described in the following US patents and patent documents: U.S. Pat. Nos. 6,751,766; 7,196,946; 7,203,874; US 2006/0101193 A1; US 2007/0180346 A1.
The state of the art is believed to be described by the following publications inter alia:
The disclosures of all publications and patent documents mentioned in the specification, and of the publications and patent documents cited therein directly or indirectly, are hereby incorporated by reference.
Nowadays, flash memory devices store information with high density on Flash cells with ever-dec casing dimensions. In addition, Multi-Level Cells (MLC) store several bits per cell by setting the amount of charge in the cell. The amount of charge is then measured by a detector, calculated by a threshold voltage of the transistor gate. Due to inaccuracies during the programming procedure and charge loss due to time and temperature (also known as retention), the measured levels during a Read operation suffer from detection errors. The small dimensions of the Flash cells result in cells that can store very small amounts of charge, enhancing the effects of inaccuracies due to programming and retention. Thus, new single level cells (SLC) and Multi-Level Cell (MLC) devices have significantly increased bit error rate (BER), decreasing the reliability of the device.
Flash devices are organized into (physical) pages. Each page contains a section allocated for data (512 bytes-4K bytes) and a small number of bytes (16-32 bytes for every 512 data bytes) dedicated to redundancy and management information. The redundancy bytes are used to store error correcting information, for correcting errors which may have occurred up to and during the page Read. Each Read operation and each Write operation is performed on an entire page. A number of pages are grouped together to form an Erase Block (EB). A page cannot be erased unless the entire erase block which contains it is erased.
An important measure of a Flash device quality is the number of times (Np) it may be reprogrammed and the period (usually 10 years) that it can store data before irrecoverable errors occur. The higher the number of program-erase cycles, the higher as the bit error rate. Thus, today's Multi-Level Cell(MLC) devices can perform around Np=1000 cycles for 10 year retention before the allocation of 16-32 bytes of redundancy per 512 bytes of data bytes becomes insufficient to correct errors. Single level cell (SLC) devices usually perform better but obtain a much lower density and hence their prices are much higher. Following Np program-erase cycles the device is still operational but the bit error rate is higher. Furthermore, in many devices (e.g. NROM Flash devices), this behavior is predictable and it can be shown that the number of redundancy bytes required to correct these errors does not jump rapidly.
The reliability of a specific page or erase block is not known because, among others, the retention time is not known prior to reading, hence the decoding parameters are not known. Using a single decoding scheme may result in poor read performance (read time and power consumption). The ECC complexity may be designed for the end of life conditions and may force higher complexity decoding for pages that are more reliable or at the beginning of life.
Certain embodiments of the present invention seek to provide an improved flash memory device and improved methods for determining thresholds for use in reading from cells of the device. In some embodiments of the present invention, a set of representative cells is designated for monitoring deterioration, relative to highly reliable cells which store statistics (e.g. mean and/or standard deviation or even raw values) of the set of representative cells as originally programmed i.e. before deterioration. Cells may be adapted to be reliable e.g. by using them as single level cells and/or by using high-level error correction code. The set of representative cells may be set aside and not used for data (“controlled’ embodiments) or the set of representative cells is not set aside; instead, the representative cells are pre-designated (“earmarked”) ones from among the normal data cells and are used throughout to store normal, uncontrolled data (“blind” embodiments).
In some embodiments, only one set of representative cells is designated for each erase sector, as opposed to embodiments in which each and every page in the erase sector has its own set of representative cells. In the former, per-erase sector embodiments, typically, a reliably stored indicator (“offset cell”) in each page indicates the interval of time which elapsed between the programming of the per-erase sector representative cells and the programming of the page in question, thereby allowing retention time between the programming of a certain page and its reading to be obtained. Alternatively, in certain applications, all pages in each erase sector may be programmed at approximately the same time.
It is appreciated that optionally, typically to save memory which may be required for storing representative cell location information, representative cells may be provided at a uniform, predetermined location within each page or each erase sector, such as at the beginning of each page, or at the beginning of each first page in each erase sector.
In controlled embodiments, the representative cells may be programmed with only a few levels, perhaps even only one. They are then read with high accuracy, which is generally time-consuming, in order to compute and store a deterioration-affected statistic thereof such as but not limited to a mean. Alternatively, to save reading time, the representative cells may be programmed with a more complex “ramp” or range of almost continuous values corresponding in size to the maximum extent of deterioration. For example, if the flash memory device is intended for use over a 10 year period over which the deterioration that may be expected to occur is 0.5 V at most, a range of values from 0 V to 0.5 V may be programmed into the representative cells. When reading takes place, it is then only necessary to determine how many of the cells lie below a certain value as opposed to above, however, the “ramp” embodiment may require more representative cells than its alternative.
Representative cells may be used to determine reading thresholds for each reading operation, so as to take into account the deterioration which may have taken place up until the time at which an individual reading operation happens to be taking place. For example, current values in the representative cells may be compared to the mean or other deterioration affected statistic of the representative cells which has been stored in reliable cells since the time of writing. The ratio between current and reliably stored statistics may be multiplied by an original reading threshold to obtain a new reading threshold which adapts to the deterioration that has occurred since the original threshold was determined. Alternatively, the representative cells may be used to compute a deterioration affected statistic such as a mean and a look up table may be used that associates this statistic with a retention time. Another look up table is used to return a set of new threshold values, for each retention time value obtained from the first table and each number of program/erase cycles.
Flash memory device cells are conventionally divided into 3 types:
There is thus provided, in accordance with at least one embodiment of the present invention, a method for converting a measured physical level of a cell into a logical value, in an array of memory cells storing physical levels which diminish over time, the method comprising determining extent of deterioration of the physical levels and determining thresholds accordingly for at least an individual cell in the array; and reading the individual cell including reading a physical level in said cell and converting said physical level into a logical value using at least some of said thresholds, wherein said determining extent of deterioration comprises storing predefined physical levels rather than data-determined physical levels in each of a plurality of cells and determining extent of deterioration by computing deterioration of said predefined physical levels.
It is appreciated that reading need not take place immediately after threshold determination. In general the order of operations and duration of time elapsing between operations shown and described herein is not intended to be limiting and can be determined at will in accordance with the particular demands of each application.
Further in accordance with at least one embodiment of the present invention, the predefined physical levels are maximum physical levels.
Still further in accordance with at least one embodiment of the present invention, determining extent of deterioration comprises determining deterioration of said predefined physical levels and assuming that said deterioration is a known function of said physical levels.
Additionally in accordance with at least one embodiment of the present invention, the known function comprises a linear function.
Still further in accordance with at least one embodiment of the present invention, storing comprises storing said predefined physical levels in cells whose reliability is no different than the reliability of those cells in the array which are not used for storing said predefined physical levels.
Further in accordance with at least one embodiment of the present invention, to said array comprises more than one erase sector, each of which includes a subset of cells which together undergo cycles affecting said extent of deterioration; and wherein said determining of said extent of deterioration is performed no more than once per erase sector.
Still further in accordance with at least one embodiment of the present invention, the array of digital memory cells comprises a plurality of pages characterized in that the cells within each page are written onto as a single operation and wherein said determining is performed no more than once per page.
Also provided, in accordance with at least one embodiment of the present invention, is a method for determining thresholds useful for converting cell physical levels into cell logical values in an array of digital memory cells storing physical levels which diminish over time, the method comprising determining extent of deterioration of the physical levels and determining thresholds accordingly for at least an individual cell in said array; and reading said individual cell including using reading a physical level in said cell and converting said physical level into a logical value using said thresholds.
Further in accordance with at least one embodiment of the present invention, determining comprises computing extent of deterioration by determining deterioration of said predefined physical levels in each of a plurality of cells.
Still further in accordance with at least one embodiment of the present invention, reading comprises binary reading and wherein said predefined physical levels comprise an ascending sequence of physical levels.
Further in accordance with at least one embodiment of the present invention, the ascending sequence is evenly spaced.
Still further in accordance with at least one embodiment of the present invention, the array comprises more than one erase sector, each of which includes a subset of cells which together undergo cycles affecting said extent of deterioration; wherein said determination of extent of deterioration comprises storing predefined physical levels rather than data physical levels in each of a plurality of cells and wherein said storing is performed no more than once per erase sector.
Further in accordance with at least one embodiment of the present invention, the physical levels comprise charge levels.
Also provided, in accordance with at least one embodiment of the present as invention, is a computer program product comprising a computer useable medium having computer readable program code having embodied therein a method for determining thresholds useful for converting cell physical levels into cell logical values in an array of memory cells storing physical levels which diminish over time, said computer program product comprising computer readable program code for determining extent of deterioration of the physical levels and determining thresholds accordingly for at least an individual cell in said array; and reading said individual cell including using reading a physical level in said cell and converting said physical level into a logical value using said thresholds, wherein said determining comprises storing predefined physical levels rather than data-determined physical levels in each of a plurality of cells and computing extent of deterioration by determining deterioration of said predefined physical levels.
Also provided, in accordance with still another embodiment of the present invention, is a system for determining thresholds useful for converting cell physical levels into cell logical values in an array of memory cells storing physical levels which diminish over time, the system comprising deterioration determining apparatus determining extent of deterioration of the physical levels and determining thresholds accordingly for at least an individual cell in said array; and reading circuitry operative to read said individual cell including reading a physical level in said cell and converting said physical level into a logical value using said thresholds, wherein said deterioration determining apparatus is operative to store predefined physical levels rather than data-determined physical levels in each of a plurality of cells and to compute extent of deterioration by determining deterioration of said predefined physical levels.
Still further provided, in accordance with yet another embodiment of the present invention, is a method for determining thresholds useful for converting cell physical levels into cell logical values in an array of memory cells storing physical levels which diminish over time, the method comprising determining extent of deterioration of the physical levels by comparing at least a central tendency of previous physical levels with at least a central tendency of current physical levels and determining thresholds accordingly for at least an individual cell in said array; and reading said individual cell including reading a physical level in said cell and converting said physical level into a logical value using said thresholds.
Also provided, in accordance with another embodiment of the present invention, is a method for determining thresholds useful for converting cell physical levels into cell logical values in an array of memory cells storing physical levels which diminish over time, the method comprising determining extent of deterioration of the physical levels and systematically determining thresholds accordingly for at least an individual cell in said array; and reading said individual cell including reading a physical level in said cell and converting said physical level into a logical value using said thresholds.
Further in accordance with at least one embodiment of the present invention, the systematic determination of thresholds comprises computation of thresholds.
Still further in accordance with at least one embodiment of the present invention, said computation assumes linearity of deterioration throughout the range of physical levels stored in individual cells in said array.
Additionally in accordance with at least one embodiment of the present invention, said computation does not assume linearity of deterioration throughout the range of physical levels stored in individual cells in said array.
Further in accordance with at least one embodiment of the present invention, said systematic determination of thresholds comprises use of a look-up table.
Also provided, in accordance with yet another embodiment of the present invention, is a method for determining thresholds useful for converting cell physical levels into cell logical values in an array of memory cells storing physical levels which diminish over time, the method comprising determining extent of deterioration of the to physical levels and determining thresholds accordingly for at least an individual cell in said array; and reading said individual cell including reading a physical level in said cell and converting said physical level into a logical value using said thresholds, wherein said determining comprises reliably storing at least a central tendency of only a subset of original physical values of said array of memory cells and computing extent of deterioration by comparing, generally at the same time as reading, at least said central tendency of said subset of original physical values to at least a central tendency of corresponding current physical values.
Further in accordance with at least one embodiment of the present invention, determining extent of deterioration comprises determining deterioration of said predefined physical levels and assuming a known function of deterioration as a function of program/erase cycle number.
Still further in accordance with at least one embodiment of the present invention, determining extent of deterioration comprises determining deterioration of said predefined physical levels and assuming a known function of deterioration as a function of address of said predefined physical levels.
Also provided, in accordance with at least one embodiment of the present invention, is a computer program product comprising a computer useable medium having computer readable program code having embodied therein a method for determining thresholds useful for converting cell physical levels into cell logical values in an array of memory cells storing physical levels which diminish over time, said computer program product comprising computer readable program code for determining extent of deterioration of the physical levels and determining thresholds accordingly for at least an individual cell in said array; and reading said individual cell including using reading a physical level in said cell and converting said physical level into a logical value using said thresholds.
Further provided, in accordance with at least one embodiment of the present invention, is a computer program product comprising a computer usable medium having computer readable program code having embodied therein a method for determining thresholds useful for converting cell physical levels into cell logical values so in an array of memory cells storing physical levels which diminish over time, said computer program product comprising computer readable program code for determining extent of deterioration of the physical levels by comparing at least a central tendency of previous physical levels with at least a central tendency of current physical levels and determining thresholds accordingly for at least an individual cell in said array; and reading said individual cell including reading a physical level in said cell and converting said physical level into a logical value using said thresholds.
Also provided, in accordance with at least one embodiment of the present invention, is a computer program product comprising a computer useable medium having computer readable program code having embodied therein a method for determining thresholds useful for converting cell physical levels into cell logical values in an array of memory cells storing physical levels which diminish over time, said computer program product comprising computer readable program code for determining extent of deterioration of the physical levels and systematically determining thresholds accordingly for at least an individual cell in said array; and reading said individual cell including reading a physical level in said cell and converting said physical level into a logical value using said thresholds.
Additionally provided, in accordance with at least one embodiment of the present invention, is a computer program product comprising a computer useable medium having computer readable program code having embodied therein a method for determining thresholds useful for converting cell physical levels into cell logical values in an array of memory cells storing physical levels which diminish over time, said computer program product comprising computer readable program code for determining extent of deterioration of the physical levels and determining thresholds accordingly for at least an individual cell in said array; and reading said individual cell including reading a physical level in said cell and converting said physical level into a logical value using said thresholds, wherein said determining comprises reliably storing at least a central tendency of only a subset of original physical values of said array of memory cells and computing extent of deterioration by comparing, generally at the same time as reading, at least said central tendency of said subset of original physical values to at least a central tendency of corresponding current physical values.
Further provided, in accordance with still another embodiment of the present invention, is a system for determining thresholds useful for converting cell physical levels into cell logical values in an array of memory cells storing physical levels which diminish over time, the system comprising deterioration determining apparatus determining extent of deterioration of the physical levels and determining thresholds accordingly for at least an individual cell in said array; and reading circuitry operative to read said individual cell including reading a physical level in said cell and converting said physical level into a logical value using said thresholds, wherein said array comprises more than one erase sectors, each of which including a subset of cells which together undergo cycles affecting said extent of deterioration; wherein said deterioration determining apparatus comprises apparatus for storing predefined physical levels rather than data physical levels in each of a plurality of cells, the apparatus for storing being characterized in that said storing is performed no more than once per erase sector.
Further provided, in accordance with at least one embodiment of the present invention, is a system for determining thresholds useful for converting cell physical levels into cell logical values in an array of memory cells storing physical levels which diminish over time, the system comprising deterioration determining apparatus determining extent of deterioration of the physical levels by comparing at least a central tendency of previous physical levels with at least a central tendency of current physical levels and determining thresholds accordingly for at least an individual cell in said array; and reading circuitry operative to read said individual cell including reading a physical level in said cell and converting said physical level into a logical value using said thresholds.
Also provided, in accordance with at least one embodiment of the present invention, is a system for determining thresholds useful for converting cell physical levels into cell logical values in an array of memory cells storing physical levels which diminish over time, the system comprising deterioration determining apparatus determining extent of deterioration of the physical levels and systematically determining thresholds accordingly for at least an individual cell in said array; and reading circuitry operative to read said individual cell including reading a physical level in said cell and converting said physical level into a logical value using said thresholds.
Further provided, in accordance with at least one embodiment of the present invention, is a system for determining thresholds useful for converting cell physical levels into cell logical values in an array of memory cells storing physical levels which diminish over time, the system comprising deterioration determining apparatus determining extent of deterioration of the physical levels and determining thresholds accordingly for at least an individual cell in said a may; and reading circuitry operative to read said individual cell including reading a physical level in said cell and converting said physical level into a logical value using said thresholds, wherein said deterioration determining apparatus is operative to reliably store at least a central tendency of only a subset of original physical values of said array of memory cells and compute extent of deterioration by comparing, generally at the same time as reading circuitry read, at least said central tendency of said subset of original physical values to at least a central tendency of corresponding current physical values.
Further in accordance with at least one embodiment of the present invention, as said plurality of cells comprises a number of cells selected to as to achieve a level of reading errors which does not exceed a predetermined acceptable level.
Still further in accordance with at least one embodiment of the present invention, reading comprises using error correction code to eliminate errors and wherein said predetermined acceptable level comprises a predetermined maximum proportion of so pages containing so many errors as to be uncorrectable by said error correction code.
Additionally in accordance with at least one embodiment of the present invention, determining extent of deterioration is performed no more than once per erase sector and said threshold determining is performed once for each of a plurality of pages included in each erase sector.
Further in accordance with at least one embodiment of the present invention, said array comprises more than one erase sector, each of which includes a subset of cells which together undergo cycles affecting said extent of deterioration; wherein said determining extent of deterioration comprises storing predefined physical levels rather than data physical levels in each of a plurality of cells and wherein said storing is performed no more than once per erase sector.
Also provided, in accordance with at least one embodiment of the present invention, is a method for using an array of memory cells storing physical levels which diminish over time, the method comprising determining extent of deterioration of the physical levels; and using said array of memory cells so as to take into account said extent of deterioration.
The following terms may be construed either in accordance with any definition thereof appearing in the prior art literature or in accordance with the specification, or as follows:
Unless specifically stated otherwise, as apparent from the following discussions, it is appreciated that throughout the specification discussions, utilizing terms such as, “processing”, “computing”, “selecting”, “ranking”, “grading”, “calculating”, “determining”, “generating”, “reassessing”, “classifying”, “generating”, “producing”, “stereo-matching”, “registering”, “detecting”, “associating”, “superimposing”, “obtaining” or the like, refer to the action and/or processes of a computer or computing system, or processor or similar electronic computing device, that manipulate and/or transform data represented as physical, such as electronic, quantities within the computing system's registers and/or memories into other data similarly represented as physical quantities within the computing system's memories, registers or other such information storage, transmission or display devices.
In this specification, the terms “decision levels” and “threshold levels” are used interchangeably. “Reliably storing” and “reliable” are used to indicate that certain information is stored with high reliability in the sense that it can be expected to be read without error throughout the guaranteed lifetime of the flash memory device.
Any suitable processor, display and input means may be used to process, display, store and accept information, including computer programs, in accordance with some or all of the teachings of the present invention, such as but not limited to a conventional personal computer processor, workstation or other programmable device or computer or electronic computing device, either general-purpose or specifically constructed, for processing; a display screen and/or printer and/or speaker for displaying; machine-readable memory such as optical disks, CDROMs, magnetic-optical discs or other discs; RAMs, ROMs, EPROMs, EEPROMs, magnetic or optical or other cards, for storing, and keyboard or mouse for accepting. The term “process” as used above is intended to include any type of computation or manipulation or transformation of data represented as physical, e.g. electronic, phenomena which may occur or reside e.g. within registers and/or memories of a computer.
The above devices may communicate via any conventional wired or wireless digital communication means, e.g. via a wired or cellular telephone network or a computer network such as the Internet.
The apparatus of the present invention may include, according to certain embodiments of the invention, machine readable memory containing or otherwise storing a program of instructions which, when executed by the machine, implements some or all of the apparatus, methods, features and functionalities of the invention shown and described herein. Alternatively or in addition, the apparatus of the present invention may include, according to certain embodiments of the invention, a program as above which may be written in any conventional programming language, and optionally a machine for executing the program such as but not limited to a general purpose computer which may optionally be configured or activated in accordance with the teachings of the present invention.
Any trademark occurring in the text or drawings is the property of its owner and at occurs herein merely to explain or illustrate one example of how an embodiment of the invention may be implemented.
Certain embodiments of the present invention are illustrated in the following drawings:
Reference is now made to
A read threshold, T* (also termed herein T_read) is used to distinguish between each two adjacent programming charge levels. Generally these two charge levels comprise physical values clustering normally around a first charge C_1, and physical values clustering normally around a second charge level C_2.
As described in detail below, T_read may be computed by dedicating a first subset of the representative cells, comprising at least one and typically several representative cells, to storing C_1. A second subset of the representative cells, comprising at least one and typically several representative cells is dedicated to storing C_2. These two subsets can be used to compute the read threshold level when it is desired to read, e.g. using the following formula also termed herein the “read-threshold computation formula”, where the means and standard deviations of the first and second subsets are represented by m and sigma respectively, and suitable subscripts 1 or 2:
m—mean
σ—standard deviation
The above formula computes the reading threshold as a weighted average of the mean present values in the two subsets, weighted by the standard deviations of the two subsets. Optionally, the reading threshold as computed above may be further adjusted to take into account coupling between adjacent cells. It is appreciated that the mean and standard deviation of adjacent levels may be estimated using the representative cells. If the standard deviation is equal for all levels, the optimal decision level may be computed as a simple average between two adjacent means.
Various embodiments for computing read thresholds are described hereinbelow in detail.
Reference is now made to
The flash memory device also includes circuitry for erasing data from cells 140, erase sector by erase sector rather than cell by cell, writing data into cells typically page by page, and reading data from cells, page by page (e.g. in NAND type flash memory) or cell by cell (e.g. in NOR type flash memory). The circuitry performing these functions is referenced herein as erasing circuitry 150, writing circuitry 160 and reading circuitry 170 respectively. An array of cycle counters 155 count, for each erase sector respectively, all erase-write cycles performed on that sector.
According to certain embodiments of the present invention, each erase sector includes at least one and optionally exactly one set of representative cells 172 whose cells are typically programmed during the manufacturing stage, and at least one high-reliability “statistic cell” 174 storing, e.g. previous mean information and/or previous standard deviation information regarding the representative cells 172 as described in detail herein. A direct physical value deterioration estimation unit 190 and a systematic read-threshold determination unit 180, which together are termed herein a read threshold estimator or “estimator” 192, interact with the representative cells 172 and high-reliability statistic cells 174 to generate read-thresholds and/or to estimate the extent of data deterioration, as described in detail herein with reference to
It is appreciated that certain embodiments of the systems and methods shown and described herein typically include at least one of the following features:
High reliability cells are typically designed to store data so that the data can be retrieved without error even after cycling and retention. For example, high reliability cells may comprise single-level cells and/or may store BCH-encoded data with a large proportion of redundant bits such as 50% redundant bits. Or, to give a particularly simple ex ample, high reliability cells may store each bit of information repeated many times such as 8 times.
In contrast, in prior art flash memory systems with n-level cells, n−1 histogram values may be stored for each page, representing the original (before cycling and retention) distribution of physical values over the page. Each such histogram value typically must be stored at a resolution of a few dozen bits, since there are typically at least 1000 cells per page. Therefore, certain embodiments of the present invention may require as little as 4-5 bits of high-reliability storage per erase sector, as opposed to certain prior art systems which may require several thousand bits of high-r liability storage for each of the dozens or even hundreds of physical pages in the erase sector.
The embodiments of
In all of
In the per-erase sector embodiments of
More generally, the time that has elapsed between programming and reading of a particular page is used as an indicator of deterioration. In per-page embodiments, this time can be directly estimated by comparing, e.g. subtracting, current (reading time) values of representative cells on a particular page, with highly reliably stored statistics of their values at time of programming. In per-erase sector embodiments, however, this time interval is estimated by subtracting an indicator of the time interval between writing and erasing, from an indicator of the time interval between reading and erasing. The representative cells' mean, variance or SNR serve as an indicator of the time interval between reading and erasing, whereas the corresponding statistic stored in the offset cell serves as an indicator of the time interval between writing and erasing.
It is appreciated that change in various statistics of the representative cells may be used to quantify the extent of deterioration, and, accordingly, to adjust reading thresholds, such as but not limited to any of the following:
The above formulae represent, respectively, current mean; current variance; proportion between current mean and stored original mean; current SNR i.e. proportion between current mean and current variance; and difference between current SNR and original SNR, where “current” refers to values existing during reading and “original” refers to values existing during erasing or during writing.
Generally, SNR is defined as follows, where V_training_cell_i refers to the physical value stored in a individual one of the representative cells, N is the number of representative cells, and W is the window defined in
In step 310, conventionally provide a memory device 105 having erasing circuitry 150, writing circuitry 160, and reading circuitry 170; a micro-controller 110 controlling these; and erase sectors 120 (typically from a few to a few dozen); each erase sector including physical pages 130 (typically a few hundred), each physical page including cells 140, each erase sector being erased as a unit by the erasing circuitry, each page being written into e.g. as a unit by the writing circuitry 160.
In step 320, a sequence of logical values D_0, D_1, . . . , each comprising an n-tuple of bits, which it is desired to represent within the cells 140 of the memory device 105, is predetermined, such as D_0=0=(0,0), D_1=1=(0,1), D_2=2=(1,0), D_3=3=(1,1)
In step 330, configuration of mapping is performed: typically at the manufacturing stage, configure at least one of the micro-controller 110, reading circuitry 170 and writing circuitry 160 to cause individual cells 140 in the memory device 105 to return a predetermined one of the predetermined sequence of logical values D_0, D_1, . . . , if the memory cell 140 is found to be loaded with a corresponding one of a corresponding sequence of central physical values C_0, C_1, . . . e.g. charge levels. Each charge level (except the lowest and highest) falls within a pair of programmable threshold physical values disposed on either side of the central physical value. In the above example, the sequence of charge levels corresponding to the sequence D_0, D_1, D_2, D_3 of logical values is C_0, C_1, C_2, and C_3. There may be 3 original threshold values T_0, T_1, T_2, and T_3 where central value C_0 is located below T_0, C_1 is located between T_0 and T_1, C_2 is located between T_1 and T_2, and C_3 is located above T_2. If the micro-controller finds a charge between T_i and T_(i+1) in an individual cell, the micro-controller associates the cell with the logical value i (i=0, 1, 2, 3).
For example, C_0, C_1, C_2, and C_3 may be −1 V, 1 V, 3 V and 5 V respectively, and T_1, T_2, and T_3 may be 0 V, 2 V and 4 V respectively i.e. each threshold value may be halfway between the C values on either side of it.
In step 340, microcontroller 110 sets up erase sectors including reserving a representative set in each erase sector (
In step 350 perform conventional writing of pages, but (in
In step 360, thresholds for pages now being read are updated: estimator 192 computes new values for the controller's programmable threshold values by measuring current physical level values from at least some of the set of representative cells and comparing these current representative levels to the statistical cells which store means of the corresponding original representative levels thereby to determine an extent of degradation currently characterizing the set of representative cells and hence all pages currently being written to in the erase sector (
In step 370, de-mapping is performed: reading circuitry 170 reads pages using updated read thresholds received from estimator 192: micro-controller 110 causes individual cells 140 in the current page in the current erase sector to return a predetermined one of the predetermined sequence of logical values, by comparing the charge level found in each cell, with the up-to-date read thresholds computed in step 630 of
In step 410, micro-controller 110 instructs erasing circuitry 150 to erase a sector.
In step 420, at about the same time, micro-controller 110 designates at least one set (e.g. 172) of representative cells e.g. 20 representative cells, per erase sector, e.g. 1 representative set per erase sector (per-erase sector (per-erase sector embodiments of
In step 430 performed in controlled embodiments e.g. as per
In step 435, micro-controller 110 stores, in a high-reliability location e.g. statistics cells 174, 210 or 212, at least one statistic of the charge levels stored in each set of representative cells e.g. central tendency (mean(M_erase), median, or mode) and/or standard deviation And/or even at least some of the charge levels themselves.
In step 510, for each cell 140, writing circuitry 160 receives, ultimately from the outside agent 100, a specific logical value D_i.
In step 520, writing circuitry 160 maps value D_i into a current cell 140 in current page 130 in a current erase sector 120 by generating, in the cell, an initial physical value e.g. charge level (or electrical current level or voltage level) P_Ii belonging to a known random distribution, due to physical effects e.g. tunnel effect, of physical values centered about the central physical level C_i corresponding to the specific logical value D_i, wherein each initial physical level P_Ii tends to diminish over time. Charge or current or voltage levels in a cell may be generated in any suitable application-specific manner e.g. by changing resistance, changing capacitor voltage, or changing current, in the cell.
In step 610, direct physical value deterioration estimation unit 190 computes at least one current central characteristic, e.g. mean (or median or mode) of current charge levels in the case sectors representative set, M_read (
In step 620, direct physical value deterioration estimation unit 190 computes a proportion (threshold attenuation factor) alpha=M_read/M_write for the entire erase as sector (per-erase sector embodiments of
In step 630, for the entire erase sector (per-erase sector embodiments of
In the blind, per ES embodiment of
Referring again to
Any suitable number of representative cells may be provided. It may be desired to select a number of cells so as to achieve a level of reading errors which does not exceed a predetermined acceptable level. The predetermined level may for example comprise P_target, a predetermined maximum proportion of pages containing so many errors as to be uncorrectable by said error correction code. To achieve this, for applications in which gray coding is used as is conventional, the number of representative cells, N, may be selected on the basis of the following inequality:
In these applications, “hard values”, e.g. as defined below, are written into cells, and a precise read (also termed herein “soft read”) is used to estimate the statistics of the representative cells. As described above, the terms “Precise read” and “soft read” refer to reading cell threshold voltages at a precision (number of bits) greater than the number of Mapping levels (2^n) of the cell. In contrast, in “hard read”, cell threshold voltages are read at a precision (number of bits) smaller than the number of Mapping levels (2^n).
If it is desired to estimate the degradation proportion (threshold attenuation factor) in resolution of less than δ volts, the method of
In step 630, read the reliably stored original decision levels and adjust them by multiplying by the attenuation level M/N.
More generally and according to certain variations of the “soft” embodiment of as
Updating thresholds for pages now being read may comprise reading the cells in the representative set. The microcontroller 110 of
In contrast to the various embodiments shown and described herein,
Referring back to
Since each page has a different aging level a set of representative cells may be used to estimate its condition. A micro-controller may allocate a few cells in each page to store the pre-defined set of representative cells. This conventional, prior art approach is depicted in
Example: For 2 bits per cell and an un-coded bit error rate of 1E-3 a minimum window signal to noise ratio (SNR) of 28 (or 14.5 dB) is typically employed. Maintaining a slight degradation in the signal to noise ratio (SNR) requires approximately 100 cells for the set of representative cells. The SNR is computed as the ratio between the window variance and the noise variance.
However since the erase sector cycles are common to all pages within the erase a sector, the set of representative cells typically stores two types of data:
The “set of representative cells” described herein stores a “representative sequence” of data respectively which is known to the estimator 192. Hence, any deviation from the known values can be used to estimate aging of the flash memory device in the vicinity of these cells.
It is appreciated that the conventional process for providing flash memory devices includes an initial test chip product phase, followed by a configuration phase, also termed herein the “sort phase”, in which the test chips are configured for various applications. Finally, flash memory chips are manufactured for each of the desired applications, in a so-called manufacturing phase.
As described above with reference to the reading threshold computation step 360 of
It is appreciated that if in a particular application, deterioration of programmed values can safely be assumed to be linear with respect to the programmed values themselves, then as described above with reference to
However, in some applications, the representative cells do not include a subset dedicated to storing each of the central values C_i, and/or it is not desirable to assume that the deterioration of programmed values is linear with respect to the programmed values themselves. In such applications, the embodiment of
According to this embodiment, aging look up tables are typically generated during the “sort phase” of production. Typically, a number of devices is used which is sufficient to ascertain, by experiment, the nature of the aging process. All the devices are programmed with pre-defined data for a known number of program/erase cycles and are baked in an oven to simulate an accelerated retention process. According to some embodiments, the following model for the aging process is employed:
Vread=αVprogram+n
α=α(cycling,retention)
σn=σn(cycling,retention)
This model indicates that the physical value read from the cell is a linear function of the physical value originally programmed into the cell; the coefficient of the original value being a function both of cycling and retention; and the random free coefficient being characterized by variance whose magnitude is also a function both of cycling and retention as described e.g. in Neal 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, September 2004, p. 335.
The aging look up tables (LUTs) may for ex ample comprise an effective memory age table, storing effective memory age (believed to be related to time between writing and reading) as a function of e.g. cycle counters and current mean values of the set of representative cells, or as a function of cycling and another measure of retention, and a reading threshold table, storing reading thresholds for the various levels stored in each flash memory cell, given aging values and cycle counter values. However, this is not intended to be limiting. Information relating reading thresholds to aging information may be stored in any suitable format, such as a first table storing effective memory age as a function of cycling and retention and a second table storing reading thresholds, also as a function of cycling and retention.
Step 710: Cycle the erase sector, increment the cycles by 100, program and erase the erase sector pages including the representative cells.
Step 720: Erase sector retention; bake the flash memory device for the equivalent of 1 year of retention.
Step 730: Read the representative cells and compute their mean, variance and/or SNR.
Step 740: Store the results in the first, effective memory age table (e.g. as shown in
Step 750: Compute the means and variances of all cells in the current erase sector.
Step 755: Compute optimal reading thresholds, e.g. as described below with reference to
Step 760: If the accumulative baking is 10 years then continue; otherwise go to step 720.
Step 765: Replace the flash memory device with a new flash memory device (cycles=0) and return to step 710. If the accumulative cycles have reached 1000 then stop.
Step 770: Erase sector cycles counter: read the value and round it to the nearest value in the reading thresholds table.
Step 775: Read the representative cells and compute their mean, variance or SNR.
Step 780: Read the offset cells from the current page and compute “offset mean” and “offset variance”. Subtract these from the representative cell mean and variance values, respectively, computed in step 775. Compute the “page mean”, “page variance” and “page SNR” and round them to the nearest entry in the second table.
Step 785: Use the contents of the nearest entry in the second table as reading thresholds.
A suitable method for generating the second, reading threshold look up table is now described in detail with reference to
(a) the flash device has undergone a known number of cycles as indicated by cycle counter 155 of
(b) a known amount of time has elapsed from programming to reading (from programming to the present). This amount of time may be known by relying on the information in the offset cells 200, in per-ES embodiments, or by comparing current (during reading) means to offset means e.g. as described above with reference to
It is appreciated that cycle counters are also termed, in the literature, the “wear level” and are typically maintained in the course of performing the device's wear leveling algorithm.
The experimental process typically is performed on an experimental set of flash memory devices of a particular species or a particular batch, typically comprising a number of devices, such as 100 devices or 1000 devices, large enough to make the experimental set representative of the entire batch or species. The process may comprise the following steps as shown in
Step 800: A known file, comprising a sequence of logical values, say logical values from among the following set: D_0=(0,0), D_1=(0,1), D_2=(1,0), D_3=(1,1), is written into each of these devices, by inducing the corresponding central values C_0, C_1, C_2, C_3.
Step 810: The charge levels of all cells in all devices in the experimental set are then read. Means of the sets of representative cells designated in accordance with an embodiment of the present invention, are stored at high reliability, to serve as “previous means” as shown and described herein. A mean and standard deviation are computed for the physical values read from the set of all cells storing D_0, in all devices in the experimental set. Similarly, a mean and a standard deviation are computed for each of the sets of cells, over all devices, storing D_1, D_2, and D_3 respectively. The above read-threshold computation formula is used to compute read thresholds T_READ_0, to T_READ_3, as a function of the means and standard deviations just computed, Which correspond to the logical values adjacent to each read threshold.
Step 820: A table is formed which stores the read thresholds as a function of a specific memory address, a specific percentage of deterioration (which generally is proportional to time elapsed) and a specific value of the cycle counter 155 of
Step 830: Step 810 is repeated, iteratively, each time subjecting all of the devices in the experimental set to a different number of cycles, 100 for example, the percent of deterioration is determined by computing current means of the representative cells in each erase sector/page of each device, and then computing ratios, for each erase sector/page of each device, between the current mean and the previous mean stored at high reliability in high-reliability statistic cell/s 174, 210, 200 or 212 (depending on the specific embodiment). The resulting read thresholds are stored for an address in which the percent of deterioration is as above, and cycle counter is equal to 100.
The resulting sets of read thresholds are stored, each set related to specific addresses i, cycling number and percent of deterioration (as computed after the respective number of cycles).
Step 840: Steps 810-830 are iteratively repeated, each successive iteration using a different and longer aging time. The time can be simulated on the devices. For example, the devices may be heated to a particular temperature, for a particular amount of time. Both temperature and time interval are conventionally used to simulate half a year of aging. This provides an additional set of entries in the table, in which the percent of deterioration of each entry is larger than the percent of deterioration of the corresponding entry computed in the course of the previous iteration.
Step 850: To use the above table at a given time to compute suitable reading thresholds for a particular erase sector or page, a current percent of deterioration for the erase sector is first computed by dividing current means of the erase sector's or page's representative cells, by the highly reliably stored previous means thereof. The number of cycles undergone by the erase sector or page therewithin is known from cycle counters 155 (
An example of how offset cells 200 in
Before an individual page in a particular erase sector is programmed, representative cells, either reserved as in
According to still a further embodiment of the present invention, a set of as representative cells may be allocated only once per memory device, rather than once per erase sector or even once per page, as shown.
It is appreciated that determination of reading thresholds is not the only application for use of knowledge pertaining to extent of deterioration in flash memory or other memory which tends to deteriorate. The scope of the present invention is intended to include any method for using an array of memory cells storing physical levels which diminish over time and which comprises determining extent of deterioration of the physical levels and using the array of memory cells so as to take into account the extent of deterioration. For example, it may be desired to “scrub”, or perform other manipulations on portions or all of a flash memory device when a predetermined level of deterioration is detected therein. Detection of the deterioration for this purpose might employ any of the methods shown and described herein. Methods for scrubbing are known and are described e.g. in U.S. Pat. No. 5,657,332 to Auclair et al, assigned to Sandisk and entitled “Soft errors handling in EEPROM devices”.
Any data described as being stored at a specific location in memory may so alternatively be stored elsewhere, in conjunction with an indication of the location in memory with which the data is associated. For example, instead of storing off-set cells or training cells within a specific page or erase sector, the same may be stored within the flash memory device's internal microcontroller or within a microcontroller interfacing between the flash memory device and the host, and an indication may be stored of the specific page or erase sector associated with the cells.
Certain operations are described herein as occurring in the microcontroller internal to a flash memory device. Such description is intended to include operations which may be performed by hardware which may be associated with the microcontroller such as peripheral hardware on a chip on which the microcontroller may reside. It is also appreciated that some or all of these operations, in any embodiment, may alternatively be performed by the external, host-flash memory device interface controller including operations which may be performed by hardware which may be associated with the interface controller such as peripheral hardware on a chip on which the interface controller may reside. Finally it is appreciated that the internal and external controllers may each physically reside on a single hardware device, or alternatively on several operatively associated hardware devices.
Included in the scope of the present invention, inter alia, are electromagnetic signals carrying computer-readable instructions for performing any or all of the steps of any of the methods shown and described herein, in any suitable order; machine-readable instructions for performing any or all of the steps of any of the methods shown and described herein, in any suitable order; program storage devices readable by machine, tangibly embodying a program of instructions executable by the machine to perform any or all of the steps of any of the methods shown and described herein, in any suitable order; a computer program product comprising a computer useable medium having computer readable program code having embodied therein, and/or including computer readable program code (for performing, any or all of the steps of any of the methods shown and described herein, in any suitable order; any technical effects brought about by any or all of the steps of any of the methods shown and described herein, when performed in any suitable order; any suitable apparatus or device or combination of such, programmed to perform, alone or in combination, any or all of the steps of any of the methods shown and described herein, in any suitable order; information storage devices or physical records, such as disks or hard drives, causing a computer or other device to be configured so as to carry out any or all of the steps of any of the methods shown and described herein, in any suitable order; a program pre-stored e.g. in memory or on an information network such as the Internet, before or after being downloaded, which embodies any or all of the steps of any of the methods shown and described herein, in any suitable order, and the method of uploading or downloading such, and a system including server/s and/or client/s for using such; and hardware which performs any or all of the steps of any of the methods shown and described herein, in any suitable order, either alone or in conjunction with software.
It is appreciated that software components of the present invention including programs and data may, if desired, be implemented in ROM (read only memory) form including CD-ROMs, EPROMs and EEPROMs, or may be stored in any other suitable computer-readable medium such as but not limited to disks of various kinds, cards of various kinds and RAMs. Components described herein as software may, alternatively, be implemented wholly or partly in hardware, if desired, using conventional techniques.
Features of the present invention which are described in the context of separate embodiments may also be provided in combination in a single embodiment. Conversely, features of the invention, including method steps, which are described for brevity in the context of a single embodiment or in a certain order may be provided separately or in any suitable subcombination or in a different order.
The invention shown and described herein includes the scope of all the following claims inter alia:
Priority is claimed from the following applications: U.S. Nonprovisional application Ser. No. 12/667,042, filed on Dec. 29, 2009 and entitled “Flash Memory Device with Physical Cell Value Deterioration Accommodation and Methods Useful in Conjunction Therewith”, now U.S. Pat. No. 8,321,625 issued Nov. 27, 2012; U.S. Provisional Application No. 60/996,782, filed Dec. 5, 2007 and entitled “Systems and Methods for Using a Training Sequence in Flash Memory”, now abandoned; U.S. Provisional Application No. 61/064,853, filed Mar. 31, 2008 and entitled “Flash Memory Device with Physical Cell Value Deterioration Accommodation and Methods Useful in Conjunction Therewith”, now abandoned; U.S. Provisional Application No. 61/006,805, filed Jan. 31, 2008 and entitled “A Method for Extending the Life of Flash Devices”, now abandoned; U.S. Provisional Application No. 61/071,465, filed Apr. 30, 2008 and entitled “Systems and Methods for Temporarily Retiring Memory Portions”, now abandoned; and U.S. Provisional Application No. 61/129,608, filed Jul. 8, 2008 and entitled “A Method for Acquiring and Tracking Detection Thresholds in Flash Devices”, now abandoned. Other applications include: U.S. Provisional Application No. 60/960,207, filed Sep. 20, 2007 and entitled “Systems and Methods for Coupling Detection in Flash Memory”, now abandoned; U.S. Provisional Application No. 61/071,467, filed Apr. 30, 2008 and entitled “Improved Systems and Methods for Determining Logical Values of Coupled Flash Memory Cells”, now abandoned; U.S. Provisional Application No. 60/960,943, filed Oct. 22, 2007 and entitled “Systems and methods to reduce errors in Solid State Disks and Large Flash Devices”, now abandoned; U.S. Provisional Application No. 61/071,469, filed Apr. 30, 2008 and entitled “Systems and Methods for Averaging Error Rates in Non-Volatile Devices and Storage Systems”, now abandoned; U.S. Provisional Application No. 60/996,027, filed Oct. 25, 2007 and entitled “Systems and Methods for Coping with Variable Bit Error Rates in Flash Devices”, now abandoned; U.S. Provisional Application No. 61/071,466, filed Apr. 30, 2008 and entitled “Systems and Methods for Multiple Coding Rates in Flash Devices”, now abandoned; U.S. Provisional Application No. 61/006,120, filed Dec. 19, 2007 and entitled “Systems and Methods for Coping with Multi Stage Decoding in Flash Devices,”, now abandoned; U.S. Provisional Application No. 61/071,464, filed Apr. 30, 2008 and entitled “A Decoder Operative to Effect A Plurality of Decoding Stages Upon Flash Memory Data and Methods Useful in Conjunction Therewith”, now abandoned; U.S. Provisional Application No. 61/006,385, filed Jan. 10, 2008 and entitled “A System for Error Correction Encoder and Decoder Using the Lee Metric and Adapted to Work on Multi-Level Physical Media”, now abandoned; U.S. Provisional Application No. 61/064,995, filed Apr. 8, 2008 and entitled “Systems and Methods for Error Correction and Decoding on Multi-Level Physical Media”, now abandoned; U.S. Provisional Application No. 60/996,948, filed Dec. 12, 2007 and entitled “Low Power BCH/RS Decoding: a Low Power Chien-Search Implementation”, now abandoned; U.S. Provisional Application No. 61/071,487, filed May 1, 2008 and entitled “Chien-Search System Employing a Clock-Gating Scheme to Save Power for Error Correction Decoder and other Applications”, now abandoned; U.S. Provisional Application No. 61/071,468, filed Apr. 30, 2008 and entitled “A Low Power Chien-Search Based BCH/RS Recoding System for Flash Memory, Mobile Communications Devices and Other Applications”, now abandoned; U.S. Provisional as Application No. 61/006,806, filed Jan. 31, 2008 and entitled “Systems and Methods for using a Erasure Coding in Flash memory”, now abandoned; U.S. Provisional Application No. 61/071,486, filed May 1, 2008 and entitled “Systems and Methods for Handling Immediate Data Errors in Flash Memory”, now abandoned; U.S. Provisional Application No. 61/006,078, filed Dec. 18, 2007 and entitled “Systems and Methods for Multi Rate Coding in Multi Level Flash Devices”, now abandoned; U.S. Provisional Application No, 61/064,923, filed Apr. 30, 2008 and entitled “Apparatus For Coding At A Plurality Of Rates In Multi-Level Flash Memory Systems, And Methods Useful In Conjunction Therewith”, now abandoned; U.S. Provisional Application No. 61/064,760, filed Mar. 25, 2008 and entitled “Hardware efficient implementation of rounding in fixed-point arithmetic”, now abandoned; U.S. Provisional Application No. 61/071,404, filed Apr. 28, 2008 and entitled “Apparatus and Methods for Hardware-Efficient Unbiased Rounding”, now abandoned; U.S. Provisional Application No. 61/136,234, filed Aug. 20, 2008 and entitled “A Method Of Reprogramming A Non-Volatile Memory Device Without Performing An Erase Operation”, now abandoned; U.S. Provisional Application No. 61/129,414, filed Jun. 25, 2008 and entitled “Improved Programming Speed in Flash so Devices Using Adaptive Programming”, now abandoned.
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 | Alexis 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 | Morris et al. | Mar 1998 | A |
5729490 | Calligaro et al. | Mar 1998 | A |
5740395 | Wells et al. | Apr 1998 | A |
5745418 | Ma et al. | Apr 1998 | A |
5778430 | Ish 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 | Ma et al. | Aug 1999 | A |
5956268 | Lee | Sep 1999 | A |
5956473 | Ma et al. | Sep 1999 | A |
5968198 | Balachandran et al. | 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 |
8321625 | Weingarten 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 | Toyama 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 | Lee 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 | 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 |
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. |
Number | Date | Country | |
---|---|---|---|
20130080691 A1 | Mar 2013 | US |
Number | Date | Country | |
---|---|---|---|
60996782 | Dec 2007 | US | |
61006805 | Jan 2008 | US | |
61064853 | Mar 2008 | US | |
61071465 | Apr 2008 | US | |
61129608 | Jul 2008 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12667042 | US | |
Child | 13681246 | US |