The present inventions is related to systems and methods for data processing.
Various data processing circuits have been developed that include data detector and data decoder circuits. In a typical operation, a data detector circuit receives a data input and attempts to assign binary values corresponding to an original data input. In addition to assigning binary values, the data detector circuit assigns soft values indicating a degree of confidence that a data detection algorithm implemented by the data detector circuit has in the particular assigned binary value. Both the binary values and the corresponding soft values are provided to a downstream data decoder circuit where they are used to perform error correction in an attempt to recover originally written data. In some cases, stubborn patterns may be introduced to the data detector circuit where the soft value for a given binary value indicates a high degree of confidence even though the binary value has been incorrectly assigned. In some cases, remaining errors are not correctable due to the improperly indicated binary value and assigned binary value.
Hence, for at least the aforementioned reasons, there exists a need in the art for advanced systems and methods for data processing.
The present invention is related to systems and methods for data processing.
Various embodiments of the present invention provide data processing circuits that include: a data detector circuit, a data decoder circuit, and a modification circuit. The data detector circuit is operable to apply a data detection algorithm to a data input to yield a detected output. The data decoder circuit is operable to apply a data decode algorithm to a decode input to yield a decoded output. The decode input is selected between at least the detected output, and a modified version of the detected output. The modification circuit is operable to receive the detected output and to provide the modified version of the detected output.
In some instances of the aforementioned embodiments, the modification circuit includes a comparator circuit operable to compare the detected output with a stubborn pattern. In some cases, a memory is included to store the stubborn pattern. In some cases, the comparator circuit is operable to compare hard decisions of the detected output with the stubborn pattern, and the modification circuit is operable to modify soft decisions of the detected output to yield the modified version of the detected output based at least in part on a match between the hard decisions of the detected output and the stubborn pattern. In various cases, the modification circuit further includes a processing status circuit operable to indicate a number of iterations of the data input through the data detector circuit and the data decoder circuit. In such cases, modifying the soft decisions of the detected output to yield the modified version of the detected output is further based at least in part on the number of iterations. In one or more cases, the modification circuit further includes a multiplication circuit operable to multiply the soft decisions of the detected output by a scaling factor to yield the modified version of the detected output.
Other embodiments of the present invention provide methods for data processing. The methods include: using a data detector circuit to apply a data detection algorithm to a data input to yield a detected output; using a data decoder circuit to apply a data decode algorithm to a decode input to yield a decoded output; and selecting between the detected output and a modified version of the detected output to provide as the decode input. In some cases, selecting between the detected output and the modified version of the detected output includes comparing hard decisions of the detected output with the stubborn pattern. In such cases, the modified version of the detected output is provided as the decode input based at least in part on a match between the hard decisions of the detected output and the stubborn pattern. The methods may further include programming a memory with the stubborn pattern. In one or more cases, selecting between the detected output and the modified version of the detected output further includes determining a processing status corresponding to the data decoder circuit. In such cases, the modified version of the detected output may be provided as the decode input based at least in part on the processing status. In one or more instances of the aforementioned embodiments, the methods further include multiplying soft decisions of the detected output by a scaling factor to yield the modified version of the detected output. In other instances of the aforementioned embodiments, the methods further include flipping one or more hard decisions of the detected output to yield the modified version of the detected output.
This summary provides only a general outline of some embodiments of the invention. Many other objects, features, advantages and other embodiments of the invention will become more fully apparent from the following detailed description, the appended claims and the accompanying drawings.
A further understanding of the various embodiments of the present invention may be realized by reference to the figures which are described in remaining portions of the specification. In the figures, like reference numerals are used throughout several figures to refer to similar components. In some instances, a sub-label consisting of a lower case letter is associated with a reference numeral to denote one of multiple similar components. When reference is made to a reference numeral without specification to an existing sub-label, it is intended to refer to all such multiple similar components.
The present invention is related to systems and methods for data processing.
Various embodiments of the present invention provide data processing circuits designed to receive encoded data and to process the received data to recover originally written data. The data may include various fields embedded therein that allow for, for example, synchronization to the data stream. As an example, a received data stream may include a preamble pattern, a sync mark pattern, user data, and an end of data pattern (e.g., an end of sector pad). A data detector circuit receives the encoded data which is often noise contaminated, and applies a data detection algorithm to yield both hard decisions and soft decisions. As used herein, the phrase “hard decision” is used in its broadest sense to mean any value assigned to a given bit period by a data processing circuit, and the phrase “soft decision” is used in its broadest sense to mean any indication of how likely a corresponding hard decision is correctly assigned. In some cases, the soft decisions are provided as a log likelihood ratio (LLR) calculated in accordance with the following equation:
where xk is the k-th bit of data, and r is the received sample sequence. The data detector circuit may be any data detector circuit known in the art that is capable of producing both hard decisions and soft decisions including, but not limited to, a Viterbi algorithm detector circuit or a maximum a posteriori detector circuit as are known in the art. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of data detector circuits that may be used in relation to different embodiments of the present invention.
A subsequent data decoder circuit uses both the hard decisions and soft decisions to correct any errors in an attempt to recover an originally written data stream. The data decoder circuit may be any data decoder circuit known in the art that is capable of applying a decoding algorithm based on both soft decisions and hard decisions. The data decoder may be, but is not limited to, a low density parity check decoder circuit or a Reed Solomon decoder circuit as are known in the art. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of data decoder circuits that may be used in relation to different embodiments of the present invention. The soft decisions from the data detector circuit play an important role in successful decoding. In general, a large value for a given soft decision means high confidence in the assigned hard decision, and a lower likelihood that the decoder circuit will modify the particular hard decision in its attempt to correct any errors. Where the soft decision indicates a high likelihood that the assigned hard decision is correct and that hard decision is correct, the data decoder circuit will converge more quickly as there are fewer hard decisions to consider for correction. However, where the soft decision indicates a high likelihood that the assigned hard decision is correct, yet that hard decision is not correct, the data decoder circuit in some cases will fail to correct remaining errors (i.e., the data will not converge).
The data processing circuits may be designed to allow multiple passes through one or both of the data detector circuit or the data decoder circuit (i.e., local iterations) before the result is provided to a subsequent processing circuit. Further, the circuits are designed to allow for the same encoded data to be processed through a combination of data detector and data decoder circuits (i.e., global iterations) before the data is passed to a subsequent processing or receiving circuit. In some cases where the combination of local and global iterations is failing to converge on the originally written data, circuitry may be used to determine whether one or more previously identified stubborn patterns occur in the encoded data. Where one or more stubborn patterns are identified, one or both of the hard decisions and the soft decisions from the data detector circuit may be modified to avoid either the stubborn pattern(s) or the effects of the stubborn pattern(s) and thereby increase the likelihood of convergence by the data decoder circuit.
Turning to
Equalized output 125 is provided to both a data detector circuit 160 and a Y-sample circuit 150. Y-sample circuit 150 stores equalized output 125 as buffered data 155 for use in subsequent iterations through data detector circuit 160. Data detector circuit 160 may be any data detector circuit known in the art that is capable of producing both hard decisions 165 and soft decisions 162. As some examples, data detector circuit 160 may be, but not limited to, a Viterbi algorithm detector circuit or a maximum a posteriori detector circuit as are known in the art. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of data detector circuits that may be used in relation to different embodiments of the present invention.
Both soft decisions 162 and hard decisions 165 are provided to a detector output modification circuit 170. Detector output modification circuit 170 is operable to either pass on soft decisions 162 and hard decisions 165 as soft decisions 172 and hard decisions 175, respectively, or to modify one or both of soft decisions 162 and hard decisions 165 and provide the modified data as soft decisions 172 and hard decisions 175, respectively. Whether or not soft decisions 162 and/or hard decisions 165 are modified is based upon status information (i.e., a stubborn pattern found output 112, number of global iterations 195, and number of violated checks 192) as is more fully described below. Soft decisions 172 and hard decisions 175 are provided to a data decoder circuit 180 that applies a decoding algorithm to the received input in an attempt to recover originally written data. The data decoder circuit may be any data decoder circuit known in the art that is capable of applying a decoding algorithm based on both soft decisions and hard decisions. Data decoder circuit 180 may be, but is not limited to, a low density parity check decoder circuit or a Reed Solomon decoder circuit as are known in the art. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of data decoder circuits that may be used in relation to different embodiments of the present invention.
Data decoder circuit 180 provides a decoded output 185 representing the results of applying the decoding algorithm. In addition, data decoder circuit 182 provides a status output 182 indicating the results of the decoding process to a processing status circuit 190. In some cases, status output 182 indicates whether the decoding process converged (i.e., was able to correctly provide the originally written input) and an indication of the number of remaining violated checks (i.e., the number of check equations within the encoded data that were not properly resolved). Number of global iterations 195 and number of violated checks 192 are provided to detector output modification circuit 170.
In addition, a pattern comparator circuit 108 compares a stream of hard decisions 165 against one or more known stubborn patterns 106. Stubborn patterns 106 may be programmed into a stubborn pattern memory 104 via a pattern input interface 102. The programmed stubborn patterns may be identified through circuit simulation or other processes known in the art for identifying potential failures. For example, stubborn patterns may be identified as those patterns exhibiting a minimum mean squared difference from an ideal output. As one of many examples, a ‘11111’ pattern may be identified as a stubborn pattern that is identified as a high probability of being correct, even though the actual pattern should be decoded as ‘11101’. Of note, the aforementioned ‘11111’ pattern is an example only and many different stubborn patterns may be identified. Anytime the stream of hard decisions 165 matches one of stubborn patterns 106, the matched stubborn pattern is provided to detector output modification circuit 170 as stubborn pattern found output 112.
Relying on one or more of stubborn pattern found output 112, number of global iterations 195, and number of violated checks 192, detector output modification circuit 170 selects between a modified version of hard decisions 165 and soft decisions 162 or an unmodified version to be provided as hard decisions 175 and soft decisions 172. In one particular embodiment of the present invention, detector output modification circuit 170 reduces the soft decisions corresponding to hard decisions 165 included in the stream matching an identified stubborn output whenever the number of global iterations expended on the currently processing encoded data exceeds a defined threshold. The following pseudocode describes such an operation:
In such cases, η is an attenuation factor that may be either greater than one or less than one. Where η is greater than one it is expected that for the identified stubborn pattern soft decisions 162 are understated, and where η is less than one it is expected that for the identified stubborn pattern soft decisions 162 are overstated. The value of η may be programmable and used for all stubborn patterns, or each stubborn pattern may be associated with its own value of η. Of note, the modification process described above may be effectively disabled by setting η equal to one.
In other embodiments of the present invention, detector output modification circuit 170 reduces the soft decisions corresponding to hard decisions 165 included in the stream matching an identified stubborn output whenever the number of global iterations expended on the currently processing encoded data exceeds a defined threshold (ThresholdA) and the number of violated checks exceeds another threshold (ThresholdB). The following pseudocode describes such an operation:
Again, in such cases, η is an attenuation factor that may be either greater than one or less than one. Where η is greater than one it is expected that for the identified stubborn pattern soft decisions 162 are understated, and where η is less than one it is expected that for the identified stubborn pattern soft decisions 162 are overstated. The value of η may be programmable and used for all stubborn patterns, or each stubborn pattern may be associated with its own value of η. Of note, the modification process described above may be effectively disabled by setting η equal to one.
In yet other embodiments of the present invention, detector output modification circuit 170 reduces the soft decisions corresponding to hard decisions 165 included in the stream matching an identified stubborn output whenever the number of global iterations expended on the currently processing encoded data exceeds a defined threshold (ThresholdA) and is less than another defined threshold (ThresholdB), and the number of violated checks exceeds another defined threshold (ThresholdC). The following pseudocode describes such an operation:
Again, in such cases, η is an attenuation factor that may be either greater than one or less than one. Where η is greater than one it is expected that for the identified stubborn pattern soft decisions 162 are understated, and where η is less than one it is expected that for the identified stubborn pattern soft decisions 162 are overstated. The value of η may be programmable and used for all stubborn patterns, or each stubborn pattern may be associated with its own value of η. Of note, the modification process described above may be effectively disabled by setting η equal to one.
In yet further embodiments of the present invention, detector output modification circuit 170 flips one or more of the hard decisions 165 included in the stream matching an identified stubborn output whenever the number of global iterations expended on the currently processing encoded data exceeds a defined threshold. The following pseudocode describes such an operation:
It should be noted that more than one bit in a given pattern may be flipped. In addition, it should be noted that the bit flipping of hard decisions 165 may be done by multiplying a corresponding soft decision by a negative attenuation value (η). In some cases, the value of aforementioned Switch Value is a randomly selected each time a bit flipping process is performed, while in other cases the Switch Value is fixed.
Turning to
The Y-sample output is provided to a data detector circuit that is operable to apply a data detection algorithm to yield a detected output (block 225). As just two examples, the data detection algorithm may be a maximum a posterior data detection algorithm or a Viterbi algorithm detection as are known in the art. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of data detection algorithms that may be used in relation to different embodiments of the present invention.
A data decode algorithm is then applied to the detected output to yield a decoded output (output 230). As just two examples, the data decode algorithm may be a low density parity check decode algorithm or a Reed Solomon decode algorithm as are known in the art. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of data decode algorithms that may be used in relation to different embodiments of the present invention. A processing status is updated to reflect the results of applying the data decode algorithm to the detected output (block 235). This status update may include, but is not limited to, an indication of the number of global iterations (i.e., applications of the data detection algorithm and the data decode algorithm to the particular Y-sample output) and an indication of a number of violated checks (e.g., violated parity checks) that remain at the end of application of the data decode algorithm.
Based upon the updated processing status, it is determined whether the data decode algorithm converged (e.g., the number of remaining violated checks is zero or below a defined threshold) (block 240). Where the data converged (block 240), the decoded output is provided as a data output (block 245) and the processing is complete for that particular y-sample output. Alternatively, where the data failed to converge (block 240), it is determined whether a timeout condition has been met (block 250). Such a timeout condition may limit the number of global iterations that are applied to a given Y-sample output. In some cases, the number of global iterations may be variable and depend upon the rate of convergence of other Y-sample outputs concurrently processing, while in other cases the number of global iterations may be fixed. Where the timeout condition is met (block 250), the decoded output is provided as a data output along with an error indication noting that the data failed to converge (block 255).
Alternatively, where the timeout condition was not met (block 250), a process of determining whether the output of the data detection algorithm is to be modified for a subsequent global iteration. This process relies on programming one or more known stubborn patterns into a memory (block 265). The programmed stubborn patterns may be identified through circuit simulation or other processes known in the art for identifying potential failures. For example, stubborn patterns may be identified as those patterns exhibiting a minimum mean squared difference from an ideal output. As one of many examples, a ‘11111’ pattern may be identified as a stubborn pattern that is identified as a high probability of being correct, even though the actual pattern should be decoded as ‘11101’. Of note, the aforementioned ‘11111’ pattern is an example only and many different stubborn patterns may be identified.
In addition, a subsequent application of the data detection algorithm to the previously buffered y-sample output is performed using the decoded output as a guide (block 260). This process yields an updated detected output. In some cases, the applied data detection algorithm is the same as that applied during block 225 except that it is guided by soft data provided as part of the decoded output. The hard decisions from the updated detected output are compared against the previously programmed stubborn patterns (block 275). Where no matches to the previously programmed stubborn patterns are found (block 280), the processes of blocks 230-255 are repeated for the updated detected output.
Otherwise, where a match to one of the previously programmed stubborn patterns is detected (block 280), the processing status is compared against a modification standard (block 285). The modification standard is a pre-defined standard which determines whether the updated detected output is to be modified prior to subsequent application of the data decode algorithm. For example, the modification standard may indicate that a modification is to occur whenever the number of global iterations expended on the currently processing Y-samples exceeds a defined threshold. Where it is determined that the modification standard has not been met (block 290), the processes of blocks 230-255 are repeated for the updated detected output. Alternatively, where it is determined that the modification standard has been met (block 290), the updated detected output is modified (block 295). The modification may include, for example, reducing the value of the soft decisions corresponding to the updated detected output prior to performing the processes of blocks 230-255 on the modified detected output.
The following pseudocode represents the operation of blocks 280 through 295 where modification of the detected output is performed to reduce the value of thereof when the number of global iterations expended on the currently processing Y-samples exceeds a defined threshold.
In such cases, η is an attenuation factor that may be either greater than one or less than one. Where η is greater than one it is expected that for the identified stubborn pattern, the soft decisions are understated, and where η is less than one it is expected that for the identified stubborn pattern, the soft decisions are overstated. The value of η may be programmable and used for all stubborn patterns, or each stubborn pattern may be associated with its own value of η. Of note, the modification process described above may be effectively disabled by setting η equal to one.
As another example, the soft decisions from the updated detected output are modified whenever the number of global iterations expended on the currently processing encoded data exceeds a defined threshold (ThresholdA) and the number of violated checks exceeds another threshold (ThresholdB). The following pseudocode describes such an operation:
As yet another example, the soft decisions corresponding to the updated detected output may be modified whenever the number of global iterations expended on the currently processing encoded data exceeds a defined threshold (ThresholdA) and is less than another defined threshold (ThresholdB), and the number of violated checks exceeds another defined threshold (ThresholdC). The following pseudocode describes such an operation:
As yet a further example, the hard decisions corresponding to the updated detected output may be modified whenever the number of global iterations expended on the currently processing encoded data exceeds a defined threshold. The following pseudocode describes such an operation:
In some cases, the value of aforementioned Switch Value is a randomly selected each time a bit flipping process is performed, while in other cases the Switch Value is fixed.
In a typical read operation, read/write head assembly 376 is accurately positioned by motor controller 368 over a desired data track on disk platter 378. Motor controller 368 both positions read/write head assembly 376 in relation to disk platter 378 and drives spindle motor 372 by moving read/write head assembly 376 to the proper data track on disk platter 378 under the direction of hard disk controller 366. Spindle motor 372 spins disk platter 378 at a determined spin rate (RPMs). Once read/write head assembly 378 is positioned adjacent the proper data track, magnetic signals representing data on disk platter 378 are sensed by read/write head assembly 376 as disk platter 378 is rotated by spindle motor 372. The sensed magnetic signals are provided as a continuous, minute analog signal representative of the magnetic data on disk platter 378. This minute analog signal is transferred from read/write head assembly 376 to read channel circuit 310 via preamplifier 370. Preamplifier 370 is operable to amplify the minute analog signals accessed from disk platter 378. In turn, read channel circuit 310 decodes and digitizes the received analog signal to recreate the information originally written to disk platter 378. This data is provided as read data 303 to a receiving circuit. As part of decoding the received information, read channel circuit 310 may apply stubborn pattern mitigation where, for example, a codeword is not converging. This stubborn pattern mitigation may be applied using data processing circuitry similar to that discussed above in relation to
It should be noted that storage system 300 may be integrated into a larger storage system such as, for example, a RAID (redundant array of inexpensive disks or redundant array of independent disks) based storage system. It should also be noted that various functions or blocks of storage system 300 may be implemented in either software or firmware, while other functions or blocks are implemented in hardware.
Turning to
It should be noted that the various blocks discussed in the above application may be implemented in integrated circuits along with other functionality. Such integrated circuits may include all of the functions of a given block, system or circuit, or only a subset of the block, system or circuit. Further, elements of the blocks, systems or circuits may be implemented across multiple integrated circuits. Such integrated circuits may be any type of integrated circuit known in the art including, but are not limited to, a monolithic integrated circuit, a flip chip integrated circuit, a multichip module integrated circuit, and/or a mixed signal integrated circuit. It should also be noted that various functions of the blocks, systems or circuits discussed herein may be implemented in either software or firmware. In some such cases, the entire system, block or circuit may be implemented using its software or firmware equivalent. In other cases, the one part of a given system, block or circuit may be implemented in software or firmware, while other parts are implemented in hardware.
In conclusion, the invention provides novel systems, devices, methods and arrangements for data processing. While detailed descriptions of one or more embodiments of the invention have been given above, various alternatives, modifications, and equivalents will be apparent to those skilled in the art without varying from the spirit of the invention. Therefore, the above description should not be taken as limiting the scope of the invention, which is defined by the appended claims.
Number | Name | Date | Kind |
---|---|---|---|
5278703 | Rub | Jan 1994 | A |
5278846 | Okayama et al. | Jan 1994 | A |
5325402 | Ushirokawa | Jun 1994 | A |
5392299 | Rhines et al. | Feb 1995 | A |
5471500 | Blaker et al. | Nov 1995 | A |
5513192 | Janku et al. | Apr 1996 | A |
5523903 | Hetzler | Jun 1996 | A |
5550870 | Blaker et al. | Aug 1996 | A |
5612964 | Haraszti | Mar 1997 | A |
5701314 | Armstrong et al. | Dec 1997 | A |
5710784 | Kindred et al. | Jan 1998 | A |
5712861 | Inoue et al. | Jan 1998 | A |
5717706 | Ikeda | Feb 1998 | A |
5768044 | Hetzler | Jun 1998 | A |
5802118 | Bliss et al. | Sep 1998 | A |
5844945 | Nam et al. | Dec 1998 | A |
5898710 | Amrany | Apr 1999 | A |
5923713 | Hatakeyama | Jul 1999 | A |
5978414 | Nara | Nov 1999 | A |
5983383 | Wolf | Nov 1999 | A |
6005897 | McCallister et al. | Dec 1999 | A |
6009552 | Ariel et al. | Dec 1999 | A |
6023783 | Divsalar et al. | Feb 2000 | A |
6029264 | Kobayashi et al. | Feb 2000 | A |
6041432 | Ikeda | Mar 2000 | A |
6065149 | Yamanaka | May 2000 | A |
6097764 | McCallister et al. | Aug 2000 | A |
6145110 | Khayrallah | Nov 2000 | A |
6216249 | Bliss et al. | Apr 2001 | B1 |
6216251 | McGinn | Apr 2001 | B1 |
6229467 | Eklund et al. | May 2001 | B1 |
6249461 | Choi et al. | Jun 2001 | B1 |
6266795 | Wei | Jul 2001 | B1 |
6317472 | Choi et al. | Nov 2001 | B1 |
6351832 | Wei | Feb 2002 | B1 |
6377610 | Hagenauer et al. | Apr 2002 | B1 |
6381726 | Weng | Apr 2002 | B1 |
6438717 | Butler et al. | Aug 2002 | B1 |
6473878 | Wei | Oct 2002 | B1 |
6476989 | Chainer et al. | Nov 2002 | B1 |
6625775 | Kim | Sep 2003 | B1 |
6657803 | Ling et al. | Dec 2003 | B1 |
6671404 | Katawani et al. | Dec 2003 | B1 |
6748034 | Hattori et al. | Jun 2004 | B2 |
6757862 | Marianetti, II | Jun 2004 | B1 |
6785863 | Blankenship et al. | Aug 2004 | B2 |
6788654 | Hashimoto et al. | Sep 2004 | B1 |
6810502 | Eidson | Oct 2004 | B2 |
6980382 | Hirano et al. | Dec 2005 | B2 |
6986098 | Poeppelman | Jan 2006 | B2 |
7010051 | Murayama et al. | Mar 2006 | B2 |
7047474 | Rhee et al. | May 2006 | B2 |
7058873 | Song et al. | Jun 2006 | B2 |
7073118 | Greenberg et al. | Jul 2006 | B2 |
7093179 | Shea | Aug 2006 | B2 |
7113356 | Wu | Sep 2006 | B1 |
7136244 | Rothbert | Nov 2006 | B1 |
7173783 | McEwen et al. | Feb 2007 | B1 |
7184486 | Wu et al. | Feb 2007 | B1 |
7191378 | Eroz et al. | Mar 2007 | B2 |
7203015 | Sakai et al. | Apr 2007 | B2 |
7203887 | Eroz et al. | Apr 2007 | B2 |
7236757 | Raghavan et al. | Jun 2007 | B2 |
7257764 | Suzuki et al. | Aug 2007 | B2 |
7310768 | Eidson et al. | Dec 2007 | B2 |
7313750 | Feng et al. | Dec 2007 | B1 |
7370258 | Iancu et al. | May 2008 | B2 |
7403752 | Raghaven et al. | Jul 2008 | B2 |
7430256 | Zhidkov | Sep 2008 | B2 |
7502189 | Sawaguchi et al. | Mar 2009 | B2 |
7505537 | Sutardja | Mar 2009 | B1 |
7523375 | Spencer | Apr 2009 | B2 |
7587657 | Haratsch | Sep 2009 | B2 |
7589858 | Shin et al. | Sep 2009 | B2 |
7590168 | Raghaven et al. | Sep 2009 | B2 |
7702989 | Graef et al. | Apr 2010 | B2 |
7712008 | Song et al. | May 2010 | B2 |
7738201 | Jin et al. | Jun 2010 | B2 |
7752523 | Chaichanavong | Jul 2010 | B1 |
7801200 | Tan | Sep 2010 | B2 |
7802163 | Tan | Sep 2010 | B2 |
20030063405 | Jin et al. | Apr 2003 | A1 |
20030081693 | Raghaven et al. | May 2003 | A1 |
20030087634 | Raghaven et al. | May 2003 | A1 |
20030112896 | Raghaven et al. | Jun 2003 | A1 |
20030134607 | Raghaven et al. | Jul 2003 | A1 |
20040071206 | Takatsu | Apr 2004 | A1 |
20040098659 | Bjerke et al. | May 2004 | A1 |
20050010855 | Lusky | Jan 2005 | A1 |
20050078399 | Fung | Apr 2005 | A1 |
20050111540 | Modrie et al. | May 2005 | A1 |
20050157780 | Werner et al. | Jul 2005 | A1 |
20050195749 | Elmasry et al. | Sep 2005 | A1 |
20050216819 | Chugg et al. | Sep 2005 | A1 |
20050273688 | Argon | Dec 2005 | A1 |
20060020872 | Richardson et al. | Jan 2006 | A1 |
20060031737 | Chugg et al. | Feb 2006 | A1 |
20060123285 | De Araujo et al. | Jun 2006 | A1 |
20060140311 | Ashley et al. | Jun 2006 | A1 |
20060168493 | Song et al. | Jul 2006 | A1 |
20060195772 | Graef et al. | Aug 2006 | A1 |
20060210002 | Yang et al. | Sep 2006 | A1 |
20060248435 | Haratsch | Nov 2006 | A1 |
20060256670 | Park et al. | Nov 2006 | A1 |
20070011569 | Casado et al. | Jan 2007 | A1 |
20070047121 | Elefeheriou et al. | Mar 2007 | A1 |
20070047635 | Stojanovic et al. | Mar 2007 | A1 |
20070110200 | Mergen et al. | May 2007 | A1 |
20070230407 | Petrie et al. | Oct 2007 | A1 |
20070286270 | Huang et al. | Dec 2007 | A1 |
20080049825 | Chen et al. | Feb 2008 | A1 |
20080055122 | Tan | Mar 2008 | A1 |
20080065970 | Tan | Mar 2008 | A1 |
20080069373 | Jiang et al. | Mar 2008 | A1 |
20080168330 | Graef et al. | Jul 2008 | A1 |
20080276156 | Gunnam | Nov 2008 | A1 |
20080301521 | Gunnam | Dec 2008 | A1 |
20090185643 | Fitzpatrick | Jul 2009 | A1 |
20090199071 | Graef | Aug 2009 | A1 |
20090235116 | Tan et al. | Sep 2009 | A1 |
20090235146 | Tan | Sep 2009 | A1 |
20090259915 | Livshitz et al. | Oct 2009 | A1 |
20090273492 | Yang et al. | Nov 2009 | A1 |
20090274247 | Galbraith et al. | Nov 2009 | A1 |
20100002795 | Raghaven et al. | Jan 2010 | A1 |
20100042877 | Tan | Feb 2010 | A1 |
20100042890 | Gunam | Feb 2010 | A1 |
20100050043 | Savin | Feb 2010 | A1 |
20100061492 | Noeldner | Mar 2010 | A1 |
20100070837 | Xu et al. | Mar 2010 | A1 |
20100164764 | Nayak | Jul 2010 | A1 |
20100185914 | Tan et al. | Jul 2010 | A1 |
20100281347 | Derras | Nov 2010 | A1 |
20110075569 | Marrow et al. | Mar 2011 | A1 |
20110080211 | Yang et al. | Apr 2011 | A1 |
20110167246 | Yang et al. | Jul 2011 | A1 |
20120005551 | Gunnam | Jan 2012 | A1 |
Number | Date | Country |
---|---|---|
0522578 | Jan 1993 | EP |
0631277 | Dec 1994 | EP |
1814108 | Aug 2007 | EP |
WO 2006016751 | Feb 2006 | WO |
WO 2006134527 | Dec 2006 | WO |
WO 2007091797 | Aug 2007 | WO |
WO 2010126482 | Apr 2010 | WO |
2010101578 | Sep 2010 | WO |
WO 2010101578 | Sep 2010 | WO |
Entry |
---|
Yunxiang Wu; O'Sullivan, J.A.; Singla, N.; Indeck, R.S., “Iterative detection and decoding for separable two-dimensional intersymbol interference,” Magnetics, IEEE Transactions on , vol. 39, No. 4, pp. 2115,2120, Jul. 2003. |
U.S. Appl. No. 11/461,026, filed Jul. 31, 2006, Tan, Weijun. |
U.S. Appl. No. 11/461,198, filed Jul. 31, 2006, Tan, Weijun. |
U.S. Appl. No. 11/461,283, filed Jul. 31, 2006, Tan, Weijun. |
U.S. Appl. No. 12/540,283, filed Aug. 12, 2009, Liu, et al. |
U.S. Appl. No. 12/652,201, filed Jan. 5, 2010, Mathew, et al. |
U.S. Appl. No. 12/763,050, filed Apr. 19, 2010, Ivkovic, et al. |
U.S. Appl. No. 12/792,555, filed Jun. 2, 2010, Liu, et al. |
U.S. Appl. No. 12/887,317, filed Sep. 21, 2010, Xia, et al. |
U.S. Appl. No. 12/887,330, filed Sep. 21, 2010, Zhang, et al. |
U.S. Appl. No. 12/887,369, filed Sep. 21, 2010, Liu, et al. |
U.S. Appl. No. 12/901,816, filed Oct. 11, 2010, Li, et al. |
U.S. Appl. No. 12/901,742, filed Oct. 11, 2010, Yang. |
U.S. Appl. No. 12/917,756, filed Nov. 2, 2010, Miladinovic, et al. |
U.S. Appl. No. 12/947,931, filed Nov. 17, 2010, Yang, Shaohua. |
U.S. Appl. No. 12/947,947, filed Nov. 17, 2010, Ivkovic, et al. |
U.S. Appl. No. 12/972,942, filed Dec. 20, 2010, Liao, et al. |
U.S. Appl. No. 12/992,948, filed Nov. 16, 2010, Yang, et al. |
U.S. Appl. No. 13/021,814, filed Feb. 7, 2011, Jin, Ming, et al. |
U.S. Appl. No. 13/031,818, filed Feb. 22, 2011, Xu, Changyou, et al. |
U.S. Appl. No. 13/050,129, filed Mar. 17, 2011, Tan, et al. |
U.S. Appl. No. 13/050,765, filed Mar. 17, 2011, Yang, et al. |
U.S. Appl. No. 13/088,119, filed Apr. 15, 2011, Zhang, et al. |
U.S. Appl. No. 13/088,146, filed Apr. 15, 2011, Li, et al. |
U.S. Appl. No. 13/088,178, filed Apr. 15, 2011, Sun, et al. |
U.S. Appl. No. 13/126,748, filed Apr. 28, 2011, Tan. |
U.S. Appl. No. 13/167,764, filed Jun. 24, 2011, Li, Zongwang, et al. |
U.S. Appl. No. 13/167,771, filed Jun. 24, 2011, Li, Zongwang, et al. |
U.S. Appl. No. 13/167,775, filed Jun. 24, 2011, Li, Zongwang. |
U.S. Appl. No. 13/186,146, filed Jul. 19, 2011, Mathew, et al. |
U.S. Appl. No. 13/186,213, filed Jul. 19, 2011, Mathew, et al. |
U.S. Appl. No. 13/186,234, filed Jul. 19, 2011, Xia, Haitao, et al. |
U.S. Appl. No. 13/186,251, filed Jul. 19, 2011, Xia, Haitao, et al. |
U.S. Appl. No. 13/186,174, filed Jul. 19, 2011, Mathew, et al. |
U.S. Appl. No. 13/186,197, filed Jul. 19, 2011, Mathew, George et al. |
U.S. Appl. No. 13/213,751, filed Aug. 19, 2011, Zhang, Fan, et al. |
U.S. Appl. No. 13/213,808, filed Aug. 19, 2011, Jin, Ming. |
U.S. Appl. No. 13/220,142, filed Aug. 29, 2011, Chang, Wu, et al. |
U.S. Appl. No. 13/227,538, filed Sep. 8, 2011, Yang, Shaohua, et al. |
U.S. Appl. No. 13/227,544, filed Sep. 8, 2011, Yang, Shaohua, et al. |
U.S. Appl. No. 13/239,683, filed Sep. 22, 2011, Xu, Changyou. |
U.S. Appl. No. 13/239,719, filed Sep. 22, 2011, Xia, Haitao, et al. |
U.S. Appl. No. 13/251,342, filed Oct. 2, 2011, Xia, Haitao, et al. |
U.S. Appl. No. 13/269,832, filed Oct. 10, 2011, Xia, Haitao, et al. |
U.S. Appl. No. 13/269,852, filed Oct. 10, 2011, Xia, Haitao, et al. |
U.S. Appl. No. 13/284,819, filed Oct. 28, 2011, Tan, Weijun, et al. |
U.S. Appl. No. 13/284,730, filed Oct. 28, 2011, Zhang, Fan, et al. |
U.S. Appl. No. 13/284,754, filed Oct. 28, 2011, Zhang, Fan, et al. |
U.S. Appl. No. 13/284,767, filed Oct. 28, 2011, Zhang, Fan, et al. |
U.S. Appl. No. 13/284,826, filed Oct. 28, 2011, Tan, Weijun, et al. |
U.S. Appl. No. 13/295,150, filed Nov. 14, 2011, Li, Zongwang, et al. |
U.S. Appl. No. 13/295,160, filed Nov. 14, 2011, Li, Zongwang, et al. |
U.S. Appl. No. 13/251,340, filed Oct. 3, 2011, Xia, Haitao, et al. |
Amer et al “Design Issues for a Shingled Write Disk System” MSST IEEE 26th Symposium May 2010. |
Bahl, et al “Optimal decoding of linear codes for Minimizing symbol error rate”, IEEE Trans. Inform. Theory, vol. 20, pp. 284-287, Mar. 1974. |
Casado et al., Multiple-rate low-denstiy parity-check codes with constant blocklength, IEEE Transations on communications, Jan. 2009, vol. 57, pp. 75-83. |
Collins and Hizlan, “Determinate State Convolutional Codes” IEEE Transactions on Communications, Dec. 1993. |
Eleftheriou, E. et al., “Low Density Parity-Check Codes for Digital Subscriber Lines”, Proc ICC 2002, pp. 1752-1757. |
Fisher, R et al., “Adaptive Thresholding”[online] 2003 [retrieved on May 28, 2010] Retrieved from the Internet <URL:http://homepages.inf.ed.ac.uk/rbf/HIPR2/adpthrsh.htm. |
Fossnorier, Marc P.C. “Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Maricies” IEEE Transactions on Information Theory, vol. 50, No. 8 Aug. 8, 2004. |
Gibson et al “Directions for Shingled-Write and Two-Dimensional Magnetic Recording System Architectures: Synergies with Solid-State Disks” Carnegie Mellon Univ. May 1, 2009. |
K. Gunnam et al., “Next Generation iterative LDPC solutions for magnetic recording storage”, invited paper. The Asilomar Conference on Signals, Systems, and Computers, Nov. 2008. |
K. Gunnam et al., “Value-Reuse Properties of Min-Sum for GF(q)” (dated Oct. 2006) Dept. of ECE, Texas A&M University Technical Note, published about Aug. 2010. |
K. Gunnam et al., “Value-Reuse Properties of Min-Sum for GF(q)”(dated Jul. 2008) Dept. of ECE, Texas A&M University Technical Note, published about Aug. 2010. |
K. Gunnam “Area and Energy Efficient VLSI Architectures for Low-Density Parity-Check Decoders Using an On-The-Fly Computation” dissertation at Texas A&M University, Dec. 2006. |
Han and Ryan, “Pinning Techniques for Low-Floor Detection/Decoding of LDPC-Coded Partial Response Channels”, 5th International Symposium on Turbo Codes &Related Topics, 2008. |
Hagenauer, J. et al A Viterbi Algorithm with Soft-Decision Outputs and its Applications in Proc. IEEE Globecom, pp. 47. 11-47 Dallas, TX Nov. 1989. |
Lee et al., “Partial Zero-Forcing Adaptive MMSE Receiver for DS-CDMA Uplink in Multicell Environments” IEEE Transactions on Vehicular Tech. vol. 51, No. 5, Sep. 2002. |
Lin et al “An efficient VLSI Architecture for non binary LDPC decoders”—IEEE Transaction on Circuits and Systems II vol. 57, Issue 1 (Jan. 2010) pp. 51-55. |
Mohsenin et al., “Split Row: A Reduced Complexity, High Throughput LDPC Decoder Architecture”, pp. 1-6, printed from www.ece.ucdavis.edu on Jul. 9, 2007. |
Moon et al, “Pattern-dependent noise prediction in signal-dependent Noise,” IEEE JSAC, vol. 19, No. 4 pp. 730-743, Apr. 2001. |
Perisa et al “Frequency Offset Estimation Based on Phase Offsets Between Sample Correlations” Dept. of Info. Tech. University of Ulm 2005. |
Sari H et al., “Transmission Techniques for Digital Terrestrial TV Broadcasting” IEEE Communications Magazine, IEEE Service Center Ny, NY vol. 33, No. 2 Feb. 1995. |
Selvarathinam, A.: “Low Density Parity-Check Decoder Architecture for High Throughput Optical Fiber Channels” IEEE International Conference on Computer Design (ICCD '03) 2003. |
Shu Lin, Ryan, “Channel Codes, Classical and Modern” 2009, Cambridge University Press, pp. 213-222. |
Unknown, “Auto threshold and Auto Local Threshold” [online] [retrieved May 28, 2010] Retrieved from the Internet: <URL:http://www.dentristy.bham.ac.uk/landinig/software/autoth. |
Vasic, B., “High-Rate Low-Density Parity-Check Codes Based on Anti-Pasch Affine Geometries,” Proc ICC 2002, pp. 1332-1336. |
Vasic, B., “High-Rate Girth-Eight Codes on Rectangular Integer Lattices”, IEEE Trans. Communications, vol. 52, Aug. 2004, pp. 1248-1252. |
Wang Y et al., “A Soft Decision Decoding Scheme for Wireless COFDM With Application to DVB-T” IEEE Trans. on Consumer elec., IEEE Service Center, NY,NY vo. 50, No. 1 Feb. 2004. |
Weon-Cheol Lee et al., “Vitierbi Decoding Method Using Channel State Info. in COFDM System” IEEE Trans. on Consumer Elect., IEEE Service Center, NY, NY vol. 45, No. 3 Aug. 1999. |
Xia et al, “A Chase-GMD algorithm of Reed-Solomon codes on perpendicular channels”, IEEE Transactions on Magnetics, vol. 42 pp. 2603-2605, Oct. 2006. |
Xia et al, “Reliability-based Reed-Solomon decoding for magnetic recording channels”, IEEE International Conference on Communication pp. 1977-1981, May 2008. |
Yeo et al., “VLSI Architecture for Iterative Decoders in Magnetic Storage Channels”, Mar. 2001, pp. 748-755, IEEE trans. Magnetics, vol. 37, No. 2. |
Youn, et al. “BER Perform. Due to Irrreg. of Row-Weight Distrib. of the Parity-Chk. Matirx in Irreg. LDPC Codes for 10-Gb/s Opt. Signls” Jrnl of Lightwave Tech., vol. 23, Sep. 2005. |
Zhong et al., “Area-Efficient Min-Sum Decoder VLSI Architecture for High-Rate QC-LDPC Codes in Magnetic Recording”, pp. 1-15, Submitted 2006, not yet published. |
Zhong, “Block-LDPC: A Practical LDPC Coding System Design Approach”, IEEE Trans. on Circuits, Regular Papers, vol. 5, No. 4, pp. 766-775, Apr. 2005. |
Zhong et al., “Design of VLSI Implementation-Oriented LDPC Codes”, IEEE, pp. 670-673, 2003. |
Zhong et al., “High-Rate Quasi-Cyclic LDPC Codes for Magnetic Recording Channel with Low Error Floor”, ISCAS, IEEE pp. 3546-3549, May 2006. |
Zhong et al., “Iterative MAX-LOG-MAP and LDPC Detector/Decoder Hardware Implementation for Magnetic Read Channel”, SRC TECHRON, pp. 1-4, Oct. 2005. |
Zhong et al., “Joint Code-Encoder Design for LDPC Coding System VLSI Implementation”, ISCAS, IEEE pp. 389-392, May 2004. |
Zhong et al., “Quasi Cyclic LDPC Codes for the Magnetic Recording Channel: Code Design and VSLI Implementation”, IEEE Transactions on Magnetics, v. 43, pp. 1118-1123, Mar. 2007. |
Zhong, “VLSI Architecture of LDPC Based Signal Detection and Coding System for Magnetic Recording Channel”, Thesis, RPI, Troy, NY, pp. 1-95, May 2006. |
Number | Date | Country | |
---|---|---|---|
20130024740 A1 | Jan 2013 | US |