Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction
Reexamination Certificate
2011-01-04
2011-01-04
Alphonse, Fritz (Department: 2112)
Error detection/correction and fault detection/recovery
Pulse or data error handling
Digital data error correction
C714S780000, C714S795000
Reexamination Certificate
active
07865801
ABSTRACT:
Herein described is a system and a method of detecting and correcting data bit errors using a sequence of one or more codewords transmitted through a communication channel without intersymbol interference. Each of the one or more codewords incorporates or encodes one or more parity bits. The codewords are processed by a Non-ISI Meta-Viterbi detector that utilizes a Meta-Viterbi algorithm. The Non-ISI Meta-Viterbi detector comprises an event weight processor, a computational circuitry, a parity syndrome calculator, and an error correction circuitry. The Non-ISI Meta-Viterbi detector receives an output generated from a symbol detector and processes the received output using a trellis having 2tstates. In a representative embodiment, the overall implementation complexity of the Non-ISI Meta-Viterbi detector is bounded by no more than χ+(⅔)2t2toperations, wherein t represents the number of parity bits used in a codeword and χ represents codeword length in bits.
REFERENCES:
patent: 5081651 (1992-01-01), Kubo
patent: 5208816 (1993-05-01), Seshardi et al.
patent: 5291499 (1994-03-01), Behrens et al.
patent: 5388124 (1995-02-01), Laroia et al.
patent: 5430739 (1995-07-01), Wei et al.
patent: 5457704 (1995-10-01), Hoeher et al.
patent: 5511081 (1996-04-01), Hagenauer
patent: 5577053 (1996-11-01), Dent
patent: 5682395 (1997-10-01), Begin et al.
patent: 5848106 (1998-12-01), Khayrallah
patent: 5850405 (1998-12-01), Wimmer et al.
patent: 6009552 (1999-12-01), Ariel et al.
patent: 6307901 (2001-10-01), Yu et al.
patent: 6427220 (2002-07-01), Vityaev
patent: 6470047 (2002-10-01), Kleinerman et al.
patent: 6732328 (2004-05-01), McEwen et al.
patent: 6765507 (2004-07-01), Yokokawa et al.
Reed, I., et al., “The VLSI Design of an Error-Trellis Syndrome Decoder for Certain Convolutional Codes”, IEEE Transactions on Computers, vol. C-35, No. 9, Sep. 1986, pp. 781-789.
Sidorenko, V., et al. “Decoding of Convolutional Codes Using a Syndrome Trellis”, IEEE Transactions on Information Theory, vol. 40, No. 5, Sep. 1994, pp. 1663-1666.
Ariel, M., et al. “Soft Syndrome Decoding of Binary Convolutional Codes”, IEEE Transactions on Communications, vol. 43, No. 2/3/4, Feb./Mar./Apr. 1995, pp. 288-297.
Lee, L., et al., “Scarce-State-Transmission Error-Trellis Decoding of Binary Block Codes”, IEEE Telecommunications Conference Publication No. 404, Mar. 1995, pp. 97-99.
Lee, L., et al. “Scarce-State-Transition Syndrome-Former Error-Trellis Decoding of (n, n-1) Convolutional Codes”, IEEE Transactions on Communications, vol. 44, No. 1, Jan. 1996, pp. 7-9.
Ariel, M., et al., “Minimal-Error-Trellises for Linear Block Codes”, ISIT, Aug. 1998, pp. 228.
Ariel, M., et al., “Error trellises for Convolutional Codes—Part II: Decoding Methods”, IEEE Transactions on Communications, vol. 47, No. 7, Jul. 1999, pp. 1015-1024.
Tajima, M., et al., “On the Equivalence Between Scarce-State-Transition Viterbi Decoding and Syndrome Decoding of Convolutional Codes”, ISIT, Jun. 2003, p. 304.
Tajima, M., et al., “Relation Between Encoder and Syndrome Former Variables and Symbol Reliability Estimation Using a Syndrome Trellis”, IEEE Transactions on Communications, vol. 51, No. 9, Sep. 2003.
Wadayama, T., “An Algorithm for Calculating the Exact Bit Error Probability of a Binary Linear Code Over the Binary Symmetric Channel”, IEEE Transactions on Information Theory, vol. 50, No. 2, Feb. 2004, pp. 331-337.
Cideciyan, R., et al., “Noise Predictive Maximum Likelihood Detection Combined with Parity-Based Post-Processing”, IEEE Transactions on Magnetics, vol. 37, No. 2, Mar. 2001, pp. 714-720, The Institute of Electrical & Electronics Engineers.
Keirn, Z.A., et al. “Use of Redundant Bits for Magnetic Recording: Single-Parity Codes and Reed-Solomon Error-Correcting Code”, IEEE Transactions on Magnetics, vol. 40, No. 1, Jan. 2004, pp. 225-230, The Institute of Electrical & Electronics Engineers.
Sonntag, J., et al., “Implementation and Bench Characterization of a Read Channel with Parity Check Postprocessor”, Digests of The Magnetic Recording Conference 2000 (TMRC 2000), Santa Clara, CA, 2000, 2 pages, The Institute of Electrical & Electronics Engineers, USA.
Feng, W., et al., “On the Performance of Parity Codes in Magnetic Recording Systems”, 2000, pp. 1877-1881, The Institute of Electrical & Electronics Engineers, USA.
Kavcic, A., et al., “Maximum Likelihood Sequence Estimation in Channels with Intersymbol Interference and Noise Memory”, Aug. 1998, 1 page, ISIT 1998, Cambridge, MA, USA.
Dholakia, A., et al., “Capacity-Approaching Codes: Can They Be Applied to the Magnetic Recording Channel?”, Feb. 2004, pp. 122-130, IEEE Communication Magazine, The Institute of Electrical & Electronics Engineers, USA.
Vityaev, A., et al., “Measurement and Modeling of System-Level Read-Channel Performance”, Dec. 2000, pp. 30-33, Data Storage Magazine, USA.
Forney, G.D., “The Viterbi Algorithm”, Proceedings of the IEEE, Mar. 1, 1973, vol. 61, No. 3, pp. 268-278, XP000573242, ISSN: 0018-9219, IEEE, New York, NY, USA.
Eleftheriou, E., et al., “Improving Performance of PRML/EPRML Through Noise Prediction”, Sep. 1996, vol. 32, No. 5, pp. 3968-3970, XP002370660, IEEE Transactions on Magnetics, Sep. 1996.
Alphonse Fritz
Broadcom Corporation
McAndrews Held & Malloy Ltd.
LandOfFree
Application of a Meta-Viterbi algorithm for communication... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Application of a Meta-Viterbi algorithm for communication..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Application of a Meta-Viterbi algorithm for communication... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2637166