This application relates generally to managing data in a memory system. More specifically, this application relates to a flash memory implementing an improved programming sequence to repair failing flash memory bits.
Flash memory is composed of flash memory cells that store bits, with a flash memory Single Level Cell (SLC) storing a single bit and a flash memory Multi-Level Cell (MLC) storing multiple bits. When reading the stored bits from the flash memory cells, the bits may toggle from one read to the next. These bits are termed toggle bits. The toggle bits are information that are stored on the tail of a particular state of a flash memory cell, and are intrinsically invalid as the toggle bits are in-between normal states.
One solution to the problem of toggling bits is to iteratively test each of the possible values of the toggling bits. For example, a page in flash memory may have N toggling bits. This solution iteratively flips through the N toggling bits (potentially through each of the 2N possibilities), testing the possibilities using an error correction algorithm until the error correction algorithm indicates that one of the possibilities is valid. However, this solution is time-intensive (potentially requiring testing of 2N possibilities) and may not yield the correct result (since the error correction algorithm may indicate that multiple of the 2N possibilities are “valid”).
Another solution is to read the flash memory cell several times and use the majority count to decide if the toggling bit should be a one or zero. Then, the data pattern is again fed into a decoding algorithm or other error correction algorithm in order to determine if a valid code word results. However, the values of the toggling bits are often erratic, so that a majority count may not yield the correct result.
Still another solution is to add more parity bytes and use a more complex error correction decoder. Parity bytes and error correction coding are typically used to correct for errors in reading the flash memory cells. The additional parity bytes and more complex decoder, while potentially correcting for the toggling bits, may overly complicate the operation of the flash memory.
In order to address the problem of toggling bits, methods and systems are disclosed herein for intelligent bit recovery in a flash memory device.
According to a first aspect, a method of recovery of bits in the flash memory device is disclosed. The method comprises, in the flash memory device with a controller: determining N bits of data for recovery; selecting, based on at least one aspect of the flash memory device, potential bit patterns of the N bits, the potential bit patterns being smaller in number than 2N; and iteratively determining whether the potential bit patterns enable recovery of at least some of the N bits. Different types of analysis may be used in the bit recovery, including analysis to identify error bits, analysis to selects potential bit patterns for recovery of the error bits, and analysis to determine which of the selected potential bit patterns enables recovery of one or more of the error bits. For example, the N bit of data for recovery may be determined based on analysis to determine whether the N bits are toggling (such as based on reading the flash memory device multiple times and XORing the reads or using threshold shift commands).
As another example, the potential bit patterns may be selected based on one or more aspects of the flash device, such as based on: values of test bits (including whether one or more test ‘0’ bits toggle to ‘1’ or whether one or more test ‘1’ bits toggle to ‘0’); a type of bits that are toggling (such as whether the bits that are toggling are single level cells or multi-level cells, or such as whether the bits that are toggling are upper page bits or lower page bits); and a mode of the flash memory device (such as whether the flash memory device is operating before or after baking).
One, some or all of the potential bit patterns (which are less than 2N in number) may be used to recovery some or all of the N bits of data. For example, only the potential bit patterns for the particular flash memory device (such as if only bits in SLC cells are toggling, only bit patterns tailored to this problem) may be used. Alternatively, all of the potential bit patterns for all of the different aspects of the flash memory device may be used for iterative examination (such as bit patterns for both SLC and MLC cells may be used, even if only bits in MLC are toggling). In particular, because the number of bit patterns for all of the different aspects in the memory device are smaller in number than 2N (and can be smaller than N), all of the potential bit patterns may be used as a set for potential bit patterns for iterative examination. Further, the iterative determination whether the potential bit patterns enable recovery may stop once a specific potential bit pattern enables recovery. Alternatively, the iterative determination whether the potential bit patterns enable recovery may examine all of the potential bit pattern to determine which specific bit pattern best enables recovery (such as the specific bit pattern enables recovery of the most bits).
In another aspect, a method of recovery of bits in a flash memory device caused by one or more potential flash memory problems is disclosed. The method comprises, in the flash memory device with a controller: determining N bits of data for recovery; selecting potential bit patterns of the N bits, the potential bit patterns for correction of the one or more potential flash memory problems and being smaller in number than 2N; and iteratively determining whether the potential bit patterns enable recovery of at least some of the N bits. The potential flash memory problems may include, for example, over-programming (which may cause bits in the memory cells to gain charge), retention loss (which may cause bits in the memory cells to lose charge) and/or media defects (which may be defects in the flash memory chip). Potential bit patterns may be associated with different potential flash problems. In one embodiment, only the potential bit patterns to solve one of the potential flash memory problems may be iteratively examined. Alternatively, potential bit patterns for more than one of the potential flash memory problems may be iteratively examined. For example, the potential bit patterns for problems due to both over-programming and retention loss may be examined. Further, the iterative determination whether the potential bit patterns enable recovery may stop once a specific potential bit pattern enables recovery. Alternatively, the iterative determination whether the potential bit patterns enable recovery may examine all of the potential bit pattern to determine which specific bit pattern best enables recovery.
In yet another aspect, a storage device is disclosed. The storage device may comprise a flash memory device that is configured to enable recovery of bits of data. The flash memory device comprises a memory and a controller in communication with the memory. The controller is configured to: determine N bits of data for recovery in the memory; select, based on at least one aspect of the flash memory device, potential bit patterns of the N bits, the potential bit patterns being smaller in number than 2N; and iteratively determine whether the potential bit patterns enable recovery of at least some of the N bits.
In still another aspect, a storage device is disclosed. The storage device may comprise a flash memory device that is configured to enable recovery of bits of data. The flash memory device comprises a memory and a controller in communication with the memory. The controller is configured to: determine N bits of data for recovery; select potential bit patterns of the N bits, the potential bit patterns for correction of the one or more potential flash memory problems and being smaller in number than 2N; and iteratively determine whether the potential bit patterns enable recovery of at least some of the N bits.
Other features and advantages will become apparent upon review of the following drawings, detailed description and claims. Additionally, other embodiments are disclosed, and each of the embodiments can be used alone or together in combination. The embodiments will now be described with reference to the attached drawings.
As discussed in the background, toggling bits are bits whose values toggle between different values. The intelligent bit recovery determines which bits are toggling, and examines a subset of the potential bit patterns to determine which in the subset of potential bit patterns is valid. For example, N bits may be found to be toggling. In one embodiment, there may be additional bits (such as M bits) that are also in error. The number of bits (N+M) may be too many bits for error correction (such Error Correction Coding (ECC)) to correct. The intelligent bit recovery, using the subset of potential bit patterns, may be used to reduce the number of bits in error, such as recovering some or all of the N bits that are toggling. For example, the intelligent bit recovery may recover n bits, where n<N. After application of the intelligent bit recovery, the remaining bits (N+M−n) may be recovered by ECC correction. For example, the remaining bits (N+M−n) may be compared with a predetermined number to determine whether the error correction coding may recover the remaining bits. If, using one of the potential bit patterns, the remaining bits are too large in number, ECC cannot correct the remaining bit so that another potential bit pattern is used.
In an alternate embodiment, the only bits in error are the N bits found to be toggling. In this embodiment, the intelligent bit recovery, using the subset of potential bit patterns, may be used to reduce the number of bits in error, such as recovering some or all of the N bits that are toggling.
The subset is a fraction of the potential bit patterns, and is based on an understanding of the flash memory and the problems that may cause the toggling bits. Different flash memories may have different bit assignments. As merely one example, a 2-bit MLC flash memory has a bit assignment, by upper page and lower page bit, of 11, 01, 00, and 10. Moreover, toggling bits may be caused by various problems. Examples of problems include: over-programming, which may cause bits in the memory cells to gain charge; retention loss, which may cause bits in the memory cells to lose charge; and media defects, which may be defects in the flash memory chip, such as, for example, defects in the NAND flash array or in the sense amplifiers. The charge in the cells of the flash memory may move due to the various problems, resulting in the bits to move as well, such as to the adjacent right or left state by over-programming or retention. By using this limiting condition and a physical understanding of flash memory, predictions may be made as to the specific bit patterns that may correct for the various problems. For example, in an MLC flash memory, predictions may be made for upper page bits and lower page bits assuming over-programming or retention loss. In this way, the subset of potential bit patterns is a fraction of the potential bit patterns. Specifically, the subset of potential bit patterns is significantly less than 2N, and is typically less than N.
In one aspect of the invention, the intelligent bit recovery performs different types of analysis in the recovery of bits, including analysis to identify error bits, analysis to select potential bit patterns for recovery of the error bits, and analysis to determine which of the selected potential bit patterns enables recovery of one or more of the error bits.
In the first type of analysis, as discussed in more detail below, there are multiple ways of identifying toggling bits, such as based on repetitive reads of the flash memory, as discussed below in
The second type of analysis selects the potential bit patterns for recovery. In one aspect of the selecting potential bit patterns analysis, at least one aspect of the flash memory is examined to identify which problem is potentially causing the toggling bits, and the subset of potential bit patterns (which corresponds to potential valid solutions for the identified problem) are selected as solutions for the determined problem. For example, the flash memory may include a test bit (or bits), which may be indicative of the problem causing the toggling bits. The test bit (or bits) may comprise ‘FF00’, which may be a series of ‘1’s and ‘0’s. The intelligent bit recovery may analyze the test bits to determine which bits are toggling, such as whether the ‘1’s are toggling to ‘0’s or whether the ‘0’s are toggling to ‘1’s. In a flash memory with a bit assignment, by upper page and lower page bit, of 11, 01, 00, and 10, over-programming may cause ‘1’s to toggle to ‘0’ and retention loss may cause ‘0’s to toggle to ‘1’s. So that, the analysis of the test bits may indicate the cause of the toggling, such as whether the cause is over-programming (if the test bit ‘1’s toggle to ‘0’s) or whether the cause is retention loss (if the test bit ‘0’s toggle to ‘1’s). As another example, the intelligent bit recovery may determine a mode of the flash memory, and identify the likely problem based on the mode. In particular, over-programming is more likely before baking, and retention loss is more likely after bake.
In another aspect of the selecting potential bit patterns analysis, the intelligent bit recovery selects potential bit patterns for multiple potential problems. For example, the subset of potential bit patterns may include one or more bit patterns to solve for over-programming and one or more bit patterns to solve for retention loss. In this aspect, there are more bit patterns to test for validity with error correction coding; however, there is no need to first identify the problem.
In still another aspect of the selecting potential bit patterns analysis, the intelligent bit recovery may select potential bit patterns based on a type of bit that is toggling. In the flash memory with a bit assignment, by upper page and lower page bit, of 11, 01, 00, and 10, the selection of potential bit patterns for toggling bits may be based on the value of the bits in the paired page. For example, the selection of potential bit patterns for upper page toggling bits may be based on the value of the bits in the lower page. In one case, the potential bit pattern for upper page toggling bits may be the inverse of the corresponding bits in the lower page. In another case, the potential bit pattern for upper page toggling bits may match the corresponding bits in the lower page. In this way, the intelligent bit recovery may identify the type of bit toggling (such as an upper bit), and select the potential bit patterns based on the identified type.
In yet another aspect of the selecting potential bit patterns analysis, the intelligent bit recovery may select potential bit patterns independent of the bit that is toggling. In a 2-bit MLC flash memory with a bit assignment, by upper page and lower page bit, of 11, 01, 00, and 10, the selection of potential bit patterns for lower page toggling bits may be independent of the value of the toggling bits, and may include two potential bit patterns with one potential bit pattern setting all toggling bits to zero (which may combat a retention loss error) and another potential bit pattern setting all toggling bits to one (which may combat an over-programming error). In a SLC flash memory, the selection of potential bit patterns for the toggling bits may be independent of the value of the toggling bits, and may include two potential bit patterns, with one potential bit pattern setting all toggling bits to zero and another potential bit pattern setting all toggling bits to one.
The third type of analysis determines which of the potential bit patterns enables recovery of some of the bits. As discussed in more detail below, error correction coding may be used to determine which of the potential bit patterns enables recovery of some or all of the N toggling bits.
A flash memory device suitable for use in implementing the intelligent bit recovery is shown in
The host system 100 of
The flash memory device 102 of
The system controller 118 may be implemented on a single integrated circuit chip, such as an application specific integrated circuit (ASIC). Each die 120 in the flash memory 116 may contain an array of memory cells organized into multiple planes. Alternatively, the memory cell array of a memory bank may not be divided into planes.
The memory cells may be operated to store more than two detectable levels of charge in each charge storage element or region, thereby to store more than one bit of data in each. This configuration is referred to as multi level cell (MLC) memory. Alternatively, the memory cells may be operated to store two levels of charge so that a single bit of data is stored in each cell. This is typically referred to as a binary or single level cell (SLC) memory. Both types of memory cells may be used in a memory, for example binary flash memory may be used for caching data and MLC memory may be used for longer term storage. The charge storage elements of the memory cells are most commonly conductive floating gates but may alternatively be non-conductive dielectric charge trapping material.
In implementations of MLC memory operated to store two bits of data in each memory cell, each memory cell is configured to store four levels of charge corresponding to values of “11,” “01,” “10,” and “00.” Each bit of the two bits of data may represent a page bit of a lower page or a page bit of an upper page, where the lower page and upper page span across a series of memory cells sharing a common word line. Typically, the less significant bit of the two bits of data represents a page bit of a lower page and the more significant bit of the two bits of data represents a page bit of an upper page. The order of the upper and lower page is merely for illustration purposes. Other orders are contemplated. As shown in the figures, the upper page is assigned to the most significant bit and the lower page is assigned to the least significant bit. Again, this assignment is merely for illustration purposes and other assignments are contemplated.
For a page bit of an upper page, when the page bit of the lower page is programmed (a value of “10”), programming pulses are applied to the memory cell for the page bit of the upper page to increase the level of charge to correspond to a value of “00” or “10” depending on the desired value of the page bit of the upper page. However, if the page bit of the lower page is not programmed such that the memory cell is in an unprogrammed state (a value of “11”), applying programming pulses to the memory cell to program the page bit of the upper page increases the level of charge to represent a value of “01” corresponding to a programmed state of the page bit of the upper page. The voltage values indicated in
In an alternative embodiment, the toggling bits may be detected by using voltage threshold (Vt) shift commands to request the flash chips to move the read thresholds and then read the pages. As discussed in more detail below with respect to
Moreover, bits that are toggling may actually “harden” when performing multiple reads of the page being recovered. In particular, read disturb is a potential failure mechanism where the act of reading a page too often causes the bits distributions to move. The multiple reads to determine the toggling bits may cause the paired page bits to move as well. Therefore, the methodology may read the paired page (and store the value as a reference for later use) before actually attempting to locate toggling bits. Specifically, reference reads of upper and lower pages may be carried out before multiple reads of the page for detecting toggle bits. The reference reads may thus avoid losing toggle bits to read disturbs.
The number of toggling bits may be high, for example, as high as 40% or even higher, with the possibility that the code word could be fixed using the intelligent bit recovery methodology disclosed. Unlike ordinary ECC methods, there is potentially no limit on the number of bits that may be corrected using this methodology.
Referring to
Similar to
At 604, if the controller determines that the memory needs recovery, it is determined which parts of the one or more sectors (such as which bits within the sectors) need recovery. An example of this is illustrated in
At 606, bit patterns for the one or more bits needing recovery are selected. The values selected are a subset of all of the potential values, and are based on an understanding of the flash memory and the problems that may cause the toggling bits. Different flash memories may have different bit assignments. As merely one example illustrated in
One or more aspects of the flash memory device may be used to select the subset of potential bit patterns. In one embodiment, the selection of the potential bit patterns may be determined based on a dynamic aspect of the flash memory. The test bits may be used to determine if the majority movement is towards charge gain or charge loss as shown on
In another embodiment, the selection of the potential bit patterns may be determined based on a dynamic aspect of the flash memory.
In still another embodiment, the intelligent bit recovery may select potential bit patterns for multiple potential problems. For example, the subset of potential bit patterns may include one or more bit patterns to solve for over-programming and one or more bit patterns to solve for retention loss. In this aspect, there are more bit patterns to test for validity with error correction coding; however, there is no need to first identify the problem. An example of the different bit patterns used to solve multiple potential problems is illustrated in
Once the bit patterns are selected, the selected bit patterns are tested. At 608, using a selected bit pattern, ECC is analyzed to determine whether ECC indicates that the errors in the toggling bits are corrected. If so, the flow chart 600 is done. If not, at 610, it is determined whether there are additional bit patterns. If so, at 612, a different bit pattern is selected and the flow chart returns to 608. If not, an error is reported at 612 and the flow chart 600 is done.
At 712, sector recovery is implemented using Intelligent Bit Recovery (IBR) for each uncorrectable sector in the Page under recovery. An expansion of block 712 is illustrated in
If not, at 806, all of the toggling bits are forced to match the corresponding bits on the paired page. As shown in
At 808, this potential solution is examined with ECC to determine if the sector is correctable. If so, the IBR is done. If not, at 810, all of the toggling bits are forced to zero. As shown in
While the above examples describe a 2-bit MLC, IBR may be applied to different cells. For example, IBR may be applied to MLCs that are more than 2-bits, such as 3-bit MLC, 4-bit MLC, etc. The IBR for the more than 2-bit MLC may likewise focus on errors due to over-programming and loss retention. In particular, for a 3-bit MLC, the movement of charge for the various errors (such as over-programming and retention loss) may be analyzed, and the effect of the movement of charge on the values in each of the three pages. This analysis may be used to decide which bit patterns to propose, similar to the bit patterns proposed for the 2-bit MLC discussed above.
It is intended that the foregoing detailed description be understood as an illustration of selected forms that the invention can take and not as a definition of the invention. It is only the following claims, including all equivalents, which are intended to define the scope of this invention. Also, some of the following claims may state that a component is operative to perform a certain function or configured for a certain task. It should be noted that these are not restrictive limitations. It should also be noted that the acts recited in the claims can be performed in any order and not necessarily in the order in which they are recited.
This application claims the benefit of U.S. Provisional Application No. 61/498,585, filed Jun. 19, 2011, the entirety of U.S. Provisional Application No. 61/498,585 is hereby incorporated by reference herein.
Number | Name | Date | Kind |
---|---|---|---|
4916652 | Schwarz et al. | Apr 1990 | A |
5519847 | Fandrich et al. | May 1996 | A |
5530705 | Malone, Sr. | Jun 1996 | A |
5537555 | Landry et al. | Jul 1996 | A |
5551003 | Mattson et al. | Aug 1996 | A |
5657332 | Auclair et al. | Aug 1997 | A |
5666114 | Brodie et al. | Sep 1997 | A |
5708849 | Coke et al. | Jan 1998 | A |
5943692 | Marberg et al. | Aug 1999 | A |
5982664 | Watanabe | Nov 1999 | A |
6000006 | Bruce et al. | Dec 1999 | A |
6016560 | Wada et al. | Jan 2000 | A |
6018304 | Bessios | Jan 2000 | A |
6070074 | Perahia et al. | May 2000 | A |
6138261 | Wilcoxson et al. | Oct 2000 | A |
6182264 | Ott | Jan 2001 | B1 |
6192092 | Dizon et al. | Feb 2001 | B1 |
6295592 | Jeddeloh | Sep 2001 | B1 |
6311263 | Barlow et al. | Oct 2001 | B1 |
6442076 | Roohparvar | Aug 2002 | B1 |
6449625 | Wang | Sep 2002 | B1 |
6484224 | Robins et al. | Nov 2002 | B1 |
6516437 | Van Stralen et al. | Feb 2003 | B1 |
6678788 | O'Connell | Jan 2004 | B1 |
6757768 | Potter et al. | Jun 2004 | B1 |
6775792 | Ulrich et al. | Aug 2004 | B2 |
6810440 | Micalizzi, Jr. et al. | Oct 2004 | B2 |
6836808 | Bunce et al. | Dec 2004 | B2 |
6836815 | Purcell et al. | Dec 2004 | B1 |
6842436 | Moeller | Jan 2005 | B2 |
6871257 | Conley et al. | Mar 2005 | B2 |
6895464 | Chow et al. | May 2005 | B2 |
6978343 | Ichiriu | Dec 2005 | B1 |
6980985 | Amer-Yahia et al. | Dec 2005 | B1 |
6981205 | Fukushima et al. | Dec 2005 | B2 |
6988171 | Beardsley et al. | Jan 2006 | B2 |
7020017 | Chen et al. | Mar 2006 | B2 |
7032123 | Kane et al. | Apr 2006 | B2 |
7043505 | Teague et al. | May 2006 | B1 |
7100002 | Shrader et al. | Aug 2006 | B2 |
7111293 | Hersh et al. | Sep 2006 | B1 |
7162678 | Saliba | Jan 2007 | B2 |
7173852 | Gorobets et al. | Feb 2007 | B2 |
7184446 | Rashid et al. | Feb 2007 | B2 |
7328377 | Lewis et al. | Feb 2008 | B1 |
7516292 | Kimura et al. | Apr 2009 | B2 |
7523157 | Aguilar, Jr. et al. | Apr 2009 | B2 |
7527466 | Simmons | May 2009 | B2 |
7529466 | Takahashi | May 2009 | B2 |
7571277 | Mizushima | Aug 2009 | B2 |
7574554 | Tanaka et al. | Aug 2009 | B2 |
7596643 | Merry, Jr. et al. | Sep 2009 | B2 |
7681106 | Jarrar et al. | Mar 2010 | B2 |
7685494 | Varnica et al. | Mar 2010 | B1 |
7707481 | Kirschner et al. | Apr 2010 | B2 |
7761655 | Mizushima et al. | Jul 2010 | B2 |
7774390 | Shin | Aug 2010 | B2 |
7840762 | Oh et al. | Nov 2010 | B2 |
7870326 | Shin et al. | Jan 2011 | B2 |
7890818 | Kong et al. | Feb 2011 | B2 |
7913022 | Baxter | Mar 2011 | B1 |
7925960 | Ho et al. | Apr 2011 | B2 |
7934052 | Prins et al. | Apr 2011 | B2 |
7954041 | Hong et al. | May 2011 | B2 |
7971112 | Murata | Jun 2011 | B2 |
7974368 | Shieh et al. | Jul 2011 | B2 |
7978516 | Olbrich et al. | Jul 2011 | B2 |
7996642 | Smith | Aug 2011 | B1 |
8006161 | Lestable et al. | Aug 2011 | B2 |
8032724 | Smith | Oct 2011 | B1 |
8069390 | Lin | Nov 2011 | B2 |
8190967 | Hong et al. | May 2012 | B2 |
8254181 | Hwang et al. | Aug 2012 | B2 |
8312349 | Reche et al. | Nov 2012 | B2 |
8412985 | Bowers et al. | Apr 2013 | B1 |
20020024846 | Kawahara et al. | Feb 2002 | A1 |
20020083299 | Van Huben et al. | Jun 2002 | A1 |
20020152305 | Jackson et al. | Oct 2002 | A1 |
20020162075 | Talagala et al. | Oct 2002 | A1 |
20020165896 | Kim | Nov 2002 | A1 |
20030041299 | Kanazawa et al. | Feb 2003 | A1 |
20030043829 | Rashid et al. | Mar 2003 | A1 |
20030088805 | Majni et al. | May 2003 | A1 |
20030093628 | Matter et al. | May 2003 | A1 |
20030188045 | Jacobson | Oct 2003 | A1 |
20030189856 | Cho et al. | Oct 2003 | A1 |
20030198100 | Matsushita et al. | Oct 2003 | A1 |
20030212719 | Yasuda et al. | Nov 2003 | A1 |
20040024957 | Lin et al. | Feb 2004 | A1 |
20040024963 | Talagala et al. | Feb 2004 | A1 |
20040073829 | Olarig | Apr 2004 | A1 |
20040153902 | Machado et al. | Aug 2004 | A1 |
20040181734 | Saliba | Sep 2004 | A1 |
20040199714 | Estakhri et al. | Oct 2004 | A1 |
20040237018 | Riley | Nov 2004 | A1 |
20050060456 | Shrader et al. | Mar 2005 | A1 |
20050060501 | Schrader et al. | Mar 2005 | A1 |
20050114587 | Chou et al. | May 2005 | A1 |
20050172065 | Keays | Aug 2005 | A1 |
20050172207 | Radke et al. | Aug 2005 | A1 |
20050193161 | Lee et al. | Sep 2005 | A1 |
20050201148 | Chen et al. | Sep 2005 | A1 |
20050231755 | So et al. | Oct 2005 | A1 |
20050257120 | Gorobets et al. | Nov 2005 | A1 |
20050273560 | Hulbert et al. | Dec 2005 | A1 |
20050289314 | Adusumilli et al. | Dec 2005 | A1 |
20060039196 | Gorobets et al. | Feb 2006 | A1 |
20060053246 | Lee | Mar 2006 | A1 |
20060085671 | Majni et al. | Apr 2006 | A1 |
20060136570 | Pandya | Jun 2006 | A1 |
20060156177 | Kottapalli et al. | Jul 2006 | A1 |
20060195650 | Su et al. | Aug 2006 | A1 |
20060259528 | Dussud et al. | Nov 2006 | A1 |
20070011413 | Nonaka et al. | Jan 2007 | A1 |
20070058446 | Hwang et al. | Mar 2007 | A1 |
20070061597 | Holtzman et al. | Mar 2007 | A1 |
20070076479 | Kim et al. | Apr 2007 | A1 |
20070081408 | Kwon et al. | Apr 2007 | A1 |
20070083697 | Birrell et al. | Apr 2007 | A1 |
20070113019 | Beukema et al. | May 2007 | A1 |
20070133312 | Roohparvar | Jun 2007 | A1 |
20070147113 | Mokhlesi et al. | Jun 2007 | A1 |
20070150790 | Gross et al. | Jun 2007 | A1 |
20070157064 | Falik et al. | Jul 2007 | A1 |
20070174579 | Shin | Jul 2007 | A1 |
20070180188 | Fujibayashi et al. | Aug 2007 | A1 |
20070208901 | Purcell et al. | Sep 2007 | A1 |
20070234143 | Kim | Oct 2007 | A1 |
20070245061 | Harriman | Oct 2007 | A1 |
20070277036 | Chamberlain et al. | Nov 2007 | A1 |
20070291556 | Kamei | Dec 2007 | A1 |
20070294496 | Goss et al. | Dec 2007 | A1 |
20070300130 | Gorobets | Dec 2007 | A1 |
20080019182 | Yanagidaira et al. | Jan 2008 | A1 |
20080022163 | Tanaka et al. | Jan 2008 | A1 |
20080052446 | Lasser et al. | Feb 2008 | A1 |
20080077841 | Gonzalez et al. | Mar 2008 | A1 |
20080077937 | Shin et al. | Mar 2008 | A1 |
20080086677 | Yang et al. | Apr 2008 | A1 |
20080144371 | Yeh et al. | Jun 2008 | A1 |
20080147964 | Chow et al. | Jun 2008 | A1 |
20080147998 | Jeong | Jun 2008 | A1 |
20080148124 | Zhang et al. | Jun 2008 | A1 |
20080163030 | Lee | Jul 2008 | A1 |
20080168191 | Biran et al. | Jul 2008 | A1 |
20080168319 | Lee et al. | Jul 2008 | A1 |
20080170460 | Oh et al. | Jul 2008 | A1 |
20080229000 | Kim | Sep 2008 | A1 |
20080229003 | Mizushima et al. | Sep 2008 | A1 |
20080229176 | Arnez et al. | Sep 2008 | A1 |
20080270680 | Chang | Oct 2008 | A1 |
20080282128 | Lee et al. | Nov 2008 | A1 |
20080285351 | Shlick et al. | Nov 2008 | A1 |
20090003058 | Kang | Jan 2009 | A1 |
20090037652 | Yu et al. | Feb 2009 | A1 |
20090144598 | Yoon et al. | Jun 2009 | A1 |
20090168525 | Olbrich et al. | Jul 2009 | A1 |
20090172258 | Olbrich et al. | Jul 2009 | A1 |
20090172259 | Prins et al. | Jul 2009 | A1 |
20090172260 | Olbrich et al. | Jul 2009 | A1 |
20090172261 | Prins et al. | Jul 2009 | A1 |
20090172262 | Olbrich et al. | Jul 2009 | A1 |
20090172308 | Prins et al. | Jul 2009 | A1 |
20090172335 | Kulkarni et al. | Jul 2009 | A1 |
20090172499 | Olbrich et al. | Jul 2009 | A1 |
20090193058 | Reid | Jul 2009 | A1 |
20090207660 | Hwang et al. | Aug 2009 | A1 |
20090222708 | Yamaga | Sep 2009 | A1 |
20090228761 | Perlmutter et al. | Sep 2009 | A1 |
20090296466 | Kim et al. | Dec 2009 | A1 |
20090296486 | Kim et al. | Dec 2009 | A1 |
20090319864 | Shrader | Dec 2009 | A1 |
20100061151 | Miwa et al. | Mar 2010 | A1 |
20100103737 | Park | Apr 2010 | A1 |
20100161936 | Royer et al. | Jun 2010 | A1 |
20100199125 | Reche | Aug 2010 | A1 |
20100202196 | Lee et al. | Aug 2010 | A1 |
20100208521 | Kim et al. | Aug 2010 | A1 |
20100262889 | Bains | Oct 2010 | A1 |
20100281207 | Miller et al. | Nov 2010 | A1 |
20100281342 | Chang et al. | Nov 2010 | A1 |
20110083060 | Sakurada et al. | Apr 2011 | A1 |
20110113281 | Zhang et al. | May 2011 | A1 |
20110131444 | Buch et al. | Jun 2011 | A1 |
20110173378 | Filor et al. | Jul 2011 | A1 |
20110205823 | Hemink et al. | Aug 2011 | A1 |
20110213920 | Frost et al. | Sep 2011 | A1 |
20110228601 | Olbrich et al. | Sep 2011 | A1 |
20110231600 | Tanaka et al. | Sep 2011 | A1 |
20120096217 | Son et al. | Apr 2012 | A1 |
20120110250 | Sabbag et al. | May 2012 | A1 |
20120151253 | Horn | Jun 2012 | A1 |
20120195126 | Roohparvar | Aug 2012 | A1 |
20120239976 | Cometti et al. | Sep 2012 | A1 |
20120284587 | Yu et al. | Nov 2012 | A1 |
Number | Date | Country |
---|---|---|
1465203 | Oct 2004 | EP |
1 990 921 | Nov 2008 | EP |
2002-532806 | Oct 2002 | JP |
WO 2007036834 | Apr 2007 | WO |
WO 2007080586 | Jul 2007 | WO |
WO 2008121553 | Oct 2008 | WO |
WO 2008121577 | Oct 2008 | WO |
WO 2009028281 | Mar 2009 | WO |
WO 2009032945 | Mar 2009 | WO |
WO 2009058140 | May 2009 | WO |
WO 2009084724 | Jul 2009 | WO |
WO 2009134576 | Nov 2009 | WO |
Entry |
---|
Kang, A Multi-Channel Architecture for High-Performance NAND Flash-Based Storage System, J. Syst. Archit., 53, 9, Sep. 2007, 15 pgs. |
Watchdog Timer and Power Savin Modes, Microchip Technology Inc., 2005 14 pgs. |
Canim, Buffered Bloom ilters on Solid State Storage, ADMS*10, Singapore, Sep. 13-17, 2010, 8 pgs. |
Lu, A Forest-structured Bloom Filter with Flash Memory, MSST 2011, Denver, CO, May 23-27, 2011, article, 6 pgs. |
Lu, A Forest-structured Bloom Filter with Flash Memory, MSST 2011, Denver, CO, May 23-27, 2011, presentation slides, 25 pgs. |
SanDisk Enterprise IP LLC, International Search Report / Written Opinion, PCT/US2012/059447, Jun. 6, 2013, 12 pgs. |
SanDisk Enterprise IP LLC, International Search Report / Written Opinion, PCT/US2012/059453, Jun. 6, 2013, 12 pgs. |
SanDisk Enterprise IP LLC, International Search Report / Written Opinion, PCT/US2012/065914, May 23, 2013, 7 pgs. |
SanDisk Enterprise IP LLC, International Search Report / Written Opinion, PCT/US2012/065916, Apr. 5, 2013, 7 pgs. |
SanDisk Enterprise IP LLC, International Search Report / Written Opinion, PCT/US2012/065919, Jun. 17, 2013, 8 pgs. |
SanDisk Enterprise IP LLC, Notification of the Decision to Grant a Patent Right for Patent for Invention, CN 200880127623.8, Jul. 4, 2013, 1 pg. |
Sandisk Enterprise, ISR/WO, PCT/US2012/059459, Feb. 14, 2013, 9 pgs. |
SanDisk Enterprise, Office Action, CN 200880127623.8, Dec. 31, 2012, 9 pgs. |
Sandisk Enterprise IP LLC, ISR/WO, PCT/US2012/042771, Mar. 4, 2013, 14 pgs. |
SanDisk Enterprise, ISR/WO, PCT/US2012/042764, Aug. 31, 2012, 12 pgs. |
SanDisk Enterprise, Office Action, Japanese Patent Application No. 2010-540863, Jul. 24, 2012, 3 pgs. |
SanDisk Enterprise IP LLC, Office Action, Chinese Patent Application 200880127623.8, Apr. 18, 2012, 20 pgs. |
Barr, Introduction to Watchdog Timers, Oct. 2001, 3 pgs. |
Kim, A Space-Efficient Flash Translation Layer for CompactFlash Systems, IEEE Transactions on Consumer Electronics, vol. 48, No. 2, May 2002, pp. 366-375. |
McLean, Information Technology-AT Attachment with Packet Interface Extension, Aug. 19, 1998, 339 pgs. |
Park, A High Performance Controller for NAND Flash-based Solid State Disk (NSSD), Feb. 12-16, 2006, 4 pgs. |
Pliant Technology, Inc., International Search Report and Written Opinion, PCT/US08/88133, Mar. 19, 2009, 7 pgs. |
Pliant Technology, Inc., International Search Report and Written Opinion, PCT/US08/88136, Mar. 19, 2009, 7 pgs. |
Pliant Technology, Inc., International Search Report and Written Opinion, PCT/US08/88146, Feb. 26, 2009, 10 pgs. |
Pliant Technology, Inc., International Search Report and Written Opinion, PCT/US08/88154, Feb. 27, 2009, 8 pgs. |
Pliant Technology, Inc., International Search Report and Written Opinion, PCT/US08/88164, Feb. 13, 2009, 8 pgs. |
Pliant Technology, Inc., International Search Report and Written Opinion, PCT/US08/88206, Feb. 18, 2009, 7 pgs. |
Pliant Technology, Inc., International Search Report and Written Opinion, PCT/US08/88217, Feb. 19, 2009, 7 pgs. |
Pliant Technology, Inc., International Search Report and Written Opinion, PCT/US08/88229, Feb. 13, 2009, 7 pgs. |
Pliant Technology, Inc. , International Search Report and Written Opinion, PCT/US08/88232, Feb. 19, 2009, 8 pgs. |
Pliant Technology, Inc. , International Search Report and Written Opinion, PCT/US08/88236, Feb. 19, 2009, 7 pgs. |
Pliant Technology, Inc., International Search Report and Written Opinion, PCT/US2011/028637, Oct. 27, 2011, 11 pgs. |
Pliant Technology, Inc., Supplementary European Search Report, 08866997.3, Feb. 23, 2012, 6 pgs. |
Zeidman, Verilog Designer's Library, 1999, 9 pgs. |
SanDisk Enterprise, ISR/WO, PCT/US2012/042775, Sep. 26, 2012, 8 pgs. |
International Search Report and Written Opinion dated Mar. 7, 2014 received in International Patent Application No. PCT/US2013/074772, which corresponds to U.S. Appl. No. 13/831,218, 10 pages (George). |
International Search Report and Written Opinion dated Mar. 24, 2014, received in International Patent Application No. PCT/US2013/074777, which corresponds to U.S. Appl. No. 13/831,308, 10 pages (George). |
International Search Report and Written Opinion dated Mar. 7, 2014, received in International Patent Application No. PCT/US2013/074779, which corresponds to U.S. Appl. No. 13/831,374, 8 pages (George). |
International Search Report and Written Opinion dated May 14, 2014, received in International Patent Application No. PCT/US2014/017168, which corresponds to U.S. Appl. No. 14/076,115, 6 pages (Fitzpatrick). |
International Search Report and Written Opinion dated May 14, 2014, received in International Patent Application No. PCT/US2014/017169, which corresponds to U.S. Appl. No. 14/076,148, 6 pages (Fitzpatrick). |
Number | Date | Country | |
---|---|---|---|
20120324276 A1 | Dec 2012 | US |
Number | Date | Country | |
---|---|---|---|
61498585 | Jun 2011 | US |