Meta-Viterbi algorithm for use in communication systems

Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C714S755000

Reexamination Certificate

active

07490284

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 characterized by intersymbol interference. Each of the one or more codewords incorporates one or encodes one or more parity bits. The codewords are processed by a Meta-Viterbi detector that utilizes a Meta-Viterbi algorithm. The Meta-Viterbi detector comprises an event weight processor, a computational circuitry, a parity syndrome calculator, and an error correction circuitry. The Meta-Viterbi detector receives an output generated from a Viterbi detector having 2sstates and processes the received output using a trellis diagram having 2tstates.

REFERENCES:
patent: 5081651 (1992-01-01), Kubo
patent: 5291499 (1994-03-01), Behrens et al.
patent: 5430739 (1995-07-01), Wei et al.
patent: 5457704 (1995-10-01), Hoeher et al.
patent: 6307901 (2001-10-01), Yu et al.
patent: 6427220 (2002-07-01), Vityaev
patent: 6765507 (2004-07-01), Yokokawa et al.
Roy D. Cideciyan, Jonathan D. Coker, Evangelos Eleftheriou, and Richard L. Galbraith, 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, USA.
Z.A. Keirn, Victor Y. Krachkovsky, Erich F. Haratsch, and Harley Burger, 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, USA.
Jeff L. Sonntag and Bane Vasic, 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.
Weishi Feng, Andrei Vityaev, Greg Burd & Nersi Nazari, On the Performance of Parity Codes in Magnetic Recording Systems, 2000, pp. 1877-1881, The Institute of Electrical & Electronics Engineers, USA.
Aleksandar Kav{umlaut over (c)}ić and José M. F. Moura, Maximum Likelihood Sequence Estimation in Channels with Intersymbol Interference and Noise Memory, Aug. 1998, 1 page, ISIT 1998, Cambridge, MA, USA.
Ajay Dholakia, Evangelos Eleftheriou, & Thomas Mittelholzer, Capacity-Approaching Codes: Can They Be Applied to the Magnetic Recording Channel?, Feb. 2004, pp. 122-130, IEEE Commmunication Magazine, The Institute of Electrical & Electronics Engineers, USA.
Andrei Vityaev and Alan Armstrong, 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, IEEE, New York, NY, USA, vol. 61 No. 3, Mar. 1, 1973, pp. 268-278, XP000573242 ISSN: 0018-9219.
Eleftheriou E et al, “Improving Performance of PRML/EPRML Through Noise Prediction”, EEE Transactions on Magnetics, Sep. 1996, XP002370660.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Meta-Viterbi algorithm for use in communication systems does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Meta-Viterbi algorithm for use in communication systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Meta-Viterbi algorithm for use in communication systems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4066463

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.