The minimum description length principle for modeling recording channels

IEEE Journal on Selected Areas in Communications

Volumn 19, Issue 4, 2001, Pages 719-729

  Kavčić, Aleksandar ^a   Srinivasan, Murari ^b  

^a HARVARD UNIVERSITY   (United States)

^b QUALCOMM INC   (United States)

Author keywords

Autoregressive processes; Magnetic recording channel; Maximum likelihood estimation; Minimum description length; Nonstationary noise; Signal dependent noise

Indexed keywords

COMPUTATIONAL COMPLEXITY; ERROR DETECTION; INTERSYMBOL INTERFERENCE; LARGE SCALE SYSTEMS; MAGNETIC RECORDING; MAXIMUM LIKELIHOOD ESTIMATION; NONLINEAR FILTERING; PARAMETER ESTIMATION; SPURIOUS SIGNAL NOISE; WHITE NOISE;

AUTOREGRESSIVE PROCESSES; MINIMUM DESCRIPTION LENGTH PRINCIPLE;

CHANNEL CAPACITY;

EID: 0342398224     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.920180     Document Type: Article

References (43)

1. R. A. Baugh, E. S. Murdock, and B. R. Natarajan, "Measurement of noise in magnetic media," IEEE Trans. Magn., vol. MAG-19, pp. 1722-1724, Sept. 1983.
2. R. N. Belk, K. P. George, and S. G. Mowry, "Noise in high performance thin-film longitudinal magnetic recording media," IEEE Trans. Magn., vol. MAG-21, pp. 1350-1355, Sept. 1985.
3. J.-G. Zhu and N. H. Bertram, "Recording and transition noise simulations in thin film media," IEEE Trans. Magn., vol. 24, pp. 2706-2708, Nov. 1988.
4. R. D. Brandt, A. J. Armstrong, H. N. Bertram, and J. K. Wolf, "A simple statistical model of partial erasure in thin film disk recording systems," IEEE Trans. Magn., vol. 27, pp. 4978-4980, Nov. 1991.
5. S. W. Yuan and H. N. Bertram, "Statistical data analysis of magnetic recording noise mechanisms," IEEE Trans. Magn., vol. 28, pp. 84-92, Jan. 1992.
6. R. Wood, "The feasibility of magnetic recording at 1 terabit per square inch," IEEE Trans. Magn., vol. 36, pp. 36-42, Jan. 2000.
7. N. Bertram, Theory of Magnetic Recording. Cambridge, U.K.: Cambridge Univ. Press, 1994.
8. K. Fisher, J. Cioffi, and H. Thapar, "Modeling in thin film storage channels," IEEE Trans. Magn., vol. 25, pp. 4081-4058, Sept. 1989.
9. J. Moon and J.-G. Zhu, "Nonlinear effects of transition broadening," IEEE Trans. Magn., vol. 27, pp. 4831-4833, Nov. 1991.
10. S. K. Nair, H. Shafiee, and J. Moon, "Modeling and simulation of advanced read channels," IEEE Trans. Magn., vol. 29, pp. 4056-4058, Nov. 1993.
11. J. Caroselli and J. K. Wolf, "Applications of a new simulation model for media noise limited magnetic recording channels," IEEE Trans. Magn., vol. 32, pp. 3917-3919, Sept. 1996.
12. A. Kavčić and J. M. F. Moura, "Expedient media noise modeling: Isolated and interacting transitions," IEEE Trans. Magn., vol. 32, pp. 3875-3877, Sept. 1996.
13. A. Kavčić and A. Patapoutian, "A signal-dependent autoregressive channel model," IEEE Trans. Magn., vol. 35, pp. 2316-2318, September 1999.
14. _, "The Viterbi algorithm and Markov noise memory," IEEE Trans. Inform. Theory, vol. 46, pp. 291-301, Jan. 2000.
15. J. Stander and A. Patapoitian, "Performance of a signal-dependent autoregressive channel model," IEEE Trans. Magn., vol. 36, pp. 2197-2199, Sept. 2000.
16. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo-codes," in Proc. IEEE Int. Conf. on Communications, Geneva, Switzerland, May 1993, pp. 1064-1070.
17. W. Ryan, "Performance of high-rate turbo codes on PR4-equalized magnetic recording channels," in Proc. IEEE Int. Conf. on Communications, Atlanta, GA, June 1998, pp. 947-951.
18. T. Souvignier, A. Friedmann, M. Öberg, P. Siegel, R. E. Swanson, and J. K. Wolf, "Turbo codes for PR4: Parallel versus serai concatenation," in Proc. IEEE Int. Conf. on Communications, Vancouver, BC, Canada, June 1999, pp. 1638-1642.
19. L. L. McPheters, S. W. McLaughlin, and K. R. Narayanan, "Precoded PRML, serial concatenation, and iterative (turbo) decoding for digital magnetic recording," IEEE Trans. Magn., vol. 35, pp. 2325-2327, Sept. 1999.
20. T. Duman and E. Kurtas, "Comprehensive performance investigation of turbo codes over high density magnetic recording channels," in Proc. IEEE GLOBECOM 99, Rio de Janeiro, Brazil, Dec. 1999, pp. 744-748.
21. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1962.
22. D. J. C. MacKay, "Good error-correcting codes based on very sparce matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399-431, Mar. 1999.
23. T. Richardson and R. Urbanke. (2001, Feb.) The capacity of low-density parity check codes under message-passing decoding. IEEE Trans. Inform. Theory, pp. 599-618
24. J. Fan, A. Friedmann, E. Kurtas, and S. McLaughlin, "Low density parity check codes for partial response channels," presented at the Allerton Conf. Communications and Control, Urbana, IL, Oct. 1999.
25. A. Kavčić, "Soft-output detector for channels with intersymbol interference and Markov noise memory," in Proc. IEEE GLOBECOM 99, Rio de Janeiro, Brazil, Dec. 1999, pp. 728-732.
26. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, vol. IT-20, pp. 284-287, Sept. 1974.
27. J. Moon, "Presentation at the NSIC quarterly review,", submitted for publication.
28. A. Barron, J. Rissanen, and B. Yu, "The minimum description length principle in coding and modeling," IEEE Trans. Inform. Theory, vol. 44, pp. 2743-2760, Oct. 1998.
29. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
30. A. Kavčić and J. M. F. Moura, "Matrices with banded inverses: Inversion algorithms and factorization of Gauss-Markov processes," IEEE Trans. Inform. Theory, vol. 46, pp. 1495-1509, July 2000.
31. J. M. F. Moura and N. Balram, "Recursive structure of noncausal Gauss Markov random fields," IEEE Trans. Inform. Theory, vol. 38, pp. 334-354, Mar. 1992.
32. A. Akaike, "A new look at the statistical model identification," IEEE Trans. Automat. Contr., vol. AC-19, pp. 716-723, 1974.
33. G. Schwartz, "Estimating the dimension of a model," Ann. Stat., vol. 6, pp. 461-464, 1978.
34. J. Rissanen, "Modeling by shortest data description," Automatica, vol. 14, pp. 465-471, 1978.
35. J. Rissanen and G. G. Langdon, "Universal modeling and coding," IEEE Trans. Inform. Theory, vol. IT-27, pp. 12-23, 1981.
36. C. E. Shannon, "A mathematical theory of communications," Bell Syst. Tech. J., vol. 27, pp. 379-123 (part I) and 623-656 (part II), 1948.
37. C. E. Shannon, "A mathematical theory of communications," Bell Syst. Tech. J., vol. 27, pp. 379-123 (part I) and 623-656 (part II), 1948.
38. J. Rissanen, "Stochastic complexity and modeling," Ann. Stat., vol. 14, pp. 1080-1100, 1986.
39. S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, pp. 671-680, Sept. 1983.
40. N. M. Zayed and L. R. Carley, "Generalized partial response signaling and efficient MLSD using linear Viterbi branch metrics," in Proc. IEEE Global Communications Conference (GLOBECOM), Rio de Janeiro, Brazil, Dec. 1999, pp. 949-954.
41. J. D. Coker, E. Eleftheriou, R. L. Galbraith, and W. Hirt, "Noise-predictive maximum likelihood NPML detection," IEEE Trans. Magn., vol. 34, pp. 110-117, Jan. 1998.
42. S. A. Altekar and J. K. Wolf, "Improvements in detectors based upon colored noise," IEEE Trans. Magn., vol. 34, pp. 94-97, Jan. 1998.
43. T. Souvignier, Z. Keirn, and C. Xu, "Turbo decoding for partial response channels using spinstand data," IEEE Trans. Magn., vol. 36, pp. 2167-2169, Sept. 2000.