# US 8,151,175 B2 · Fault tolerant decoding method and apparatus > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 8,151,175 B2 - Document ID: US8151175B2 - Status: Granted - Kind: B2 - Application number: 11/761,662 - Filed: 2007-06-12 - Published: 2007-10-04 - Granted: 2012-04-03 - Earliest claimed: 2002-04-05 - Assignees: Sentel Corporation - Inventors: Michael Maiuzzo; Jesse David Warner; Theodore L. Harwood; John P. Smith - Web page: https://patentgrep.com/patent/US8151175B2 ## CPC - H03M 13/2936: {comprising an outer Reed-Solomon code and an inner convolutional code} - H03M 13/3738: {with judging correct decoding} - H03M 13/4138: {soft-output Viterbi algorithm based decoding, i.e. Viterbi decoding with weighted decisions} - H03M 13/154: {Error and erasure correction, e.g. by using the error and erasure locator or Forney polynomial} - H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C) ## Abstract A bit quality evaluator receives a sequence of bits. The bit sequence is provided to a decoding device that performs soft decision convolutional decoding on the sequence of bits. An off track event detector detects an occurrence of a trellis decode path change during the convolutional decoding operation and identifies a first symbol proximate corresponding to the occurrence of the trellis decode path change. An erasure decision circuit identifies at least the first symbol for erasure. The output of the first decoder and the erasure decision circuit are received at a second decoder, which decoder decodes the output of the first decoder after erasing at least the first symbol. The erasure decision circuit may also identify additional symbols for erasure using performance measures of the trellis decode path and using quality measures of the sequence of bits. ## Claims ### Claim 1 A method of electronic decoding comprising: receiving, at a first decoding device, a data stream comprising a sequence of bits; performing, using the first decoding device, convolutional decoding on the sequence of bits in the data stream; identifying, using an off track event detector, an occurrence of a trellis decode path change during the convolutional decoding of the sequence of bits by the first decoder; identifying, using the off track event detector, a first symbol proximate to the sequence of bits corresponding to the occurrence of the trellis decode path change; identifying, using an erasure decision circuit, at least the first symbol for erasure; receiving, at a second decoder, the output of the first decoder and the erasure decision circuit; decoding, using a second decoding device, the output of the first decoder after erasing at least the first symbol; and outputting from the second decoding device decoded corrected data. ### Claim 2 (depends on 1) The method of claim 1, wherein the data stream comprises error correction encoded data, wherein the first decoding device comprises a Viterbi decoder and wherein the second decoder comprises a Reed Solomon block decoder with erasure. ### Claim 3 (depends on 1) The method of claim 1 further comprising: assessing, using a high cost factor detector, one or more trellis decode paths for corruption of additional symbols corresponding to the sequence of bits; receiving, at the erasure decision circuit, a signal from the high cost factor detector; determining, using the erasure decision circuit, from the signal from the high cost factor detector whether one or more additional symbols are corrupted; and decoding, using a second decoding device, the output of the first decoder after erasing at least the first symbol and the one or more additional symbols when one or more additional symbols are determined to be corrupted. ### Claim 4 (depends on 3) The method of claim 3, wherein assessing, using a high cost factor detector, one or more trellis decode paths for corruption of additional symbols corresponding to the sequence of bits comprises determining whether a low cost factor path exists through a trellis of the first decoding device and the duration of high cost factor paths through the trellis. ### Claim 5 (depends on 3) The method of claim 3, wherein assessing, using a high cost factor detector, one or more trellis decode paths for corruption of additional symbols corresponding to the sequence of bits comprises determining that a last state of a lowest cost path after the path change does not agree with a penultimate state of a lowest cost path immediately prior to the path change. ### Claim 6 (depends on 1) The method of claim 1 further comprising: receiving, at a bit quality evaluator, the data stream; assessing, using the bit quality evaluator, a quality measure of each bit within the sequence of bits; determining, using the bit quality evaluator, whether the sequence of bits includes a group of bits having a quality measure below a quality threshold; receiving, at the erasure decision circuit, a signal from the bit quality evaluator; determining, using the erasure decision circuit, from the signal from the bit evaluator whether one or more additional symbols are corrupted; and decoding, using a second decoding device, the output of the first decoder after erasing at least the first symbol and the one or more additional symbols when one or more additional symbols are determined to be corrupted. ### Claim 7 A decoding apparatus comprising: a first decoding device configured for: receiving a data stream comprising a sequence of bits; and performing convolutional decoding on the sequence of bits in the data stream; an off track event detector configured for: identifying an occurrence of a trellis decode path change during the convolutional decoding of the sequence of bits by the first decoder; and identifying a first symbol proximate to the sequence of bits corresponding to the occurrence of the treillis decode path change; an erasure decision circuit configured for identifying at least the first symbol for erasure; and a second decoder configured for: receiving the output of the first decoder and the erasure decision circuit; decoding the output of the first decoder after erasing at least the first symbol; and outputting decoded corrected data. ### Claim 8 (depends on 7) The apparatus of claim 7, wherein the data stream comprises error correction encoded data, wherein the first decoding device comprises a Viterbi decoder and wherein the second decoder comprises a Reed Solomon block decoder with erasure. ### Claim 9 (depends on 7) The apparatus of claim 7 further comprising a high cost factor detector configured for assessing one or more trellis decode paths for corruption of additional symbols corresponding to the sequence of bits, wherein; the erasure decision circuit is further configured for: assessing receiving a signal from the high cost factor detector, and determining from the signal from the high cost factor detector whether one or more additional symbols are corrupted, and the second decoding device is configured for decoding the output of the first decoder after erasing at least the first symbol and the one or more additional symbols when one or more additional symbols are determined to be corrupted. ### Claim 10 (depends on 9) The apparatus of claim 9, wherein assessing, using a high cost factor detector, one or more trellis decode paths for corruption of additional symbols corresponding to the sequence of bits comprises determining whether a low cost factor path exists through a trellis of the first decoding device and the duration of high cost factor paths through the trellis. ### Claim 11 (depends on 9) The apparatus of claim 9, wherein assessing, using a high cost factor detector, one or more trellis decode paths for corruption of additional symbols corresponding to the sequence of bits comprises determining that a last state of a lowest cost path after the path change does not agree with a penultimate state of a lowest cost path immediately prior to the path change. ### Claim 12 (depends on 7) The apparatus of claim 7 further comprising: a bit quality evaluator configured for: receiving the data stream; assessing a quality measure of each bit within the sequence of bits; and determining whether the sequence of bits includes a group of bits having a quality measure below a quality threshold, wherein the erasure decision circuit is further configured for: receiving a signal from the bit quality evaluator; and determining from the signal from the bit evaluator whether one or more additional symbols are corrupted, and wherein the second decoding device is further configured for decoding the output of the first decoder after erasing at least the first symbol and the one or more additional symbols when one or more additional symbols are determined to be corrupted.