Technical Field
This disclosure relates to data storage systems, such as solid state drives, for computer systems. More particularly, the disclosure relates to adaptive error correction codes for data storage systems.
Description of the Related Art
Non-volatile memory arrays often have limited endurance. The endurance of the memory array is typically contingent on usage pattern and wear. In addition, endurances depend on a particular type of the non-volatile memory array. For example, memory arrays with multi-level cell (MLC) NAND media typically have a lower endurance than memory arrays with single-level cell (SLC) NAND media. To protect user data stored to memory arrays from corruption, which may be caused by a diminished endurance, parity data can be determined and stored along with user data to facilitate error detection and/or correction.
Systems and methods that embody the various features of the invention will now be described with reference to the following drawings, in which:
While certain embodiments are described, these embodiments are presented by way of example only, and are not intended to limit the scope of protection. Indeed, the novel methods and systems described herein may be embodied in a variety of other forms. Furthermore, various omissions, substitutions, and changes in the form of the methods and systems described herein may be made without departing from the scope of protection.
In some embodiments, “coding” or “to code” data as used in this disclosure refer to the process of encoding data and/or the process of decoding data.
Overview
Storage systems such as solid state drives typically include one or more controllers coupled with non-volatile memory arrays. It is commonplace for such controllers to be designed/manufactured by one party and the non-volatile memory arrays to be designed/manufactured by another party. In addition, memory arrays from different manufacturers tend to have different internal formatting, including different memory page formats, where each memory page format corresponds to one of multiple memory pages sizes. Also, for costs and various other competitive reasons, storage system manufacturers typically use memory arrays from different manufacturers. For example, a storage system manufacturer may use one brand of memory array in a current production cycle and another brand in the next production cycle. Also, different memory arrays may be used for different storage system models priced at different levels.
Therefore, one common design approach is to have storage systems include one or more controllers with multiple specialized hardware, firmware, and/or software that encode/decode data read from or written to the memory arrays from different manufacturers, with a subset of such hardware, firmware, and/or software actually used depending on the actual memory arrays paired with the controller(s) at time of assembly or at the final design stage. As a result, storage systems can include multiple controllers or extra, unused hardware, firmware, and/or software to support multiple memory page formats for the one or more memory arrays that are not included in the finally assembled storage systems.
In the alternative, to reduce the amount of hardware, firmware, and/or software included in storage systems, storage systems and controllers can be constructed to support only one specific, known memory page format having a known memory page size and may not to support other memory page formats. Such an approach, however, limits the usefulness of storage systems and controllers to other types of memory arrays, and multiple different storage systems and controllers may need to be constructed to support multiple memory array types. In addition, in some instances, a memory page format of a memory array may not be known when storage systems and controllers are designed/constructed. Accordingly, improved systems and methods for adaptively coding data for multiple known or unknown memory storage formats are desired.
In some embodiments of the present invention, a storage system includes a controller and a non-volatile memory array having a plurality of memory pages with a common memory page size. The controller determines the common memory page size for the non-volatile memory array and selects a code word length, such as a low-density parity-check (LDPC) code word length, from multiple pre-defined code word lengths based on the common memory page size. By selectively using an appropriate code word length (chosen from multiple pre-defined code word lengths) and corresponding coding parameters, the controller uses at least some common hardware, firmware, and/or software to support multiple known or unknown memory page formats. Thus, the controller can selectively adapt its operations, so it can be paired with memory arrays of different formats made by different manufacturers.
In some embodiments, a controller of a storage system adjusts coding parameters for coding user data as memory pages, blocks, or dies of the non-volatile memory array age and/or wear out due, in part, to use of the memory array. The mechanism of adjusting coding parameters enables the controller to support additional parity per unit data over time, thereby improving the error correction or detection capabilities as the quality (e.g., data retention capabilities) of the memory array diminishes. Moreover, the mechanism of adjusting coding parameters facilitates a balancing of decoding time due to additional parity per unit data with error correction or detection benefits of additional parity data. In addition, the controller can store adjusted coding parameters for memory pages, blocks, or dies of the memory array to permit different code or parity rates for different memory pages, blocks, or dies.
System Overview
The controller 130 can receive data and/or storage access commands from a storage interface module 112 (e.g., a device driver) in a host system 110. Storage access commands communicated by the storage interface 112 can include write and read commands issued by the host system 110. The commands can specify a logical block address in the storage system 120, and the controller 130 can execute the received commands in the non-volatile memory array 140. In a hybrid hard drive, data may be stored in magnetic media storage component (not shown in
The storage system 120 can store data received from the host system 110 so that the storage system 120 can act as memory storage for the host system 110. To facilitate this function, the controller 130 can implement a logical interface. The logical interface can present to the host system 110 storage system memory as a set of logical addresses (e.g., contiguous address) where data can be stored. Internally, the controller 130 can map logical addresses to various physical memory addresses in the non-volatile memory array 140 and/or other memory module(s).
The controller 130 includes a coder module 132. In one embodiment, the coder module 132 determines coding parameters for decoding/encoding data (e.g., user data) read from or written to memory pages, such as E-pages, of the non-volatile memory array 140. The coding parameters can be used for decoding user data read from the non-volatile memory array 140, encoding user data for storage to the non-volatile memory array 140, and other uses such as error detection or correction. The coding parameters can include LDPC coding parameters, such as the column weight of a G or H coding matrix, the row weight of a G or H coding matrix, a P matrix size (e.g., where the P matrix is a sub-matrix of a G or H coding matrix), and the like. Further, the coder module 132 can determine parity data for unpadded or padded user data, as well as decode user data having corresponding parity data and padding. In addition, the coder module 132 can adjust a code or parity rate for coding data by adjusting the coding parameters. The controller 130 and/or coder module 132 can further include internal memory (not shown), which may be of one or more suitable memory types.
The non-volatile memory array 140 can be implemented using NAND flash memory devices. Other types of solid-state memory devices can alternatively be used, such as array of flash integrated circuits, Chalcogenide RAM (C-RAM), Phase Change Memory (PC-RAM or PRAM), Programmable Metallization Cell RAM (PMC-RAM or PMCm), Ovonic Unified Memory (OUM), Resistance RAM (RRAM), NOR memory, EEPROM, Ferroelectric Memory (FeRAM), Magnetoresistive RAM (MRAM), other discrete NVM (non-volatile memory) chips, or any combination thereof. In one embodiment, the non-volatile memory array 140 preferably includes multi-level cell (MLC) devices having multi-level cells capable of storing more than a single bit of information, although single-level cell (SLC) memory devices or a combination of SLC and MLC devices may be used. In one embodiment, the storage system 120 can include other memory modules, such as one or more magnetic memory modules. The storage system 120 can further include other types of storage media, such as magnetic storage.
Adaptive Data Coding
At block 205, the process 200 determines a memory page size for a non-volatile memory array, such as the non-volatile memory array 140. The memory page size can be, for instance, provided by the memory array vendor or calculated based on another known memory size. For example, the memory page size can correspond to an E-page size of the non-volatile memory array, and the process 200 can calculate the E-page size by looking-up a vendor provided F-page size of the memory array and dividing the F-page size by an appropriate constant for the non-volatile memory array, such as 4 or 8. In other embodiments, the memory page size can correspond to an F-page size.
At block 210, the process 200 selects a code word length that equals or exceeds the memory page size from a plurality of code word lengths. For example, the memory page size can be 2164 bytes or octets, and the plurality of pre-defined code word lengths can include lengths of 2176 bytes and 2304 bytes. In one embodiment, the process 200 selects the LDPC code word length having a minimum size or number of bytes of data equal to or greater than the memory page size from a plurality of pre-defined LDPC code word lengths. For example, the process 200 can select the code word length of 2176 bytes, which exceeds 2164 byte memory page size and has a minimum size of the plurality of pre-defined LDPC code word lengths.
At block 215, the process 200 determines coding parameters based at least in part on the selected code word length. The coding parameters can be used when coding data read from or written to the non-volatile memory array and enable the process 200 to manage a code rate (e.g., an amount of user data per total data of a data unit, where total data includes user data and parity data) for data. In one embodiment, the coding parameters for a LDPC code word length include a column weight, a P matrix size, and a row weight, and further include at least one of a code rate, an amount of user data, and an amount of parity data.
At block 220, the process 200 stores the coding parameters. For example, the process 200 can store the coding parameters in the non-volatile memory array 140 and/or in one or more other storage media of the storage system 120. The process 200 can store the coding parameters in internal memory of the controller 130 and/or the coder module 132. The stored coding parameters can facilitate using different coding parameters for coding different pages, blocks, or other divisions and/or subdivisions of the non-volatile memory array 140 and for tracking and adjusting coding parameters over time as portions of the non-volatile memory array age and/or wear out.
For each code length, the LDPC coding parameters of column weight, P matrix size, and row weight can be varied to enable coding of data using different designed code rates (e.g., different amounts of user data per total data of a data unit, where total data includes user data and parity data) as listed in table 300. For example, if the LDPC code word length equals 2176 bytes, the applied LDPC coding parameters can be one of the LDPC coding parameter sets at circles C1, C2, C3, or C4. In one instance, the LDPC coding parameters can be chosen at circle C3, which correspond to a column weight of 4, P matrix size of 512, and row weight of 34 and further to a code rate of 0.882 (1920 bytes of user data for 2176 byes of total code length). Further, in one embodiment, the code length, which may be defined as 2048+128×Δ, can be adjusted based on selecting Δ as 1, 2, etc. As is illustrated, selecting the value of Δ also affects the code rate. For example, at circle C1, selecting Δ to be 1 results in the code rate of 0.941, and if the column weight, P matrix size, and row weight remain unchanged, selecting Δ to be 2 results in the code rate of 0.944. As will be further explained, the various pre-defined code rates can be used to accommodate memory arrays of different page sizes. For example, as shown, the two code lengths of 2176 and 2304 bytes can accommodate page sizes of 2176 and 2304 bytes. It is to be noted that in practice the number of pre-defined code lengths can be much higher than two to accommodate various page sizes.
A controller supporting the LDPC coding parameters of table 300 can advantageously select one code length for a non-volatile memory array and adjust the LDPC coding parameters to code data at different code rates. For instance, when a memory array with an E-page size of 2176 bytes is relatively new (e.g., lightly used) and/or experiences or exhibits few coding errors, the LDPC coding parameters at circle C1 can be selected for coding data. The LDPC coding parameters at circle C1 correspond to a column weight of 4, P matrix size of 256, and row weight of 68 and further to a code rate of 0.941. A total of 128 bytes of parity can be used for coding 2048 bytes of data at circle C1. As memory pages, blocks, or dies of the memory array age and/or wear out, the LDPC coding parameters at circles C2, C3, and C4 can instead be selected for coding data. The controller can, accordingly, gradually increase the amount of parity per unit data from a code rate of 0.941 to codes rates of 0.926, 0.882, and 0.853 at circles C2, C3, and C4, respectively, in response to changes in the quality (e.g., loss of quality) of the non-volatile memory array.
Adaptive Code Shortening
Through adaptive code shortening, some embodiments of the invention can accommodate memory arrays with page sizes that do not match up exactly with the pre-defined code lengths.
In one embodiment, shortening comprises three operations. First, padding data is added to the user data to be encoded. The padding data in one embodiment is sized to be the difference between the pre-defined code length and memory page size. Second, parity data is generated based on the padding and user data. Third, the user data and parity data, which add up to the memory page size, are stored in the memory page. The padding data is not stored, but will be appended to the user data upon decoding (e.g., when the user data and parity data is read out from the memory page at a later time).
At block 505, the process 500 receives user data. The user data can be received from the storage interface module 112 along with a write command to write the user data to a non-volatile memory array, such as the non-volatile memory array 140.
At block 510, the process 500 pads the user data with padding data. The padding data can include a data set of entirely zeros, entirely ones, or a known or pre-defined data pattern. In addition, at block 510, the process 500 can further divide the user data into units having a size equal to an amount of user per data unit, which depends on corresponding coding parameters. For example, if the non-volatile memory array has a memory page size equal to 2164 bytes and the LDPC coding parameters correspond to the parameters at circle C3 of
At block 515, the process 500 determines parity data for the padded user data using coding parameters. Continuing the example of the previous paragraph, if the LDPC coding parameters correspond to the parameters at circle C3, an appropriate G coding matrix can be selected and used to determine LDPC parity data for the padded user data.
At block 520, the process 500 outputs the user data and parity data. For example, the process 500 can output the user data and parity data for storage to E-page 144 of F-page 143 of the non-volatile memory array 140. It can be noted that the padding described with to respect to blocks 510 and 515 can be characterized as “virtual padding” since the padding itself may not be written to the memory page.
Code Rate Adjusting
At block 605, the process 600 reads user data and parity data stored in a memory page. For example, the process 600 can perform a read of F-page 143 in response to a read command from the host system 110.
At block 610, the process 600 detects a number of bit errors when decoding the user data using parity data and coding parameters. For instance, the process 600 can determine a number of detected bit errors when decoding the user data using stored parity data and LDPC coding parameters corresponding to the memory page.
At block 615, the process 600 determines whether the number of bit errors exceeds a bit error threshold. The bit error threshold can depend or vary based on the coding parameters for coding data to the memory page. For example, the bit error threshold for the LDPC coding parameters at circle C1 of
At block 620, the process 600 checks whether the coding parameters can be adjusted to reduce a code rate. In other words, the process 600 can determine whether more parity data can be used for coding. In one embodiment, the process 600 can determine whether the LDPC coding parameters may be adjusted while keeping a LDPC code word length unchanged. For instance, if E-page 144 is currently coded using the LDPC coding parameters at circle C3 of
At block 625, the process 600 adjusts the coding parameters and stores the adjusted coding parameters to reduce a code rate for a next write operation. The process 600 can store the adjusted coding parameters in the non-volatile memory array 140, other memory module of the storage system 120, and/or internal memory of the controller 130 and/or coder module 132. The process 600 can store an indication of the code rate or LDPC coding parameters for coding data to facilitate management of LDPC coding parameters on a memory page, block, or other level division of a non-volatile memory array. Further, the adjusted coding parameters can be used for coding user data associated with a subsequent write command received from the host system 110.
Other Variations
Those skilled in the art will appreciate that in some embodiments, other approaches and methods can be used. For example, the coding techniques disclosed herein can apply to codes besides LDPC codes, such as other iterative codes like turbo codes. In addition, although the coding parameters and other values disclosed in the table 300 of
While certain embodiments have been described, these embodiments have been presented by way of example only, and are not intended to limit the scope of the protection. Indeed, the novel methods and systems described herein may be embodied in a variety of other forms. Furthermore, various omissions, substitutions and changes in the form of the methods and systems described herein may be made without departing from the spirit of the protection. The accompanying claims and their equivalents are intended to cover such forms or modifications as would fall within the scope and spirit of the protection. For example, the systems and methods disclosed herein can be applied to hard disk drives, hybrid hard drives, and the like. In addition, other forms of storage (e.g., DRAM or SRAM, battery backed-up volatile DRAM or SRAM devices, EPROM, EEPROM memory, etc.) may additionally or alternatively be used. As another example, the various components illustrated in the figures may be implemented as software and/or firmware on a processor, ASIC/FPGA, or dedicated hardware. Also, the features and attributes of the specific embodiments disclosed above may be combined in different ways to form additional embodiments, all of which fall within the scope of the present disclosure. Although the present disclosure provides certain preferred embodiments and applications, other embodiments that are apparent to those of ordinary skill in the art, including embodiments which do not provide all of the features and advantages set forth herein, are also within the scope of this disclosure. Accordingly, the scope of the present disclosure is intended to be defined only by reference to the appended claims.
This application is a continuation of U.S. patent application Ser. No. 13/659,099, filed on Oct. 24, 2012, titled “ADAPTIVE ERROR CORRECTION CODES FOR DATA STORAGE SYSTEMS,” the disclosure of which is hereby incorporated by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
5621660 | Chaddha et al. | Apr 1997 | A |
5768535 | Chaddha et al. | Jun 1998 | A |
6011868 | van den Branden et al. | Jan 2000 | A |
6289471 | Gordon | Sep 2001 | B1 |
6418549 | Ramchandran | Jul 2002 | B1 |
6856556 | Hajeck | Feb 2005 | B1 |
6895547 | Eleftheriou et al. | May 2005 | B2 |
6934904 | Talagala et al. | Aug 2005 | B2 |
7072417 | Burd et al. | Jul 2006 | B1 |
7126857 | Hajeck | Oct 2006 | B2 |
7129862 | Shirdhonkar et al. | Oct 2006 | B1 |
7149846 | Hetrick | Dec 2006 | B2 |
7263651 | Xia et al. | Aug 2007 | B2 |
7346832 | Richardson et al. | Mar 2008 | B2 |
7395490 | Richardson et al. | Jul 2008 | B2 |
7409492 | Tanaka et al. | Aug 2008 | B2 |
7430136 | Merry, Jr. et al. | Sep 2008 | B2 |
7447807 | Merry et al. | Nov 2008 | B1 |
7500172 | Shen et al. | Mar 2009 | B2 |
7502256 | Merry, Jr. et al. | Mar 2009 | B2 |
7509441 | Merry et al. | Mar 2009 | B1 |
7596643 | Merry, Jr. et al. | Sep 2009 | B2 |
7653778 | Merry, Jr. et al. | Jan 2010 | B2 |
7657816 | Cohen et al. | Feb 2010 | B2 |
7685337 | Merry, Jr. et al. | Mar 2010 | B2 |
7685338 | Merry, Jr. et al. | Mar 2010 | B2 |
7685374 | Diggs et al. | Mar 2010 | B2 |
7733712 | Walston et al. | Jun 2010 | B1 |
7739576 | Radke | Jun 2010 | B2 |
7765373 | Merry et al. | Jul 2010 | B1 |
7797611 | Dholakia et al. | Sep 2010 | B2 |
7809994 | Gorobets | Oct 2010 | B2 |
7814393 | Kyung et al. | Oct 2010 | B2 |
7898855 | Merry, Jr. et al. | Mar 2011 | B2 |
7912991 | Merry et al. | Mar 2011 | B1 |
7913149 | Gribok et al. | Mar 2011 | B2 |
7936603 | Merry, Jr. et al. | May 2011 | B2 |
7962792 | Diggs et al. | Jun 2011 | B2 |
8078918 | Diggs et al. | Dec 2011 | B2 |
8090899 | Syu | Jan 2012 | B1 |
8095851 | Diggs et al. | Jan 2012 | B2 |
8108692 | Merry et al. | Jan 2012 | B1 |
8122185 | Merry, Jr. et al. | Feb 2012 | B2 |
8127048 | Merry et al. | Feb 2012 | B1 |
8135903 | Kan | Mar 2012 | B1 |
8151020 | Merry, Jr. et al. | Apr 2012 | B2 |
8161227 | Diggs et al. | Apr 2012 | B1 |
8161345 | Graef | Apr 2012 | B2 |
8166245 | Diggs et al. | Apr 2012 | B2 |
8176284 | Frost et al. | May 2012 | B2 |
8176360 | Frost et al. | May 2012 | B2 |
8179292 | Nakagawa | May 2012 | B2 |
8181089 | Fernandes et al. | May 2012 | B1 |
8239735 | Shalvi | Aug 2012 | B2 |
8243525 | Kan | Aug 2012 | B1 |
8254172 | Kan | Aug 2012 | B1 |
8261012 | Kan | Sep 2012 | B2 |
8276028 | Man | Sep 2012 | B2 |
8296625 | Diggs et al. | Oct 2012 | B2 |
8312207 | Merry, Jr. et al. | Nov 2012 | B2 |
8312341 | Varnica | Nov 2012 | B1 |
8316176 | Phan et al. | Nov 2012 | B1 |
8339919 | Lee | Dec 2012 | B1 |
8341339 | Boyle et al. | Dec 2012 | B1 |
8341501 | Franceschini | Dec 2012 | B2 |
8375151 | Kan | Feb 2013 | B1 |
8392635 | Booth et al. | Mar 2013 | B2 |
8397107 | Syu et al. | Mar 2013 | B1 |
8407449 | Colon et al. | Mar 2013 | B1 |
8423722 | Deforest et al. | Apr 2013 | B1 |
8433858 | Diggs et al. | Apr 2013 | B1 |
8443167 | Fallone et al. | May 2013 | B1 |
8447920 | Syu | May 2013 | B1 |
8458435 | Rainey, III et al. | Jun 2013 | B1 |
8478930 | Syu | Jul 2013 | B1 |
8489854 | Colon et al. | Jul 2013 | B1 |
8503237 | Horn | Aug 2013 | B1 |
8521972 | Boyle et al. | Aug 2013 | B1 |
8549236 | Diggs et al. | Oct 2013 | B2 |
8583835 | Kan | Nov 2013 | B1 |
8601311 | Horn | Dec 2013 | B2 |
8601313 | Horn | Dec 2013 | B1 |
8612669 | Syu et al. | Dec 2013 | B1 |
8612804 | Kang et al. | Dec 2013 | B1 |
8615681 | Horn | Dec 2013 | B2 |
8638602 | Horn | Jan 2014 | B1 |
8639872 | Boyle et al. | Jan 2014 | B1 |
8683113 | Abasto et al. | Mar 2014 | B2 |
8700834 | Horn et al. | Apr 2014 | B2 |
8700950 | Syu | Apr 2014 | B1 |
8700951 | Call et al. | Apr 2014 | B1 |
8706985 | Boyle et al. | Apr 2014 | B1 |
8707104 | Jean | Apr 2014 | B1 |
8713066 | La et al. | Apr 2014 | B1 |
8713357 | Jean et al. | Apr 2014 | B1 |
8719531 | Strange et al. | May 2014 | B2 |
8724422 | Agness et al. | May 2014 | B1 |
8725931 | Kang | May 2014 | B1 |
8745277 | Kan | Jun 2014 | B2 |
8751728 | Syu et al. | Jun 2014 | B1 |
8769190 | Syu et al. | Jul 2014 | B1 |
8769232 | Suryabudi et al. | Jul 2014 | B2 |
8775720 | Meyer et al. | Jul 2014 | B1 |
8782327 | Kang et al. | Jul 2014 | B1 |
8788778 | Boyle | Jul 2014 | B1 |
8788779 | Horn | Jul 2014 | B1 |
8788880 | Gosla et al. | Jul 2014 | B1 |
8793429 | Call et al. | Jul 2014 | B1 |
8898548 | Mullendore | Nov 2014 | B1 |
8996957 | Northcott | Mar 2015 | B1 |
9432298 | Smith | Aug 2016 | B1 |
20030037298 | Eleftheriou et al. | Feb 2003 | A1 |
20040098659 | Bjerke et al. | May 2004 | A1 |
20050160218 | See et al. | Jul 2005 | A1 |
20050204253 | Sukhobok et al. | Sep 2005 | A1 |
20050216821 | Harada | Sep 2005 | A1 |
20050246617 | Kyung et al. | Nov 2005 | A1 |
20060036925 | Kyung et al. | Feb 2006 | A1 |
20060036933 | Blankenship et al. | Feb 2006 | A1 |
20060085593 | Lubbers et al. | Apr 2006 | A1 |
20070124648 | Dholakia et al. | May 2007 | A1 |
20070226598 | Chiu et al. | Sep 2007 | A1 |
20080141054 | Danilak | Jun 2008 | A1 |
20080155160 | McDaniel et al. | Jun 2008 | A1 |
20080168304 | Flynn et al. | Jul 2008 | A1 |
20080195900 | Chang et al. | Aug 2008 | A1 |
20080244353 | Dholakia et al. | Oct 2008 | A1 |
20080282128 | Lee et al. | Nov 2008 | A1 |
20080301521 | Gunnam et al. | Dec 2008 | A1 |
20080316819 | Lee | Dec 2008 | A1 |
20090070652 | Myung et al. | Mar 2009 | A1 |
20090193184 | Yu et al. | Jul 2009 | A1 |
20090240873 | Yu et al. | Sep 2009 | A1 |
20090241008 | Kim et al. | Sep 2009 | A1 |
20090241009 | Kong et al. | Sep 2009 | A1 |
20090249159 | Lee et al. | Oct 2009 | A1 |
20090259805 | Kilzer et al. | Oct 2009 | A1 |
20100017650 | Chin et al. | Jan 2010 | A1 |
20100020611 | Park | Jan 2010 | A1 |
20100049914 | Goodwin | Feb 2010 | A1 |
20100083071 | Shen et al. | Apr 2010 | A1 |
20100100788 | Yang et al. | Apr 2010 | A1 |
20100107030 | Graef | Apr 2010 | A1 |
20100125695 | Wu et al. | May 2010 | A1 |
20100131819 | Graef | May 2010 | A1 |
20100174849 | Walston et al. | Jul 2010 | A1 |
20100250793 | Syu | Sep 2010 | A1 |
20100251068 | Lin et al. | Sep 2010 | A1 |
20100268985 | Larsen et al. | Oct 2010 | A1 |
20100275088 | Graef | Oct 2010 | A1 |
20100315874 | Ghodsi | Dec 2010 | A1 |
20110066793 | Burd | Mar 2011 | A1 |
20110099323 | Syu | Apr 2011 | A1 |
20110126078 | Ueng et al. | May 2011 | A1 |
20110179333 | Wesel et al. | Jul 2011 | A1 |
20110191649 | Lim et al. | Aug 2011 | A1 |
20110213919 | Frost et al. | Sep 2011 | A1 |
20110214037 | Okamura et al. | Sep 2011 | A1 |
20110231737 | Dachiku | Sep 2011 | A1 |
20110231739 | Kim | Sep 2011 | A1 |
20110239088 | Post | Sep 2011 | A1 |
20110246852 | Sabbag | Oct 2011 | A1 |
20110246862 | Graef | Oct 2011 | A1 |
20110252294 | Ng et al. | Oct 2011 | A1 |
20110283049 | Kang et al. | Nov 2011 | A1 |
20110283164 | Tang et al. | Nov 2011 | A1 |
20110296273 | Rub | Dec 2011 | A1 |
20110302477 | Goss et al. | Dec 2011 | A1 |
20120072654 | Olbrich et al. | Mar 2012 | A1 |
20120079189 | Colgrove et al. | Mar 2012 | A1 |
20120079351 | Cideciyan et al. | Mar 2012 | A1 |
20120084506 | Colgrove et al. | Apr 2012 | A1 |
20120084507 | Colgrove et al. | Apr 2012 | A1 |
20120198128 | Van Aken | Aug 2012 | A1 |
20120260020 | Suryabudi et al. | Oct 2012 | A1 |
20120272000 | Shalvi | Oct 2012 | A1 |
20120278531 | Horn | Nov 2012 | A1 |
20120284460 | Guda | Nov 2012 | A1 |
20120324191 | Strange et al. | Dec 2012 | A1 |
20130019051 | Somanache | Jan 2013 | A1 |
20130031301 | Barndt | Jan 2013 | A1 |
20130054980 | Frost et al. | Feb 2013 | A1 |
20130132638 | Horn et al. | May 2013 | A1 |
20130145106 | Kan | Jun 2013 | A1 |
20130290793 | Booth et al. | Oct 2013 | A1 |
20140059405 | Syu et al. | Feb 2014 | A1 |
20140101369 | Tomlin et al. | Apr 2014 | A1 |
20140115427 | Lu | Apr 2014 | A1 |
20140133220 | Danilak et al. | May 2014 | A1 |
20140136753 | Tomlin et al. | May 2014 | A1 |
20140149826 | Lu et al. | May 2014 | A1 |
20140157078 | Danilak et al. | Jun 2014 | A1 |
20140181432 | Horn | Jun 2014 | A1 |
20140223255 | Lu et al. | Aug 2014 | A1 |
Number | Date | Country |
---|---|---|
101950586 | Jan 2011 | CN |
102005250 | Apr 2011 | CN |
2004-326867 | Nov 2004 | JP |
2008102819 | May 2008 | JP |
1020100076447 | Aug 2011 | KR |
100929371 | Nov 2011 | KR |
WO 2012058328 | May 2012 | WO |
WO 2014065967 | May 2014 | WO |
2014088747 | Jun 2014 | WO |
WO 2014084960 | Jun 2014 | WO |
WO 2014088684 | Jun 2014 | WO |
Entry |
---|
Notice of Allowance dated Oct. 24, 2014 from U.S. Appl. No. 13/659,099, 11 pages. |
Interview Summary dated Oct. 24, 2014 from U.S. Appl. No. 13/659,099, 1 page. |
Guangming Lu, et al. U.S. Appl. No. 13/718,289, filed Dec. 18, 2012, 27 pages. |
Guangming Lu, et al. U.S. Appl. No. 13/742,243, filed Jan. 15, 2013. (This application Claims Priority from U.S. Appl. No. 61/738,764, filed Dec. 18, 2012). 22 pages. |
Guangming Lu, et al. U.S. Appl. No. 13/742,248, filed Jan. 15, 2013. (This application Claims Priority from U.S. Appl. No. 61/738,732, filed Dec. 18, 2012). 32 pages. |
International Search Report and Written Opinion dated Jan. 20, 2014 from PCT/US2013/061249, filed Sep. 23, 2013, Applicant: Western Digital Technologies, Inc., 11 pages. |
Shayan S. Garani, et al., U.S. Appl. No. 13/725,965, filed Dec. 21, 2012, 31 pages. |
Shayan S. Garani, U.S. Appl. No. 13/417,057, filed Mar. 9, 2012, 30 pages. |
Ming, et al., “An improved variable length coding scheme using structured LDPC codes,” International Conference on Wireless Communication and Signal Processing (WCSP). IEEE, Oct. 2010, 5 pages. |
Jonghong, et al., “A high-speed layered min-sum LDPC decoder for error correction of NAND flash memories,” 2011 IEEE 54th International Midwest Symposium on Circuits and Systems (MWSCAS), Aug. 2011, 4 pages. |
Japanese Decision to Grant a Patent from Japanese Application No. 2015-539605, dated Mar. 14, 2017. |
Chinese Office Action from Chinese Application No. 201380067610.7, dated Mar. 14, 2017. |
Number | Date | Country | |
---|---|---|---|
20150100854 A1 | Apr 2015 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13659099 | Oct 2012 | US |
Child | 14570820 | US |