Data storage devices such as disk drives, tape drives, and solid state drives typically employ some form of error correction code (ECC) capable of correcting errors when reading the recorded data from the storage medium, thereby compensating for signal noise that is inherent with every recording/reproduction channel. During a write operation, redundancy symbols are generated and appended to user data which are then processed during a corresponding read operation in order to detect and correct errors in the user data. The number of errors that can be corrected increases as the number of redundancy symbols increases, but increasing the redundancy symbols also decreases the capacity of the storage medium. For example, with a Reed Solomon code employing N redundancy symbols, up to N symbols in error may be detected in a codeword, and up to N/2 symbols may be corrected. When the location of the erroneous symbols within a codeword are known (referred to as erasures), a Reed Solomon code is capable if correcting up to N symbols in error. That is, erasures assist the decoding of a Reed Solomon codeword as long as the number of erasures does not exceed the number of redundancy symbols in the codeword. If the number of erasures exceeds the correction power of the ECC, the codeword will fail to decode. This is true for essentially every ECC system, including an iterative ECC system such as a low density parity check (LDPC) code.
Any suitable technique may be employed to generate the erasures at block 46 of
Any suitable technique may be employed to update the LLRs of a codeword using the parity bits of the parity sector. In general, when processing the LLRs of the codewords corresponding to one of the parity sector parity bits, at least one of the LLRs across the un-converged codewords is modified so that the likelihood of a codeword bit flips its binary state, thereby satisfying the parity of the parity sector. When at least one of the LLRs is updated correctly, it improves the likelihood the corresponding codeword will converge during the subsequent processing by the LDPC-type decoder 50. As each un-converged codeword such as shown in
In one embodiment, the codewords generated by the LDPC-type encoder 30 of
In the example shown in
In the embodiments described above, a block of codewords may be covered by a single parity sector. In other embodiments, a block of codewords may be covered by multiple parity sectors, for example, by generating a first parity sector over each symbol in a first interleave (e.g., even interleave) of a codeword, and generating a second parity sector over each symbol in a second interleave (e.g., odd interleave) in the codeword. In one embodiment, multiple parity sectors may be generated over different symbol resolutions (e.g., every ½ and every ¼ symbols), and the reliability metrics updated (block 56 of
In one embodiment, there are several configurable parameters of the ECC system that determine the likelihood that all codewords in a block of codewords covered by a parity sector will converge. These parameters may include the density (spacing) of the recorded data in the NVSM 8, the code rate of the codewords (i.e., the number of redundancy symbols added to each codeword), the latency (iterations) of the decoder, the threshold for determining when to erase a symbol and the number of adjacent symbols to erase (block 46 of
In one embodiment, the number of erasures that will exceed the correction power of a codeword is based on the number of redundancy symbols encoded into the codeword. For example, in an embodiment where the codewords are encoded using an LDPC code, it may require approximately four symbols of redundancy to correct a single symbol of the codeword without using erasures, and it may require approximately two symbols of redundancy to correct a single symbol of a codeword when using erasures. In this embodiment, when the number of erasures exceeds approximately half the number of redundancy symbols in a codeword, the codeword becomes unrecoverable during the initial iterations of the LDPC-type decoding regardless as to the signal quality of the non-erased symbols. However, in one embodiment erasing more symbols in a codeword helps prevent these marginal symbols from corrupting the LLRs of other symbols having a higher signal quality. Accordingly, even though the codeword will not converge during the initial LDPC-type decoding, the LLRs for the codeword will update more accurately during the initial LDPC-type decoding than if fewer symbols are erased (i.e., if more signal noise were allowed into the initial LDPC-type decoding). Since the LLRs of the codeword are updated more accurately during the initial LDPC-type decoding, the subsequent update using the parity sector becomes more accurate, thereby increasing the likelihood of eventually recovering the codeword.
In one embodiment, the number of erasures generated for a codeword may be limited by a predetermined threshold to ensure the redundancy of the codewords, together with the redundancy of the parity sector, is still able to recover all of the codewords. In one embodiment, the total number of erasures for the block of codewords covered by the parity sector may be limited, such that some codewords may be configured with more erasures than other codewords. In yet another embodiment, the number of erasures that overlap across the codewords may be limited so that there is a limited number of erased symbols per parity bit in the parity sector. This limit may be applied to every parity bit, or the limit may vary per parity bit as long as the overall number of overlapping erasures across all the codewords does not exceed a predetermined threshold.
In one embodiment, the number of erasures (and optionally the number of overlapping erasures) generated per codeword and/or per block of codewords may be adjusted over multiple iterations of the reliability metrics output by the SOVA-type detector 42. For example, in one embodiment the number of erasures may be varied from a minimum number (e.g., zero) up to a predetermined threshold in any suitable increment for each iteration over the output of the SOVA-type detector 42. Any suitable technique may be employed to vary the number of erasures, such as by adjusting a threshold level of the signal quality (e.g., SNR) used to qualify a symbol as an erasure. In one embodiment, the threshold(s) for qualifying erasures may be initially configured (and optionally adjusted over iterative passes) based on a statistical distribution of the signal quality for all the symbols in the block of codewords.
Any suitable LDPC-type encoder/decoder may be employed in the embodiments described above. In general, an LDPC-type decoder uses any suitable form of iterative belief propagation techniques. In addition, the LDPC-type decoder may perform any suitable number of iterations before declaring a codeword converged or un-converged. As described above, the number of iterations may be considered an ECC system parameter that may be calibrated to achieve optimal performance in terms of accuracy and speed.
Any suitable control circuitry may be employed to implement the flow diagrams in the above embodiments, such as any suitable integrated circuit or circuits. For example, the control circuitry may be implemented within a read channel integrated circuit, or in a component separate from the read channel, such as a data storage controller, or certain operations described above may be performed by a read channel and others by a data storage controller. In one embodiment, the read channel and data storage controller are implemented as separate integrated circuits, and in an alternative embodiment they are fabricated into a single integrated circuit or system on a chip (SOC). In addition, the control circuitry may include a suitable preamp circuit implemented as a separate integrated circuit, integrated into the read channel or data storage controller circuit, or integrated into a SOC.
In one embodiment, the control circuitry comprises a microprocessor executing instructions, the instructions being operable to cause the microprocessor to perform the flow diagrams described herein. The instructions may be stored in any computer-readable medium. In one embodiment, they may be stored on a non-volatile semiconductor memory external to the microprocessor, or integrated with the microprocessor in a SOC. In another embodiment, the instructions are stored on the NVSM and read into a volatile semiconductor memory when the data storage device is powered on. In yet another embodiment, the control circuitry comprises suitable logic circuitry, such as state machine circuitry.
In various embodiments, a disk drive may include a magnetic disk drive, an optical disk drive, etc. In addition, while the above examples concern a disk drive, the various embodiments are not limited to a disk drive and can be applied to other data storage devices and systems, such as magnetic tape drives, solid state drives, hybrid drives, etc. In addition, some embodiments may include electronic devices such as computing devices, data server devices, media content storage devices, etc. that comprise the storage media and/or control circuitry as described above.
The various features and processes described above may be used independently of one another, or may be combined in various ways. All possible combinations and subcombinations are intended to fall within the scope of this disclosure. In addition, certain method, event or process blocks may be omitted in some implementations. The methods and processes described herein are also not limited to any particular sequence, and the blocks or states relating thereto can be performed in other sequences that are appropriate. For example, described tasks or events may be performed in an order other than that specifically disclosed, or multiple may be combined in a single block or state. The example tasks or events may be performed in serial, in parallel, or in some other manner. Tasks or events may be added to or removed from the disclosed example embodiments. The example systems and components described herein may be configured differently than described. For example, elements may be added to, removed from, or rearranged compared to the disclosed example embodiments.
While certain example embodiments have been described, these embodiments have been presented by way of example only, and are not intended to limit the scope of the inventions disclosed herein. Thus, nothing in the foregoing description is intended to imply that any particular feature, characteristic, step, module, or block is necessary or indispensable. 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 embodiments disclosed herein.
Number | Name | Date | Kind |
---|---|---|---|
4683572 | Baggen | Jul 1987 | A |
5996110 | Kosmach | Nov 1999 | A |
6047395 | Zook | Apr 2000 | A |
6694477 | Lee | Feb 2004 | B1 |
7340665 | Tsang | Mar 2008 | B2 |
7900125 | Liu | Mar 2011 | B1 |
8448039 | Gunnam | May 2013 | B2 |
8745466 | Kaynak | Jun 2014 | B2 |
8769380 | Burd | Jul 2014 | B1 |
9059737 | Coker et al. | Jun 2015 | B2 |
9160373 | Varnica | Oct 2015 | B1 |
9214964 | Varnica | Dec 2015 | B1 |
9412410 | Bentley et al. | Aug 2016 | B1 |
9490849 | Varnica | Nov 2016 | B1 |
9632863 | Galbraith et al. | Apr 2017 | B2 |
9761273 | Chen | Sep 2017 | B1 |
9785504 | Wu et al. | Oct 2017 | B2 |
10056920 | Chen | Aug 2018 | B1 |
10063257 | Chen | Aug 2018 | B1 |
20050108616 | Hekstra | May 2005 | A1 |
20090249158 | Noh | Oct 2009 | A1 |
20120030541 | Okamura | Feb 2012 | A1 |
20120036395 | Kaynak | Feb 2012 | A1 |
20120036414 | Kaynak | Feb 2012 | A1 |
20120054585 | Jiang | Mar 2012 | A1 |
20130332794 | Yen | Dec 2013 | A1 |
20140310580 | Zhang | Oct 2014 | A1 |
20150092886 | Ionita | Apr 2015 | A1 |
20170300380 | Lei | Oct 2017 | A1 |
20170324430 | Han et al. | Nov 2017 | A1 |
20180270018 | Mushkin | Sep 2018 | A1 |
Entry |
---|
Gunnam1, et al., Next Generation Iterative LDPC Solutions for Magnetic Recording Storage, 2008, IEEE, pp. 1148-1152. (Year: 2008). |
Tomlinson et al. Extending the Dorsch decoder towards achieving maximum-likelihood decoding for linear codes, 2007, IET, pp. 479-488. (Year: 2007). |
R. Lynch, E. Kurtas, A. Kuznetsov, E. Yeo, B. Nikolic “The Search for a Practical Iterative Detector for Magnetic Recording,” IEEE Transactions on Magnetics, vol. 40, No. 1, Jan. 2004. |
Number | Date | Country | |
---|---|---|---|
20190250987 A1 | Aug 2019 | US |