Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction
Patent
1997-12-05
2000-08-15
Baker, Stephen M.
Error detection/correction and fault detection/recovery
Pulse or data error handling
Digital data error correction
714769, 714792, H03M 1305, H03M 1327, G11V 2018
Patent
active
061051594
DESCRIPTION:
BRIEF SUMMARY
BACKGROUND OF THE INVENTION
The present invention relates to digital communication systems and more particularly to digital communication systems that use multiple levels of encoding to protect user data as it passes through a noisy communications channel.
Digital communication systems are designed to transmit user data from a source to a destination. The means connecting the source and destination can be a simple conducting wire, a global satellite system or a magnetic storage system. The connecting means is often generalized as a channel between the source and destination.
All channels occasionally introduce electronic noise into the signals they carry. This electronic noise changes the digital signal and thus creates errors within the digital signal. To protect the digital signals as they pass through the channel, encoding and decoding systems have been developed that add additional bits to the digital signal so that the original signal may be recovered even if the channel introduces errors. In some communication systems, multiple levels of encoding are used, meaning that the original digital signal is encoded more than once before being passed through the channel.
An example of a multiple-level encoding system is found in the encoding system used in some magnetic storage devices. In these systems, the user data is first encoded using an error correction code (ECC) and then further encoded using some form of trellis code. In the ECC encoding process, the user data is typically broken into bytes of digital values where each byte represents one unit of user data. For example, user data may be grouped together in blocks containing 175 bytes of user data and 5 bytes of ECC redundancy. The 5 bytes of ECC redundancy are chosen based on the digital values found in the 175 user bytes. Typically, 5 bytes of ECC redundancy can correct up to two erroneous user bytes in each block. The ECC encoding system is completed by interleaving three separate blocks in a sector containing 540 bytes, so that the complete set of user bytes and ECC bytes for any one block can be found by sampling every third byte of the interleaved output.
Interleaving reduces the effects of burst errors on the ECC encoded signal. Burst errors are localized error events affecting one or more consecutive user words. By ensuring that consecutive words in the ECC encoded signal are not from the same block, interleaving reduces the chance that a burst error will affect more than one byte in a block. Since ECC can only correct two user bytes per block, interleaving reduces the chances that a burst error will exceed the maximum number of user bytes that ECC can correct.
In prior art coding methods for magnetic storage devices, the interleaved ECC encoded values are further encoded by two parallel trellis encoders. Each of the two parallel trellis encoders typically produces a spectral null code, also referred to as a DC free or DC null code, whose encoded data stream has a spectral null at zero frequency. The outputs of the two trellis encoders are interleaved together to create a signal that has both a DC null and a null at the Nyquist frequency, i.e., at half the channel bit frequency. Input signals that have a spectral null at D.C. and the Nyquist frequency are preferred because they match the spectral response of a disc drive channel equalized to class-IV partial response (PR4), and this improves the destination's ability to recover encoded signals from the channel.
In the prior art, the interleaved ECC encoded values are assigned to the parallel trellis encoders by first assigning the even bytes to one trellis encoder and the odd bytes to the other trellis encoder. Each trellis encoder then uses 12 bits at a time from the stream of bytes assigned to it to create codewords. This means that each trellis encoder uses one full byte and one half byte of the ECC encoded bytes to create one codeword. Thus, the odd byte trellis encoder uses all of byte 1 and half of byte 3 of the ECC encoded bytes to make a first odd stream codeword and the other half o
REFERENCES:
patent: 4751590 (1988-06-01), Wilkinson
patent: 5050171 (1991-09-01), Ishijima
patent: 5109385 (1992-04-01), Karp et al.
patent: 5220568 (1993-06-01), Howe et al.
patent: 5263030 (1993-11-01), Rotker et al.
patent: 5329535 (1994-07-01), Coker
patent: 5373513 (1994-12-01), Howe et al.
patent: 5422760 (1995-06-01), Abbott et al.
patent: 5422895 (1995-06-01), Nguyen et al.
patent: 5544178 (1996-08-01), Kook
patent: 5602857 (1997-02-01), Zook et al.
patent: 5691993 (1997-11-01), Fredrickson
Thapar et al., "On the Performance of a Rate 8/10 Matched Spectral Null Code for Class-4 Partial Response", IEEE Transactions on Magnetics, vol. 28, No. 5, Sep. 1992, pp. 2883-2888.
Fredrickson et al., "Improved Trellis-Coding for Partial-Response Channels", IEEE Transactions on Magnetics, vol. 31, No. 2, Mar. 1995, pp. 1141-1148.
Rae et al., "Design and Performance of a VLSI 120 Mb/s Trellis-Coded Partial Response Channel", IEEE Transactions on Magnetics, vol. 31, No. 2, Mar. 1995, pp. 1208-1214.
Cideciyan et al., "Codes Preventing Quasi-Catastrophic Error Propagation in Partial-Response Systems", IEEE Transactions on Information Theory, vol. 41, No. 2, Mar. 1995, pp. 600-604.
Baker Stephen M.
Dempster Shawn B.
Heller Edward P.
Olson Jonathan E.
Seagate Technology Inc.
LandOfFree
Trellis code with improved error propagation does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Trellis code with improved error propagation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Trellis code with improved error propagation will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2019484