摘要:
A method and apparatus for detecting spectral null sequences of a spectrally-constrained code on a noisy communications channel. From a Viterbi detector with a trellis structure comprising a plurality of states and edges, predetermined ones of the states and edges in the trellis structure are deleted at preselected times modulo N, such as times .phi. modulo N and/or at intermediate times m modulo N, where m=.phi., thereby to create a time-varying trellis structure for limiting the maximum length of dominant error events. The deleted edges are generally those edges which would have entered or emanated from the deleted states if they were not deleted. The trellis structure may be a so-called systolic structure, in which case the spectral null sequences are preferably DC-free or Nyquist free.
摘要:
Apparatus and method for transmitting spectral null sequences of a spectrally-constrained code over a partial response channel. A Viterbi detector receives the sequences from the channel and has a time-varying detector trellis structure derived from a running-digital-sum (RDS) trellis structure that requires each one of a set of quasicatastrophic sequences to be generated only from a trellis state corresponding to a respective preselected unique RDS value.
摘要:
An improved Viterbi detector is disclosed in which each branch metric is calculated based on noise statistics that depend on the signal hypothesis corresponding to the branch. Also disclosed is a method of reducing the complexity of the branch metric calculations by clustering branches corresponding to signals with similar signal-dependent noise statistics. A feature of this architecture is that the branch metrics (and their corresponding square difference operators) are clustered into multiple groups, where all the members of each group draw input from a single, shared noise predictive filter corresponding to the group. In recording technologies as practiced today, physical imperfections in the representation of recorded user data in the recording medium itself are becoming the dominate source of noise in the read back data. This noise is highly dependent on what was (intended to be) written in the medium. The disclosed Viterbi detector exploits this statistical dependence of the noise on the signal.
摘要:
An improved Viterbi detector is disclosed in which each branch metric is calculated based on noise statistics that depend on the signal hypothesis corresponding to the branch. Also disclosed is a method of reducing the complexity of the branch metric calculations by clustering branches corresponding to signals with similar signal-dependent noise statistics. A feature of this architecture is that the branch metrics (and their corresponding square difference operators) are clustered into multiple groups, where all the members of each group draw input from a single, shared noise predictive filter corresponding to the group. In recording technologies as practiced today, physical imperfections in the representation of recorded user data in the recording medium itself are becoming the dominate source of noise in the read back data. This noise is highly dependent on what was (intended to be) written in the medium. The disclosed Viterbi detector exploits this statistical dependence of the noise on the signal.
摘要:
An improved Viterbi detector is disclosed in which each branch metric is calculated based on noise statistics that depend on the signal hypothesis corresponding to the branch. Also disclosed is a method of reducing the complexity of the branch metric calculations by clustering branches corresponding to signals with similar signal-dependent noise statistics. A feature of this architecture is that the branch metrics (and their corresponding square difference operators) are clustered into multiple groups, where all the members of each group draw input from a single, shared noise predictive filter corresponding to the group. In recording technologies as practiced today, physical imperfections in the representation of recorded user data in the recording medium itself are becoming the dominate source of noise in the read back data. This noise is highly dependent on what was (intended to be) written in the medium. The disclosed Viterbi detector exploits this statistical dependence of the noise on the signal.
摘要:
An improved sampled amplitude read/write channel is provided. The system is an integrated Generalized Partial Response Maximum Likelihood (GPRML) read channel incorporating Read, Write, and Servo modes of operation. One implementation includes a 32/34 rate parity code and matched Viterbi detector, a 32 state Viterbi detector optimal parity processor, robust frame synchronization, self-adaptive equalization, thermal asperity detection and compensation, adaptive magneto-resistive asymmetry compensation, low latency interpolated timing recovery and programmable write precompensation.
摘要:
A method and apparatus for handling end of data processing in a data storage device. The method includes receiving a plurality of user data bits at a write channel. The method further includes appending primary padding bits to user data bits if the plurality of user data bits is less than a multiple of an input block length of an encoder in the write channel and encoding the plurality of user data bits and any primary padding bits into a plurality of encoded data bytes. Additionally, the method includes appending an end of data marker to an end of the plurality of encoded data bytes, wherein the end of data marker has a length of no more than one byte, and writing the plurality of encoded data bytes and the end of data marker to the data store.
摘要:
A method and apparatus for Viterbi detector state metric re-normalization. The method includes fabricating a Viterbi detector (138) having a predetermined number of states, wherein the Viterbi detector (138) stores a state metric value and a branch metric value for each state, and wherein the Viterbi detector (138) implements a trellis diagram. The method includes constructing a Viterbi detector (138) which can support a state metric value having g+h′ number of bits. The number of bits needed to represent the branch metric value is represented by (g) and the additional number of bits needed to represent the state metric value is represented by (h′). The additional number of bits (h′) is less than the additional number of bits (h) determined using the following inequality: 2h−1−h≧K−1, wherein K represent the constraint length of the trellis diagram.
摘要:
Viterbi trellis coding methods and Viterbi detector apparatus are provided for detecting trellis coded data. A systolic array Viterbi detector recursively calculates path metrics and partial sums of metric update equations to determine codeword sequences having minimum mean squared error for Viterbi-type maximum-likelihood data detection. The systolic array Viterbi detector is arranged to eliminate redundant calculations and simplify hardware requirements. Modified butterfly trellis geometries and rotating state metrics arrangements are provided for simplifying the Viterbi detector.
摘要:
In a disk drive providing amplitude sampling data detection, the amplitude of an analog read back signal is sampled at data clock intervals. The resulting analog values are converted to digital equivalent values. The digital equivalent values are each compared to an expected digital values that is representative of the data that was originally recorded on the disk, to thereby generate a different value. The resulting collection of difference values are magnitude segregated, and then stored in a plurality of registers, for later use in providing a histogram that is a measure of the disk drive's read error rate.