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

07836385

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: 5440570 (1995-08-01), Wei et al.
patent: 5457704 (1995-10-01), Hoeher et al.
patent: 5539755 (1996-07-01), Baggen
patent: 5712861 (1998-01-01), Inoue et al.
patent: 5926490 (1999-07-01), Reed et al.
patent: 5961658 (1999-10-01), Reed et al.
patent: 6009552 (1999-12-01), Ariel et al.
patent: 6029264 (2000-02-01), Kobayashi et al.
patent: 6052248 (2000-04-01), Reed et al.
patent: 6185175 (2001-02-01), Zook
patent: 6307901 (2001-10-01), Yu et al.
patent: 6427220 (2002-07-01), Vityaev
patent: 6513141 (2003-01-01), Livingston
patent: 6516443 (2003-02-01), Zook
patent: 6530060 (2003-03-01), Vis et al.
patent: 6543023 (2003-04-01), Bessios
patent: 6671852 (2003-12-01), Ariel et al.
patent: 6694477 (2004-02-01), Lee
patent: 6732328 (2004-05-01), McEwen et al.
patent: 6765507 (2004-07-01), Yokokawa et al.
patent: 6785861 (2004-08-01), Scalise et al.
patent: 6823487 (2004-11-01), Poeppelman
patent: 6829305 (2004-12-01), Kang et al.
patent: 6901548 (2005-05-01), Hattori et al.
patent: 6981197 (2005-12-01), Liu et al.
patent: 6981201 (2005-12-01), Reggiani et al.
patent: 6986098 (2006-01-01), Poeppelman et al.
patent: 7089483 (2006-08-01), McEwen et al.
patent: 7328395 (2008-02-01), Burd
patent: 7444582 (2008-10-01), Au et al.
patent: 7469373 (2008-12-01), Vityaev
patent: 7571372 (2009-08-01), Burd et al.
patent: 7620879 (2009-11-01), Park et al.
patent: 7644338 (2010-01-01), Park et al.
patent: 7689893 (2010-03-01), Burd
patent: 7694205 (2010-04-01), Cideciyan et al.
patent: 2003/0014716 (2003-01-01), Ariel
patent: 2003/0101410 (2003-05-01), Betti et al.
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.
Knudson, K.J.; Wolf, J.K.; Milstein, L.B.; , “A concatenated decoding scheme for (1-D) partial response with matched spectral-null coding,” Global Telecommunications Conference, Dec. 1993, including a Communications Theory Mini-Conference. Technical Program Conference Record, IEEE in Houston pp. 1960-1964.
Conway, T.; , “A new target response with parity coding for high density magnetic recording channels,” Magnetics, IEEE Transactions on , vol. 34, No. 4, pp. 2382-2386, Jul. 1998.
Vasic, B.; Venkateswaran, V.; , “Soft-error-event decoding for multitrack magnetic recording channels,” Magnetics, IEEE Transactions on , vol. 40, No. 2, pp. 492-497, Mar. 2004.
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, USA.
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, USA.
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 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, 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”, IEEE 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-4196587

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