Abstract:
Apparatuses and methods for detecting error events in a codeword reproduced by perpendicular magnetic recording medium (PMR. The method includes: generating cyclic redundancy check (CRC) parity bits based on a generator polynomial for a source information sequence to be recorded on PMR medium and recording a codeword in which the generated CRC parity bits are added to the source information sequence; and reading the recorded codeword and an error event in the read codeword. It is possible to detect error events when a codeword recorded by PMR is read, using a small number of bits.
Abstract:
A method of detecting an occurrence of an error event in data and an apparatus for the same are provided. The method includes: preparing an error detection code wherein syndrome sequences for dominant error events are all different; generating a codeword from source data using the error detection code; detecting the occurrence of the dominant error event in the codeword by checking a syndrome computed from the codeword; and determining a type and likely error starting positions of the occurred dominant error event using the syndrome sequences correspond to the syndrome.
Abstract:
Techniques are described for detecting error events in codewords detected from data signals transmitted via a communication system. The error events are detected with an error detection code that corresponds to one or more dominant error events for the communication system. The invention develops a class of error detection codes to detect specific error events of known types. In some embodiments, the communication system comprises a recording system. The error detection coding method may be used in conjunction with error correction processing to provide substantial performance gain compared to conventional parity-based post processing methods. For example, the error correction processing may include one or more correlation filters that correspond to the one or more dominant error events for the communication system. A correction module may correct the codeword based on a type of the detected error event and a location of the detected error event in the codeword.
Abstract:
An information handling system, such as a magnetic disk drive, includes a data channel which has a method and apparatus for detecting binary symbols from a received signal occurring at high data rates. The data channel includes a detector that has two inputs. The detector has a first portion which determines a first estimate of a binary input. The second portion, operating in parallel with the first portion, determines two conditional estimates for a second binary input. The estimate for the second binary input is selected after the first estimate is determined. The first and second estimates for the first and second binary inputs are then output from the detector. Each of the first and second portions of the detector uses a three dimensional observation space with orthogonal coordinate axes. Each of three consecutive synchronous observation samples of the received signal corresponding unambiguously to an axis in the observation space. A decision feedback equalizer removes intersymbol interference terms associated with prior detector outputs. Each detector portion uses a plurality of linear classifiers to partition the observation space. The second and/or third sample of the equivalent channel response is constrained relative to the first for the purpose of simplifying the linear classifiers. Boolean logic functions to decide into which decision region of the observation space a sample maps into. Advantageously, the detector runs at a frequency that is half the frequency of the remaining portions of the read channel.
Abstract:
Apparatus and method for coding to improve the minimum distance properties of sequence detectors operating at high densities in storage systems is presented. The coding scheme of the present invention is referred to as maximum transition run (MTR) code and eliminates data patterns producing long runs of consecutive transitions while imposing the usual k constraint necessary for timing recovery. The code has a distance gaining property similar to an existing (1,k) runlength-limited (RLL) code, but can be implemented with considerably higher code rates. When the MTR code is used with fixed delay tree search (FDTS) or high order partial response maximum likelihood (PRML) detectors, the bit error rate performance improves significantly over existing combinations of codes and detectors.
Abstract:
Provided are a method of decoding an LDPC code for producing several different decoders using a parity-check matrix of the LDPC code, and an LDPC code system including the same. The system includes: an LDPC encoder outputting an LDPC codeword through a channel; a first LDPC decoder decoding the LDPC codeword received through the channel, and when the decoding has failed in a second LDPC decoder, decoding the LDPC codeword according to original parity check matrix of the LDPC codeword, using soft information newly generated after the decoding is ended in the second LDPC decoder; and the second LDPC decoder, when the decoding has failed in the first LDPC decoder, receiving the soft information on each bit from the first LDPC, and decoding the LDPC codeword according to a new parity-check matrix produced from the parity-check matrix of the LDPC codeword using the received soft information on each bit.
Abstract:
A probability is determined, including by obtaining a set of probability ratios, wherein each probability ratio in the set is a ratio of a first probability to a second probability. A probability P(Em=z) that an mth error symbol Em has a level of z is determining based at least in part on one or more dominant error patterns.
Abstract:
In general, the disclosure describes techniques for detecting and correcting single or multiple occurrences of data error patterns. This disclosure discusses the generation and application of high-rate error-pattern-correcting codes to correct single instances of targeted error patterns in codewords, and to further correct a significant portion of multiple instances of targeted error patterns, with the least redundancy. In accordance with the techniques, a lowest-degree generator polynomial may be constructed that targets a set of dominant error patterns that make up a very large percentage of all observed occurrences of errors. The lowest-degree generator polynomial produces distinct, non-overlapping syndrome sets for the target error patterns. The lowest-degree generator polynomial may be constructed such that no two error patterns within the list of dominant error patterns map to the same syndrome set, and the single occurrence and starting position of any of the target error patterns can be successfully identified.
Abstract:
A method of analyzing soft symbol information in a communication system that transmits multiple independent data streams is disclosed. The method includes setting a trellis structure using a fixed spatial delay constraint, calculating a joint probability between a targeted symbol and a set of observation samples either recursively or nonrecursively, and approximating a likelihood function for a given branch by a single probability density function with mean and variance computed based on available soft information on past symbols relative to the branch that is being currently considered.
Abstract:
In general, the disclosure describes techniques for detecting and correcting single or multiple occurrences of data error patterns. This disclosure discusses the generation and application of high-rate error-pattern-correcting codes to correct single instances of targeted error patterns in codewords, and to further correct a significant portion of multiple instances of targeted error patterns, with the least redundancy. In accordance with the techniques, a lowest-degree generator polynomial may be constructed that targets a set of dominant error patterns that make up a very large percentage of all observed occurrences of errors. The lowest-degree generator polynomial produces distinct, non-overlapping syndrome sets for the target error patterns. The lowest-degree generator polynomial may be constructed such that no two error patterns within the list of dominant error patterns map to the same syndrome set, and the single occurrence and starting position of any of the target error patterns can be successfully identified.