摘要:
A circuit for a high-density data recording channel includes a first data detector, a second data detector, one or more multiplexers and a sequence identifier. The first data detector generates a first data detector output, and the second data detector generates a second data detector output. The multiplexers change between a first mode and a second mode to alternately receive the first data detector output and the second data detector output. The sequence identifier receives a data sequence including at least one of a first data sequence, such as VFO data, and a second data sequence, such as random data. The second data sequence includes a greater number of signal levels than the first data sequence. The sequence identifier changes the multiplexers between the first mode and the second mode based on whether the data sequence is the first data sequence or the second data sequence. The data sequence includes a plurality of timing stages. The sequence detector can at least partially control a loop bandwidth of the circuit based on the timing stage of the data sequence.
摘要:
In one embodiment, a read channel comprises: a preprocessor for receiving a first signal and producing a second signal from the first signal using current values of a positive coefficient, a zero coefficient, and a negative coefficient; an interpolator for producing a third signal based on the second signal; and a slicer for producing a fourth signal from the third signal by estimating a level for the third signal. The fourth signal is at one of three levels consisting of a positive level, a zero level, and a negative level. For every n first signals received by the preprocessor, the current value of one of the positive coefficient, the zero coefficient, and the negative coefficient is adjusted depending on which of the three levels the fourth signal is at.
摘要:
In one embodiment, a read channel comprises: a preprocessor for receiving a first signal and producing a second signal from the first signal using current values of a positive coefficient, a zero coefficient, and a negative coefficient; an interpolator for producing a third signal based on the second signal; and a slicer for producing a fourth signal from the third signal by estimating a level for the third signal. The fourth signal is at one of three levels consisting of a positive level, a zero level, and a negative level. For every n first signals received by the preprocessor, the current value of one of the positive coefficient, the zero coefficient, and the negative coefficient is adjusted depending on which of the three levels the fourth signal is at.
摘要:
The claimed embodiments provide methods, apparatuses and systems directed to run-length limited (RLL) coding of data. In one implementation, concatenatable RLL codes with run lengths of zeroes not exceeding k are constructed for any rate N/(N+1) where N≦2k−2+k−1. As code rates increase, the value of k departs from the minimum possible value more slowly than that of many other codes. Further, occurrences of k-bit run lengths occur only at the juncture of two codewords. Due to this, the codes are mostly k−1. This quality makes the codes ideal for parity bit insertion applications such as LDPC channels. The method, in one implementation, places the bit addresses of violating sequences in a table at the beginning of the codeword, and the user data, occupying the locations where the table entries are placed, are moved into the locations of the violating sequences. This is done iteratively and in a way which provides for cases in which the violating sequence is inside the address table itself.
摘要:
A digital data recovery system for converting a suboptimal signal into a converted signal that closely approximates an original signal includes a first data filter, a first interpolator and a second interpolator. The first data filter filters the suboptimal signal to generate a first filtered signal. The first interpolator receives the first filtered signal and generates a first interpolated signal. Substantially concurrently, the second interpolator receives the suboptimal signal and generates a second interpolated signal. The digital data recovery system may further comprise a second data filter that receives the second interpolated signal and generates a second filtered signal. Further, the first data filter can include a set of first coefficients and the second data filter can include a set of second coefficients. Moreover, the second coefficients can be updated and subsequently transformed in order to update the first coefficients.
摘要:
Timing recovery in partial-response-based magnetic recording systems customarily employs the “decision-directed” method wherein phase error is recovered from the differences between the noise-corrupted received signal samples and their estimated ideal (noise and phase error free) values. The filtered phase error drives a numerically-controlled oscillator which determines the instants at which the signal is resampled, attempting to place said instants at the ideal sampling times. The resampled signal contains errors due to mistiming as well as to the original corrupting noise, and these errors directly influence the success of subsequent detection. However, the noise can be reduced using adaptive linear prediction, having the effect of reducing the output error for a given noise input, or maintaining the same error for a larger noise input.
摘要:
The claimed embodiments provide methods, apparatuses and systems directed to run-length limited (RLL) coding of data. In one implementation, concatenatable RLL codes with run lengths of zeroes not exceeding k are constructed for any rate N/(N+1) where N≦2k−2+k−1. As code rates increase, the value of k departs from the minimum possible value more slowly than that of many other codes. Further, occurrences of k-bit run lengths occur only at the juncture of two codewords. Due to this, the codes are mostly k−1. This quality makes the codes ideal for parity bit insertion applications such as LDPC channels. The method, in one implementation, places the bit addresses of violating sequences in a table at the beginning of the codeword, and the user data, occupying the locations where the table entries are placed, are moved into the locations of the violating sequences. This is done iteratively and in a way which provides for cases in which the violating sequence is inside the address table itself.
摘要:
An estimator of the noiseless output of a noisy partial response channel is described. The estimator operates recursively. In each iteration, the estimator processes a window of the N most recently received noisy channel outputs to compare output level metrics for all possible channel output level, and selects a noiseless output level with maximal posterior probability.
摘要:
An estimator of the noiseless output of a noisy partial response channel is described. The estimator operates recursively. In each iteration, the estimator processes a window of the N most recently received noisy channel outputs to compare subsequence metrics for all possible channel output subsequences of length N, and selects a noiseless subsequence with maximal posterior probability. One noiseless sample of the selected subsequence is output as an estimate of one of the channel outputs.
摘要:
A method and device for detecting a peak which is substantially the same as the actual peak are disclosed. In one embodiment, the device includes a filter, a shift register, a controller and a digital interpolator. The filter is configured to receive a plurality of signal samples and the shift register, which is coupled with the filter, has multiple registers. The shift register is configured to receive the plurality of signal samples and to shift the plurality of signal samples through the registers. The controller is coupled with the shifter register and is configured to detect a zero-crossing event in the signal samples. The digital interpolator is coupled with the controller and configured to perform a binary search to identify a peak substantially the same as the actual peak.