The present inventions are related to systems and methods for storing data, and more particularly to systems and methods for characterizing a storage device.
Manufacturing storage devices includes a process of operating a given device to determine whether it satisfies defined quality criteria. As the quality criteria may allow only a small number of failures, it may take a long period of testing to determine whether the small number of failures occurs or not. This long period of time increases the cost of characterizing the device.
Hence, for at least the aforementioned reasons, there exists a need in the art for advanced systems and methods for characterizing a storage device.
The present inventions are related to systems and methods for storing data, and more particularly to systems and methods for characterizing a storage device.
Various embodiments of the present invention provide data processing circuits that include: a data detector circuit and a bias calculation circuit. The data detector circuit is operable to apply a data detection algorithm to a first data set to yield a first series of soft decision data, and to apply the data detection algorithm to a second data set to yield a second series of soft decision data. The bias calculation circuit operable to calculate a series of bias values based at least in part on the first series of soft decision data and the second series of soft decision data. The series of bias values correspond to a conversion between the first series of soft decision data and the second series of soft decision data. In some instances of the aforementioned embodiments, the data detection algorithm is a maximum a posteriori data detection algorithm. In other instances, the data detection algorithm is a Viterbi data detection algorithm.
In some instances of the aforementioned embodiments, the bias calculation circuit includes a histogram calculation circuit operable to generate a first histogram of the values of the first series of soft decision data, and to generate a second histogram of the values of the second series of soft decision data. In some cases, the bias calculation circuit further includes a histogram normalizing circuit operable to normalize the first histogram to yield a first normalized histogram, and to normalize the second histogram to yield a second normalized histogram. In a particular case, the histogram normalizing circuit is operable to divide the number of instances of each value of the first series of soft decision data in the first histogram by a sum of the number of instances of all values of the first series of soft decision data in the first histogram, and to divide the number of instances of each value of the second series of soft decision data in the second histogram by a sum of the number of instances of all values of the second series of soft decision data in the second histogram.
In various cases, the bias calculation circuit further includes a cumulative mass calculation circuit operable to calculate a first cumulative mass of the first normalized histogram, and to calculate a second cumulative mass of the second normalized histogram. In some cases, the cumulative mass calculation circuit is operable to, for each value of the first series of soft decision data in the first histogram, sum the number of instances of each value of the first series of soft decision data in the first histogram less than a current value of the first series of soft decision data in the first histogram, and to, for each value of the second series of soft decision data in the second histogram, sum the number of instances of each value of the second series of soft decision data in the second histogram less than a current value of the second series of soft decision data in the second histogram. In one or more cases, the bias calculation circuit further includes a bias value calculation circuit operable to calculate the series of bias values based at least in part on the first cumulative mass and the second cumulative mass.
Various embodiments of the present invention provide methods for generating bias values to predictably increasing an error rate of a data processing circuit. Such methods include: receiving a first data set; applying a data detection algorithm by a data detector circuit to the first data set to yield a first series of soft decision data; receiving a second data set; applying the data detection algorithm by the data detector circuit to the second data set to yield a second series of soft decision data; calculating a series of bias values based at least in part on the first series of soft decision data and the second series of soft decision data, wherein the series of bias values correspond to a conversion between the first series of soft decision data and the second series of soft decision data.
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.
a is a histogram diagram showing distribution of soft data outputs for both a standard operation and a degraded operation;
b is a histogram diagram showing distribution of normalized soft data outputs for both a standard operation and a degraded operation;
The present inventions are related to systems and methods for storing data, and more particularly to systems and methods for characterizing a storage device.
Processed analog signal 112 is provided to an analog to digital converter circuit 114 that samples processed analog signal 112 to yield a corresponding series of digital samples 116. Analog to digital converter circuit 114 may be any circuit known in the art that is capable of converting a continuous time signal to a series of digital values. Digital samples 116 are provided to an equalizer circuit 120 that may be implemented as a digital finite impulse response circuit as are known in the art. Equalizer circuit 120 performs an equalization on digital samples 116 to yield an equalized output 125. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of equalizer circuits that may be used in relation to different embodiments of the present invention.
Equalized output 125 is provided to a data detector circuit 135 and to a buffer circuit 130. Data detector circuit 135 applies a data detection algorithm to equalized output 125 to yield a detected output 137. Data detector circuit 135 may be any data detector circuit known in the art including, but not limited to, a Viterbi algorithm data detector circuit or a maximum a posteriori data detector circuit. In some cases, detected output 137 includes both hard decision data and soft decision data. As used herein, the phrase “hard decision data” refers to a data output that indicates a certain logic level for a given bit period or bit periods. For example, in a binary system, the logic level may be a ‘1’ or a ‘0’. As another example, in a two bit binary system, the logic level may be “00’, ‘01’, ‘10’ or ‘11’. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of hard decision data that may be produced by a data detector circuit. As used herein, the phrase “soft decision data” refers to a data output that indicates a likelihood that data detector circuit 135 correctly detected data for the bit period or bit periods. In one particular embodiment of the present invention, soft decision data ranges from negative fifteen (−15) to positive fifteen (+15) with −15 indicating that the decision is highly unlikely to be correct and +15 indicating that the decision is highly likely to be correct. The increasing values from −14 to +14 correspond to a corresponding increase in the likelihood that the decision was correct. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of values and ranges that may be used to represent the soft decision data.
In a non-binary data processing system, groups of symbols are processed together. For example, in a two bit, non-binary data processing system groups of two bit symbols are processed together with the groups of two bit symbols being capable of representing four possible outputs (i.e., 00, 01, 10, 11). In such systems, metrics (i.e., Euclidean distances) are calculated for each of the possible symbol values. In the case of two bit symbols, four metrics are calculated. A large metric value indicates that the corresponding symbol value is unlikely, and a small metric indicates a higher degree of likelihood. A symbol is in error when the correctly selected symbol value does not correspond to the smallest of the metrics. In contrast, a symbol is determined to be correct when the correctly selected symbol value corresponds to the smallest of the metrics. The later discussed decoding algorithm processes the multiple metrics to correct any errors. Detected output 137 includes the metrics for each of the possible values for the symbol values as soft data decisions, and may or may not include the symbol value corresponding to the smallest metric.
Detected output 137 is provided to both a soft data biasing circuit 140 and a selector circuit 150. Soft data biasing circuit 140 is operable to bias the soft decision data included in detected output 137 to yield a modified detected output 142. In particular, the soft decision data from detected output 137 is converted from non-binary metrics to relative metrics, biased by applying noise biasing to the relative metrics to yield biased relative metrics, and the biased relative metrics converted back into non-binary metrics (i.e., updated binary metrics).
Converting from the non-binary metrics to relative metrics includes calculating relative differences between the received non-binary metrics such that a zero value is assigned to the metric corresponding to the most likely symbol value, and non-negative metrics are assigned to all other possible symbol values. Using a two-bit, non-binary data processing system as an example where there are four possible symbol values (i.e., 00, 01. 10, 11) and corresponding non-binary metrics (i.e., M00, M01, M10, and M11) included in detected output 137, relative metrics (RM00, RM01, RM10, and RM11) are calculated in accordance with the following equations:
RM00=M00−Reference Metric,
RM01=M01−Reference Metric,
RM10=M10−Reference Metric, and
RM11=M11−Reference Metric,
where the Reference Metric is the metric value corresponding to the true symbol value (i.e., a test pattern) that was written. The metric value corresponding to the true symbol value may be regenerated from memory or using another approach such as accessing the reference metric from a pre-programmed memory.
As will be appreciated, the relative metric corresponding to the correct symbol value is zero where it was properly selected. If the data detection is correct, then all metrics would be non-negative. Alternatively, if detection is not correct, then the symbol with the minimum metric will be different from the correct symbol. In this case of an incorrect detection, the relative metric for the detector had decision symbol is negative.
Soft data biasing circuit 140 biases the non-zero relative metrics to yield biased relative metrics. This may be done in a way that distorts detected output 137 such that the errors resulting from the distortion is predictably related to the number of errors that would result where no distortion is applied. By predictably degrading the operation of data processing circuit 100, the time required to generate a sufficient number of errors to characterize a system in which data processing circuit 100 is deployed is decreased, and because the number of errors corresponding from the degraded operation is predictably related to an actual number of errors, the characterization represents the actual operation of the system. In some cases, all of the non-zero relative metrics are replaced by biased relative metrics 167 accessed from a biasing look up table 165. Biased relative metrics 167 corresponds to the corresponding calculated relative metrics that are provided to biasing look up table 165 as an address 169. In turn, soft data biasing circuit 140 replaces the respective relative metrics using the returned biased relative metrics.
It has been determined that the errors are mostly related to the most likely symbol (with a small relative metric value), and the biasing function for the other less likely symbol values is less relevant to error correction performance. Because of this, the same bias value may be applied to all of the non-zero relative metrics in an effort to save hardware complexity. Thus, for example, a single relative metric is provided to biasing look up table 165 as an address 169 that returns a single biased relative metric 167. This biased relative metric 167 is used in place of all of the non-zero relative metrics. In other cases, the bias values may be selected based upon the correctly selected symbol value (i.e., the lowest relative metric value) as in a magnetic based storage device there is intrinsically more noise with transitioning symbols (e.g., ‘01’ and ‘10’) compared with non-transitioning symbols (e.g., ‘11’ and ‘00’) due to the nature of magnetic recording physics.
Converting the biased relative metrics back into non-binary metrics is substantially the inverse of the previously described conversion from the non-binary metrics into the relative metrics. Using the same two-bit, non-binary data processing system as an example, updated non-binary metrics (i.e., UNBM00, UNBM01, UBM10, and UNBM11) are calculated from the biased relative metrics (i.e., BRM00, BRM01, BRM10, and BRM11) in accordance with the following equations:
UNBM00=BRM00−Minimum Relative Metric,
UNBM01=BRM01−Minimum Relative Metric,
UNBM10=BRM10−Minimum Relative Metric, and
UNBM11=BRM11−Minimum Relative Metric,
where the Minimum Relative Metric is the biased relative metric (BRM00, BRM01, BRM10, and BRM11) that has the lowest value. The updated non-biased metrics are provided as part of modified detected output 142. It should be noted that while the example of soft biasing circuit 140 is a two-bit example that the same approach may be expanded for application to non-binary data processing systems operating on symbols including three or more bits per symbol.
In addition, soft data biasing circuit 140 provides soft decision data from detected output 137 and soft decision data from modified detected output 142 as a soft decision output 144 to a histogram based look up table calculation circuit 180. Histogram based look up table calculation circuit 180 histograms the instances of the received soft decision output 144 corresponding to multiple instances of detected output 137. Histograms corresponding to two different instances of detected output 137 (i.e., a first series of detected outputs corresponding to a first codeword, and a second series of detected outputs corresponding to a second codeword) each exhibiting a different error rate are used to calculate bias values 182 corresponding to the degradation between the two instances of detected output 137.
Turning to
Using the example histogram A and histogram B, the process of calculating bias values 182 includes: (1) histogram the data received as soft decision outputs 144 to yield histogram A and histogram B, (2) normalize histogram A and histogram B to yield data similar to curve 501 and curve 503, (3) compute a normalized cumulative mass function for the received histogram data, and (4) compute bias values 182 using the calculated cumulative mass function. Normalizing histogram A and histogram B, computing the normalized mass function, and computing bias values 182 may be done in accordance with the following pseudocode:
The aforementioned pseudocode assumes that the number of instances in histogram A (i.e., length of histogram A) is the same as that of histogram B. Returning to
The calculated bias values 182 are stored to a bias look up table 165. As previously mentioned, non-zero relative metrics are calculated and an address 169 corresponding to the non-zero relative metrics is provided to biasing look up table 165. In response, biasing look up table 165 provides bias values 167 that may be used to degrade the circuit operation to exhibit a higher error rate difference corresponding to that of the two histograms used to calculate bias values 182.
Selector circuit 150 selects between detected output 137 and modified detected output 142 to provide as a selected output 152. The selection between detected output 137 and modified detected output 142 is made based upon a selector input 172 that is controlled by a biasing control circuit 170. In some embodiments of the present invention, biasing control circuit 170 is a programmable register. When selector input 172 is asserted as a logic ‘1’, modified detected output 142 is provided as selected output 152. Alternatively, when selector input 172 is asserted as a logic ‘0’, detected output 137 is provided as selected output 152.
Selected output 152 is provided to a data decoder circuit 155. Data decoder circuit 155 applies a data decoding algorithm to selected output 152 to yield a decoded output 157. Data decoder circuit 155 may be any data decoder circuit known in the art. In one embodiment of the present invention, data decoder circuit 155 is a non-binary low density parity check decoder circuit. Where decoded output 157 fails to converge (i.e., includes errors or differences from an originally written data set), data detector circuit 135 may reprocess the data set used to derive decoded output 157 that is retrieved from buffer circuit 130 as buffered data 132. The reprocessing is done using decoded output 157 as a guide. The combination of applying both the data detection algorithm and the data decoding algorithm is referred to as a global iteration. The process of deriving the original data set may include many global iterations.
Turning to
RM00=M00−Reference Metric,
RM01=M01−Reference Metric,
RM10=M10−Reference Metric, and
RM11=M11−Reference Metric,
where the Reference Metric is the metric value corresponding to the true symbol value (i.e., a test pattern) that was written. The metric value corresponding to the true symbol value may be regenerated from memory or using another approach such as accessing the reference metric from a pre-programmed memory.
The aforementioned Lowest Metric is provided by conversion circuit 205 as an address 169 to biasing look up table 165. In return, biasing look up table 165 provides a corresponding biased relative metric 167. Biased relative metric 167 is provided to a biased relative metrics replacement circuit 220. Biased relative metrics replacement circuit 220 replaces non-zero relative metrics (three of RM00, RM01, RM10, and RM11) with respective values received as biased relative metrics (three of BRM00, BRM01, BRM10, and BRM11). In some cases, biased relative metric 167 is a single biased relative metric that is used to replace the three non-zero relative metrics. In other cases, biased relative metric 167 is three values used to replace corresponding to the three non-zero relative metrics.
The biased relative metrics (BRM00, BRM01, BRM10, BRM11) are provided to a biased relative metrics to updated non-binary metrics conversion circuit 230. Conversion circuit 230 performs substantially the inverse conversion of that performed by conversion circuit 205. Using the same two-bit, non-binary data processing system as an example, updated non-binary metrics (i.e., UNBM00, UNBM01, UBM10, and UNBM11) are calculated from the biased relative metrics (i.e., BRM00, BRM01, BRM10, and BRM11) in accordance with the following equations:
UNBM00=BRM00−Minimum Relative Metric,
UNBM01=BRM01−Minimum Relative Metric,
UNBM10=BRM10−Minimum Relative Metric, and
UNBM11=BRM11−Minimum Relative Metric,
where the Minimum Relative Metric is the biased relative metric (BRM00, BRM01, BRM10, and BRM11) that has the lowest value. The updated non-biased metrics are provided as part of modified detected output 142. It should be noted that while the example of soft biasing circuit 200 is a two-bit example that the same approach may be expanded for application to non-binary data processing systems operating on symbols including three or more bits per symbol.
Turning to
Data processing circuit 300 includes an analog front end circuit 310 that receives an analog input 305 and provides a processed analog signal 312. Analog front end circuit 310 may be any analog processing circuit known in the art. In one particular embodiment of the present invention, analog front end circuit 310 includes an amplifier circuit and a continuous time filter (i.e., an analog filter) that operate to amplify and noise filter the received input to yield processed analog signal 312. Analog signal 305 may be derived from a variety of sources including, but not limited to, a storage medium or a transfer medium. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of sources from which analog input signal 305 may be derived.
Processed analog signal 312 is provided to an analog to digital converter circuit 314 that samples processed analog signal 312 to yield a corresponding series of digital samples 316. Analog to digital converter circuit 314 may be any circuit known in the art that is capable of converting a continuous time signal to a series of digital values. Digital samples 316 are provided to an equalizer circuit 320 that may be implemented as a digital finite impulse response circuit as are known in the art. Equalizer circuit 320 performs an equalization on digital samples 316 to yield an equalized output 325. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of equalizer circuits that may be used in relation to different embodiments of the present invention.
Equalized output 325 is provided to a data detector circuit 335 and to a buffer circuit 330. Data detector circuit 335 applies a data detection algorithm to equalized output 325 to yield a detected output 337. Data detector circuit 335 may be any data detector circuit known in the art including, but not limited to, a Viterbi algorithm data detector circuit or a maximum a posteriori data detector circuit. In some cases, detected output 337 includes both hard decision data and soft decision data. As used herein, the phrase “hard decision data” refers to a data output that indicates a certain logic level for a given bit period or bit periods. For example, in a binary system, the logic level may be a ‘1’ or a ‘0’. As another example, in a two bit binary system, the logic level may be “00’, ‘01’, ‘10’ or ‘11’. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of hard decision data that may be produced by a data detector circuit. As used herein, the phrase “soft decision data” refers to a data output that indicates a likelihood that data detector circuit 335 correctly detected data for the bit period or bit periods. In one particular embodiment of the present invention, soft decision data ranges from negative fifteen (−15) to positive fifteen (+15) with −15 indicating that the decision is highly unlikely to be correct and +15 indicating that the decision is highly likely to be correct. The increasing values from −14 to +14 correspond to a corresponding increase in the likelihood that the decision was correct. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of values and ranges that may be used to represent the soft decision data.
In a non-binary data processing system, groups of symbols are processed together. For example, in a two bit, non-binary data processing system groups of two bit symbols are processed together with the groups of two bit symbols being capable of representing four possible outputs (i.e., 00, 01, 10, 11). In such systems, metrics (i.e., Euclidean distances) are calculated for each of the possible symbol values. In the case of two bit symbols, four metrics are calculated. A large metric value indicates that the corresponding symbol value is unlikely, and a small metric indicates a higher degree of likelihood. A symbol is in error when the correctly selected symbol value does not correspond to the smallest of the metrics. In contrast, a symbol is determined to be correct when the correctly selected symbol value corresponds to the smallest of the metrics. The later discussed decoding algorithm processes the multiple metrics to correct any errors. Detected output 337 includes the metrics for each of the possible values for the symbol values as soft data decisions, and may or may not include the symbol value corresponding to the smallest metric.
Detected output 337 is provided to both a soft data biasing circuit 340 and a selector circuit 350. Soft data biasing circuit 340 is operable to bias the soft decision data included in detected output 337 to yield a modified detected output 342. In particular, the soft decision data from detected output 337 is converted from non-binary metrics to relative metrics, biased by applying noise biasing to the relative metrics to yield biased relative metrics, and the biased relative metrics converted back into non-binary metrics (i.e., updated binary metrics).
Converting from the non-binary metrics to relative metrics includes calculating relative differences between the received non-binary metrics such that a zero value is assigned to the metric corresponding to the most likely symbol value, and to non-negative metrics are assigned to all other possible symbol values. Using a two-bit, non-binary data processing system as an example where there are four possible symbol values (i.e., 00, 01. 10, 11) and corresponding non-binary metrics (i.e., M00, M01, M10, and M11) included in detected output 137, relative metrics (RM00, RM01, RM10, and RM11) are calculated in accordance with the following equations:
RM00=M00−Reference Metric,
RM01=M01−Reference Metric,
RM10=M10−Reference Metric, and
RM11=M11−Reference Metric,
where the Reference Metric is the metric value corresponding to the true symbol value (i.e., a test pattern) that was written. The metric value corresponding to the true symbol value may be regenerated from memory or using another approach such as accessing the reference metric from a pre-programmed memory.
As will be appreciated, the relative metric corresponding to the correct symbol value is zero where it was properly selected. Thus, for each of the incorrect symbol values (i.e., the symbol values that do not correspond to the Lowest Metric), if the corresponding relative metric is positive, application of the data detection algorithm is correctly selecting the appropriate symbol value. Conversely, if any of the relative metrics is negative, application of the data detection algorithm is not correctly selecting the appropriate symbol value.
Soft data biasing circuit 340 biases the non-zero relative metrics to yield biased relative metrics. This may be done in a way that distorts detected output 337 such that the errors resulting from the distortion is predictably related to the number of errors that would result where no distortion is applied. By predictably degrading the operation of data processing circuit 300, the time required to generate a sufficient number of errors to characterize a system in which data processing circuit 300 is deployed is decreased, and because the number of errors corresponding from the degraded operation is predictably related to an actual number of errors, the characterization represents the actual operation of the system. In some cases, all of the non-zero relative metrics are multiplied by the same fixed bias value. In other cases, all of the non-zero relative metrics are multiplied by the same bias value that is selected based upon one or a combination of the non-zero relative metrics. In yet other cases, each of the non-zero relative metrics is multiplied by a respective bias value selected based on the corresponding relative metric. In cases where individual bias values are used, the bias value may be selected based upon both the value of the relative metric and the proximity to zero (i.e., whether it is the closest to zero, the second closest to zero, or the third closest to zero).
It has been determined that the errors are mostly related to the most likely symbol (with a small relative metric value), and the biasing function for the other less likely symbol values is less relevant to error correction performance. Because of this, the same bias value may be applied to all of the non-zero relative metrics in an effort to save hardware complexity. In other cases, the bias values may be selected based upon the correctly selected symbol value (i.e., the lowest relative metric value) as in a magnetic based storage device there is intrinsically more noise with transitioning symbols (e.g., ‘01’ and ‘10’) compared with non-transitioning symbols (e.g., ‘11’ and ‘00’) due to the nature of magnetic recording physics.
In some embodiments of the present invention, the biasing is done by multiplying the relative metrics calculated by soft data biasing circuit 340 by a bias value 367 to yield respective biased relative metrics (BRM). Bias value 367 is provided by a fixed bias values register 365 that may be either programmable or hardwired depending upon the particular implementation. Soft data biasing circuit 340 then converts the biased relative metrics back into non-binary metrics using a process that is substantially the inverse of the previously described conversion from the non-binary metrics into the relative metrics. Using the same two-bit, non-binary data processing system as an example, updated non-binary metrics (i.e., UNBM00, UNBM01, UBM10, and UNBM11) are calculated from the biased relative metrics (i.e., BRM00, BRM01, BRM10, and BRM11) in accordance with the following equations:
UNBM00=BRM00−Minimum Relative Metric,
UNBM01=BRM01−Minimum Relative Metric,
UNBM10=BRM10−Minimum Relative Metric, and
UNBM11=BRM11−Minimum Relative Metric,
where the Minimum Relative Metric is the biased relative metric (BRM00, BRM01, BRM10, and BRM11) that has the lowest value. The updated non-biased metrics are provided as part of modified detected output 342. It should be noted that while the example of soft biasing circuit 340 is a two-bit example that the same approach may be expanded for application to non-binary data processing systems operating on symbols including three or more bits per symbol.
Selector circuit 350 selects between detected output 337 and modified detected output 142 to provide as a selected output 352. The selection between detected output 337 and modified detected output 342 is made based upon a selector input 372 that is controlled by a biasing control circuit 370. In some embodiments of the present invention, biasing control circuit 370 is a programmable register. When selector input 372 is asserted as a logic ‘1’, modified detected output 342 is provided as selected output 352. Alternatively, when selector input 372 is asserted as a logic ‘0’, detected output 337 is provided as selected output 352.
Selected output 352 is provided to a data decoder circuit 355. Data decoder circuit 355 applies a data decoding algorithm to selected output 352 to yield a decoded output 357. Data decoder circuit 355 may be any data decoder circuit known in the art. In one embodiment of the present invention, data decoder circuit 355 is a non-binary low density parity check decoder circuit. Where decoded output 357 fails to converge (i.e., includes errors or differences from an originally written data set), data detector circuit 335 may reprocess the data set used to derive decoded output 357 that is retrieved from buffer circuit 330 as buffered data 332. The reprocessing is done using decoded output 357 as a guide. The combination of applying both the data detection algorithm and the data decoding algorithm is referred to as a global iteration. The process of deriving the original data set may include many global iterations.
Turning to
Data detection is performed on the equalized output (block 420). The data processing may include, but is not limited to, applying a data detection algorithm to the equalized output to yield a detected output. In one embodiment, the data detection process is a Viterbi algorithm detection process or a maximum a posteriori detection process as are known in the art. The detected output may include both hard decision data and soft decision data. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of data detection processes and/or algorithms that can be used in relation to different embodiments of the present invention.
It is determined whether soft data marginalization is selected (block 425). Such soft data marginalization may be selected to predictably increase the number of errors resulting from data processing. By predictably increasing the number of errors resulting from data processing, the time required to generate a sufficient number of errors to characterize a system in which the process is deployed is decreased. Because the number of errors corresponding from the marginalized operation is predictably related to an actual number of errors, the characterization represents the actual operation of the system.
Where soft data marginalization is selected (block 425), the non-binary metrics included as the soft decision data of the detected output are converted to relative metrics (block 430). Converting from the non-binary metrics to relative metrics includes calculating relative differences between the received non-binary metrics such that a zero value is assigned to the metric corresponding to the most likely symbol value, and to non-negative metrics are assigned to all other possible symbol values. Using a two-bit, non-binary data processing system as an example where there are four possible symbol values (i.e., 00, 01. 10, 11) and corresponding non-binary metrics (i.e., M00, M01, M10, and M11) included in detected output 137, relative metrics (RM00, RM01, RM10, and RM11) are calculated in accordance with the following equations:
RM00=M00−Reference Metric,
RM01=M01−Reference Metric,
RM10=M10−Reference Metric, and
RM11=M11−Reference Metric,
where the Reference Metric is the metric value corresponding to the true symbol value (i.e., a test pattern) that was written. The metric value corresponding to the true symbol value may be regenerated from memory or using another approach such as accessing the reference metric from a pre-programmed memory.
The relative metrics are then biased to yield biased relative metrics (BRM00, BRM01, BRM10, and BRM11) (block 435). This may be done, for example, by accessing a biasing look up table based upon one of the non-zero relative metrics as discussed above in relation to
BRM00=(BiasValue)*(RM00),
BRM01=(BiasValue)*(RM01),
BRM10=(BiasValue)*(RM10), and
BRM11=(BiasValue)*(RM11).
The bias value may be a fixed or programmable value similar to that discussed above in relation to
It should be noticed that other approaches may be used to apply the bias. For example, in other embodiments of the present invention, biasing may be done by subtracting the bias value from the corresponding relative metric in accordance with the following equations:
BRM00=RM00−BiasValue,
BRM01=RM01−BiasValue,
BRM10=RM10−BiasValue, and
BRM11=RM11−BiasValue.
Based upon the disclosure provided herein, one of ordinary skill in the art will recognize other approaches for applying bias that may be used in relation to different embodiments of the present invention.
The biased relative metrics are then converted to updated non-binary metrics (UNBM00, UNBM01, UBM10, and UNBM11) (block 440). Using the same two-bit, non-binary data processing system as an example, updated non-binary metrics (i.e., UNBM00, UNBM01, UBM10, and UNBM11) are calculated from the biased relative metrics (i.e., BRM00, BRM01, BRM10, and BRM1) in accordance with the following equations:
UNBM00=BRM00−Minimum Relative Metric,
UNBM01=BRM01−Minimum Relative Metric,
UNBM10=BRM10−Minimum Relative Metric, and
UNBM11=BRM11−Minimum Relative Metric,
where the Minimum Relative Metric is the biased relative metric (BRM00, BRM01, BRM10, and BRM11) that has the lowest value. The updated non-biased metrics are provided as part of a modified detected output (block 445). It should be noted that while the process of flow diagram 400 is explained using a two bit symbol example that the same approach may be expanded for application to non-binary data processing systems operating on symbols including three or more bits per symbol.
Where either soft data marginalization is not selected (block 425) or the marginalization process has completed (blocks 430-445), standard processing of the detected output (block 420) is performed. In particular a data decoding algorithm is applied to the detected output to yield a decoded output (block 450). The decoding algorithm may be, for example, a non-binary low density parity check 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 decoding algorithms that may be applied in relation to different embodiments of the present invention. It is determined whether the decoded output converged (i.e., resulted in a correct identification of the originally written data) (block 455). Where the decoded output converged (block 455), the decoded output is provided as a data output (block 460). Alternatively, where the decoded output failed to converge (block 455), a subsequent data detection process is applied using the decoded output as a guide (block 420).
Turning to
In a typical read operation, read/write head assembly 776 is accurately positioned by motor controller 768 over a desired data track on disk platter 778. Motor controller 768 both positions read/write head assembly 776 in relation to disk platter 778 and drives spindle motor 772 by moving read/write head assembly to the proper data track on disk platter 778 under the direction of hard disk controller 766. Spindle motor 772 spins disk platter 778 at a determined spin rate (RPMs). Once read/write head assembly 778 is positioned adjacent the proper data track, magnetic signals representing data on disk platter 778 are sensed by read/write head assembly 776 as disk platter 778 is rotated by spindle motor 772. The sensed magnetic signals are provided as a continuous, minute analog signal representative of the magnetic data on disk platter 778. This minute analog signal is transferred from read/write head assembly 776 to read channel circuit 710 via preamplifier 770. Preamplifier 770 is operable to amplify the minute analog signals accessed from disk platter 778. In turn, read channel circuit 710 decodes and digitizes the received analog signal to recreate the information originally written to disk platter 778. This data is provided as read data 703 to a receiving circuit. A write operation is substantially the opposite of the preceding read operation with write data 701 being provided to read channel circuit 710. This data is then encoded and written to disk platter 778.
During one or more set up periods, the included performance degradation control circuitry degrades circuit operation to incur a number of otherwise unexpected errors. During this process, soft data is modified to negatively impact circuit performance in a controlled way. As just one of many advantages, the ability to controllably induce errors allows for faster device characterization than is possible where a normal error rate occurs. Such performance degradation may be done during manufacture, and/or may be done once storage device 700 is deployed. The performance degradation control circuitry may be implemented similar to that discussed above in relation to
It should be noted that storage system 700 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 700 may be implemented in either software or firmware, while other functions or blocks are implemented in hardware.
Turning to
Histogram A corresponds to the histogram of the first condition. The cumulative mass of the histogram of the first condition is calculated (block 817). This calculation may be done in accordance with the following pseudocode:
The same process is performed for a data set of a second condition (i.e., a second error rate). In particular, a histogram of relative metrics corresponding to a second condition is calculated (block 820). The second condition is a second data set (i.e., series of values) that when processed yield a second error rate. The histogram corresponding to the second condition (block 820) is normalized (block 825). This normalization may be done in accordance with the following pseudocode:
Histogram B corresponds to the histogram of the second condition. The cumulative mass of the histogram of the second condition is calculated (block 827). This calculation may be done in accordance with the following pseudocode:
Bias values for converting between the first condition and the second condition are sequentially determined (block 830). These bias values may be used to predictably degrade data processing operation as discussed above in relation to
The calculated bias values (LUT[ ]) are then stored to a biasing look up table from which they may be accessed for use in biasing (block 835).
Turning to
Normalized histogram A 917 and a normalized histogram B 919 are provided to a cumulative mass calculation circuit 920 that calculates a cumulative mass A 927 of normalized histogram A 917, and a cumulative mass B 929 of normalized histogram B 919. In some embodiments, the cumulative mass calculations are performed in accordance with the following pseudocode:
Cumulative mass A 927 and Cumulative mass B 929 are provided to a bias value calculation circuit 930 that calculates bias values 182. In some embodiments, the bias values are calculated in accordance with the following pseudocode:
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 |
5317472 | Schweitzer, III | May 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 |
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 |
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 | Kawatani et al. | Dec 2003 | B1 |
6748034 | Hattori et al. | Jun 2004 | B2 |
6757862 | Marianetti | 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 | Raghaven 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 |
7509138 | Shin et al. | Mar 2009 | B2 |
7523375 | Spencer | Apr 2009 | B2 |
7587657 | Haratsch | 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 | 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 | Valentin 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 |
20110075569 | Marrow et al. | Mar 2011 | A1 |
20110080211 | Yang et al. | Apr 2011 | A1 |
20110167246 | Yang et al. | Jul 2011 | 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 |
WO 2010101578 | Sep 2010 | WO |
Entry |
---|
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 | |
---|---|---|---|
20130063835 A1 | Mar 2013 | US |