Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction
Reexamination Certificate
2006-12-01
2010-06-22
Chaudry, M. Mujtaba K (Department: 2112)
Error detection/correction and fault detection/recovery
Pulse or data error handling
Digital data error correction
C714S795000
Reexamination Certificate
active
07743314
ABSTRACT:
An improved Viterbi detector is disclosed in which each branch metric is calculated based on noise statistics that depend on the signal hypothesis corresponding to the branch. Also disclosed is a method of reducing the complexity of the branch metric calculations by clustering branches corresponding to signals with similar signal-dependent noise statistics. A feature of this architecture is that the branch metrics (and their corresponding square difference operators) are clustered into multiple groups, where all the members of each group draw input from a single, shared noise predictive filter corresponding to the group. In recording technologies as practiced today, physical imperfections in the representation of recorded user data in the recording medium itself are becoming the dominate source of noise in the read back data. This noise is highly dependent on what was (intended to be) written in the medium. The disclosed Viterbi detector exploits this statistical dependence of the noise on the signal.
REFERENCES:
patent: 5003617 (1991-03-01), Epsom et al.
patent: 5016280 (1991-05-01), Engebretson et al.
patent: 5073769 (1991-12-01), Kompelien
patent: 5257182 (1993-10-01), Luck et al.
patent: 5418795 (1995-05-01), Itakura et al.
patent: 5424882 (1995-06-01), Kazawa
patent: 5446746 (1995-08-01), Park
patent: 5450338 (1995-09-01), Oota et al.
patent: 5513215 (1996-04-01), Marchetto et al.
patent: 5530707 (1996-06-01), Lin
patent: 5563864 (1996-10-01), Kobayashi et al.
patent: 5581581 (1996-12-01), Sato
patent: 5588027 (1996-12-01), Lim
patent: 5625505 (1997-04-01), Ohmori et al.
patent: 5644603 (1997-07-01), Ushirokawa
patent: 5809080 (1998-09-01), Karabed et al.
patent: 5881075 (1999-03-01), Kong et al.
patent: 5995562 (1999-11-01), Koizumi
patent: 6097769 (2000-08-01), Sayiner et al.
patent: 6148043 (2000-11-01), Fujimoto
patent: 6148431 (2000-11-01), Lee et al.
patent: 6163517 (2000-12-01), Fujimoto
patent: 6178053 (2001-01-01), Narita
patent: 6199191 (2001-03-01), Iwata
patent: 6201839 (2001-03-01), Kav{hacek over (c)}ić et al.
patent: 6201840 (2001-03-01), Rub et al.
patent: 6219387 (2001-04-01), Glover
patent: 6246698 (2001-06-01), Kumar
patent: 6278568 (2001-08-01), Cloke et al.
patent: 6301684 (2001-10-01), Watanabe et al.
patent: 6304612 (2001-10-01), Baggen et al.
patent: 6334201 (2001-12-01), Sawaguchi et al.
patent: 6415415 (2002-07-01), Karabed
patent: 6449110 (2002-09-01), DeGroat et al.
patent: 6460150 (2002-10-01), Cideciyan et al.
patent: 6581184 (2003-06-01), Saeki et al.
patent: 6667841 (2003-12-01), Taguchi et al.
patent: 2001/0050926 (2001-12-01), Kumar
patent: 2002/0153955 (2002-10-01), Gharpurey et al.
patent: 2002/0184597 (2002-12-01), Jeon et al.
patent: EP 0 871 170 (1998-10-01), None
patent: EP 1056 236 (2000-11-01), None
“Exact Bounds for Viterbi Detector Path Metric Differences,” Paul H. Siegel, C. Bernard Shung, Thomas D. Howell, Hermant K. Thapar, IBM Corporation, San Jose, CA.
“A 100MBIT/S Viterbi Decoder Chip: Novel Architecture and its Realization,” Gerhard Fettweis, Heinrich Meyr, ICC'90, paper No. 257, session 307A, Atlanta GA, USA, Apr. 16-19, 1990, p. 1-5.
“Where do we use Viterbi Decoder?” Opencores.org.
“A Tutorial on Convolutional Coding with Viterbi Decoding,” Chip Fleming, Spectrum Applications, 1999, http://pw1.netcom.com/˜chip.f/viterbi/tutorial.html.
“PRML: Seagate Uses Space Age Technology Today,” http://www.seagate.com/support/kb/disc/prml.html.
“PRML,” http://www.idema.org/about/industry/ind—tech—prml.html.
“Hard Disc Data Encoding and Decoding,” http://www.storagereview.com/guide2000/ref/hdd/geom/data.html.
“Technical Requirments for Encoding and Decoding,” http://www.storagereview.com/guide2000/ref/hdd/geom/dataRequirements.html.
“Run Length Limited (RLL),” http://www.storagereview.com/guide2000/ref/hdd/geom/dataRLL.html.
“Partial Response, Maximum Likelihood (PRML),” http://www.storagereview.com/guide2000/ref/hdd/geom/dataPRML.html.
“Extended PRML (EPRML),” http://www.storagereview.com/guide2000/ref/hdd/geom/dataEPRML.html.
“MR and PRML: Technologies in Synergy—How Advanced Head and Read Channel Technologies Work Together to Increase Capacity and Improve Performance of Desktop Drives—A Quantum White Paper,” http://www.lionsgate.com/Home/baden/public—html—index/SCSI/Quantum—White—Papers/MR—Head/MR4/9/01.
“Western Digital Corporation—Glossary, Viterbi Detection,” http://www.westerndigital.com/company/glossary.html.
“Description of the Algorithms (Part 1),” http://pw1.netcom.com/˜chip.f/viterbi/algrthms.html.
“Synchronous Recording Channels—PRML,” KnowledgeTek, Inc., 1999.
“A CMOS Continuous-Time Gm-C Filter for PRML Read Channel Applications at 150 Mb/s and Beyond,” luri Mehr, David R. Welland, IEEE Journal of Solid State Circuits, vol. 32, No. 4, Apr. 1997.
“A Pipelined 16-State Generalized Viterbi Detector,” L. Richard Carley and Srinath Sridharan, IEEE Transactions on Magnetics, vol. 34, No. 1, Jan. 1998.
“Reduced-Complexity Sequence Detection for E2PR4 Magnetic Recording Channel,” Borivoje Nikolie, Michale Leung, Leo Fu, Vojin G. Oklobdzja, Richard Yamasaki, General Conference (Part B), Global Telecommunications Conference—Globecom '99, vol. 1b pp. 960-964., 1999.
“A 50 Mbit/s Interative Turbo-Decoder,” F. Viglione, G. Masera, G. Piccinini, M. Ruo Roch, M. Zamboni, Proceedings Design, Automation and Test in Europe Conference and Exhibition 200, Proceedings of Meeting on Design Automation and Test in Europe, Paris, France, 27-30, pp. 176-180, 2000.
International Search Report, International Application No. PCT/US 02/19093, pp. 1-2, Sep. 5, 2002.
Aleksandar Kav{hacek over (c)}ić and José M. F. Moura, “Signal-Dependent Correlation-Sensitive Branch Metrics for Viterbi-like Sequence Detectors”, Data Storage Systems Center, Carnegie Mellon University, Pittsburgh, PA, 0-7803-4788-9/98/$10.00 © 1998 IEEE, pp. 657-661.
Aleksandar Kav{hacek over (c)}ić and José M. F. Moura, “Correlation-Sensitive Adaptive Sequence Detection”, IEEE Transactions on Magnetics, vol. 34, No. 3, May 1998, pp. 763-770.
Charles W. Therrien, “Discrete Random Signals and Statistical Signal Processing”, © 1992 by Prentice-Hall, Inc., ISBN 0-13-852112-3, chapters 7 & 8.
Chen et al., “Convolutional Coding System with Tone Calibrated Technique for Land Mobile Radio Communication”, Sep. 1990, IEEE Conference, pp. 73-76.
Acampora, “Bit Error Rate Bounds for Viterbi Decoding with Modem Implementation Errors”, IEEE Transactions on Communications, vol. Com-30, No. 1, Jan. 1982, pp. 129-134.
PCT International Search Report PCT/EP 03/03843.
Doherty et al., “An Adaptive Algorithm for Stable Decision-Feedback Filtering”, Jan. 1993, IEEE Publication, vol. 40, No. 1, pp. 1-9.
Noriega et al., “Adaptive Estimation of Noise Covariance Matrices in Real-Time Preprocessing of Geophysical Data”, Sep. 1997, IEEE Publication, vol. 35, No. 5, pp. 1146-1159.
Herrick et al., “Correlated Frequency Hopping: An Improved Approach to HF Spread Spectrum Communications” , 1996, IEEE Publication, pp. 319-324.
Crosetto, “Real-Time Programmable, Digital Signal-Processing Electronics for Extracting the Information from a Detector Module for Multi-Modularity PET-SPECT/CT Scanners”, Oct. 2000, IEEE Publication, vol. 2, pp. 69-76.
Bliss William G.
Karabed Razmik
Rae James W.
Stockmanns Heinrich J.
Chaudry M. Mujtaba K
Marvell International Ltd.
LandOfFree
Method and apparatus for a data-dependent noise predictive... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for a data-dependent noise predictive..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for a data-dependent noise predictive... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4235678