Finite-State Modulation Codes for Data Storage

IEEE Journal on Selected Areas in Communications

Volumn 10, Issue 1, 1992, Pages 5-37

  Marcus, Brian H ^a   Siegel, Paul H ^a   Wolf, Jack K ^b  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY - FINITE AUTOMATA; CODES, SYMBOLIC - ENCODING; INFORMATION THEORY - CHANNEL CAPACITY; MATHEMATICAL TECHNIQUES - EIGENVALUES AND EIGENFUNCTIONS;

FINITE STATE ENCODERS; FINITE STATE MODULATION CODES; NONCATASTROFIC ENCODERS; SHANNON CAPACITY; SLIDING-BLOCK DECODER WINDOW; STATE SPLITTING ALGORITHM;

DATA STORAGE, DIGITAL;

EID: 0026622638     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.124467     Document Type: Letter

References (63)

1. P. Siegel, “Applications of a peak detection channel model,” IEEE Trans. Magnet., vol. MAG-18, no. 6, pp. 1250–1252, Nov. 1984.
2. P. Siegel, “Recording codes for digital magnetic storage,” IEEE Trans. Magnet., vol. MAG-21, no. 5, pp. 1344–1349, Sept. 1985.
3. K. A. Schouhamer Immink, “Runlength-limited sequences,” Proc. IEEE, vol. 78, no. 11, pp. 1745–1759, Nov. 1990.
4. H. Kobayashi and D. T. Tang, “Application of partial-response channel coding to magnetic recording systems,” IBM J. Res. Develop., vol. 14, pp. 368–374, 1970.
5. F. Dolivo, D. Maiwald, and G. Ungerboeck, “Partial-response class-IV signaling with Viterbi decoding versus conventional modified frequency modulation in magnetic recording,” IBM Res., Zurich Res. Lab., IBM Res. Rep. RZ 973-33865, Switzerland, Aug. 1979.
6. R. Wood and D. Petersen, “Viterbi detection of class IV partial response on a magnetic recording channel,” IEEE Trans. Commun., vol. COM-34, no, 5, pp. 454–461, May 1986.
7. F. Dolivo, “Signal processing for high density digital magnetic recording,” in Proc. COMPEURO 89, Hamburg, Germany, May 1989.
8. R. Karabed and P. Siegel, “Matched spectral-null codes for partial-response channels,” IEEE Trans. Inform. Theory, vol. 37, no. 3, pt. II, pp. 818–855, May 1991.
9. C. Shannon, “A mathematical theory of communication,” Bell Syst. Tech. J., vol. 27, pp. 379–423, 623-656, Oct. 1948.
10. P. Franaszek, “Sequence-state coding for digital transmission,” Bell Syst. Tech. J., pp. 113–157, 1968.
11. P. Franaszek, “On synchronous variable length coding for discrete noiseless channels,” Inform. Contr., vol. 15, pp. 155–164, 1969.
12. P. Franaszek, “Sequence-state methods for run-length-limited coding,” IBM J. Res. Develop., vol. 14, pp. 375–383, July 1970.
13. P. Franaszek, “A general method for channel coding,” IBM J. Res. Develop., vol. 24, pp. 638–691, 1980.
14. P. Franaszek, “Construction of bounded delay codes for discrete noiseless channels,” IBM J. Res. Develop., vol. 26, pp. 506–514, 1982.
15. M.-P. Beal, “The method of poles: a coding method for constrained channels,” IEEE Trans. Inform. Theory, vol. 36, no. 4, pp. 763772, July 1990.
16. D. Tang and L. Bahl, “Block codes for a class of constrained noiseless channels,” Inform. Contr., vol. 17, pp. 436–461, 1970; and pp. 462–474, 1973.
17. G. Jacoby, “A new look-ahead code for increased data density,” IEEE Trans. Magnet., vol. MAG-13, no. 5, pp. 1202–1204, Sept. 1977.
18. G. Jacoby and R. Kost, “Binary two-thirds rate code with full word look-ahead,” IEEE Trans. Magnet., vol. MAG-20, no. 5, pp. 709714, Sept. 1984.
19. M. Cohn, G. Jacoby, and A. Bates, III, “Data encoding method and system employing two-thirds code rate with full word look-ahead,” U.S. Patent 4,337,458, 1982.
20. A. Lempel and M. Cohn, “Lookahead coding for input restricted channels,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 933–937, Nov. 1982.
21. A. Patel, “Zero modulation encoding in magnetic recording,” IBM J. Res. Develop., vol. 19, no. 4, pp. 366–378, July 1975.
22. R. Adler, D. Coppersmith, and M. Hassner, “Algorithms for sliding-block codes,” IEEE Trans. Inform. Theory, vol. IT-29, no. 1, pp. 5–22, Jan. 1983.
23. B. Marcus, “Sofic systems and encoding data,” IEEE Trans. Inform. Theory, vol. IT-31, no. 3, pp. 366–377, May 1985.
24. R. Karabed and B. Marcus, “Sliding-block coding for input-restricted channels,” IEEE Trans. Inform. Theory., vol. 34, no. 1, pp. 2–26, Jan. 1988.
25. B. Marcus and P. Siegel, “Constrained codes for PRML,” IBM Res. Rep. RJ 4371, July 1984.
26. B. Marcus and P. Siegel, “Constrained codes for partial response channels,” in Proc. Beijing Int. Workshop Inform. Theory, July 1988, pp. DI1.1-DI1.4.
27. R. E. Blahut, Digital Transmission of Information. Reading, MA: Addison-Wesley, 1990.
28. K. A. Schouhamer Immink, Coding Techniques for Digital Recorders. Englewood Cliffs, NJ: Prentice-Hall, 1991.
29. A. Khayrallah and D. Neuhoff, “Subshift models and finite-state codes for input-constrained noiseless channels: A tutorial,” preprint ‘based upon Ph.D. dissertation by A. Khayrallah, Univ. Mich., 1989’.
30. N. Swenson and J. Cioffi, “A simplified design approach for run-length limited sliding block codes,” preprint ‘based upon Ph.D. dissertation by N. Swenson, Stanford Univ., 1991’.
31. Z. Kohavi, Switching and Finite Automata Theory. New York: McGraw-Hill, 1970.
32. B. Marcus and R. Roth, “Bounds on the number of states in encoder graphs for input-constrained channels,” IEEE Trans. Inform. Theory, vol. 37, no. 3, pt. II, pp. 742–758, May 1991.
33. J. Ashley, “A linear bound for sliding-block decoder window size,” IEEE Trans. Inform. Theory, vol. 34, no. 3, pp. 389–399, May 1988.
34. H. Kamabe, “Minimum scope for sliding-block decoder mappings,” IEEE Trans. Inform. Theory, vol. 35, no. 6, pp. 1335–1340, Nov. 1989.
35. R. Williams, “Classification of shifts of finite type,” Ann. Math., vol. 98, pp. 120–153, 1973; and “Errata,” Ann. Math., vol. 99, pp. 380–381, 1974.
36. R. Adler, L. Goodwyn, and B. Weiss, “Equivalence of topological Markov shifts,” Israel J. Math., vol. 27, pp. 49–63, 1977.
37. B. Marcus, “Factors and extensions of full shifts,” Monatshefte fur Math., vol. 88, pp. 239–247, 1979.
38. R. Adler, J. Friedman, B. Kitchens, and B. Marcus, “State splitting for variable-length graphs,” IEEE Trans. Inform. Theory, vol. IT-32, no. 1, pp. 108–113, Jan. 1986.
39. C. Heegard, B. Marcus, and P. Siegel, “Variable length state splitting with applications to average runlength constrained ‘ARC’ codes,” IEEE Trans. Inform. Theory, vol. 37, no. 3, pt. II, pp. 759–777, May 1991.
40. C. Freiman and A. Wyner, ‘'Optimum block codes for noiseless input restricted channels,” Inform. Contr., vol. 7, pp. 398–415, 1964.
41. P. Siegel, “On the complexity of limiting error propagation in sliding-block codes,” unpublished memorandum.
42. R. Karabed and P. Siegel, “A 100% efficient sliding-block code for the charge-constrained, runlength limited channel with parameters ‘d, k; c’ = ‘1, 3; 3’,” presented at the IEEE Int. Symp. Inform. Theory, Budapest, June 1991; also in IBM Res. Rep. RJ 7092, Dec. 1990.
43. E. Berlekamp, “The technology of error-correcting codes,” Proc. IEEE., vol. 68, no. 5, pp. 564–593, May 1980.
44. J. Mallinson and C. Steele, “Theory of linear superposition in tape recording,” IEEE Trans. Magnet., vol. MAG-5, pp. 886–890, Dec. 1969.
45. K. A. Schouhamer Immink, “Coding techniques for the noisy magnetic recording channel,” IEEE Trans. Commun., vol. 37, pp. 413419, May 1989.
46. L. Barbosa, “Minimum noise pulse slimmer,” IEEE Trans. Magnet., vol. MAG-17, no. 6, pp. 3340–3342, Nov. 1981.
47. J. Ashley and P. Siegel, “A note on the Shannon capacity of run-length-limited codes,” IEEE Trans. Inform., Theory, vol. IT-33, no. 4, pp. 601–605, July 1987.
48. R. Adler, M. Hassner, and J. Moussouris, “Method and apparatus for generating a noiseless sliding block code for a ‘1, 7’ channel with rate 2/3,” U.S. Patent 4,413,251, 1982.
49. A. Weathers and J. Wolf, “A new rate 2/3 sliding-block code for the ‘1, 7’ runlength constraint with the minimal number of encoder states,” IEEE Trans. Inform. Theory, vol. 37, no. 3, pt. II, pp. 908913, May 1991.
50. T. Howell, “Statistical properties of selected recording codes,” IBM J. Res. Develop., vol. 33, no. 1, pp. 60–73, Jan. 1989.
51. P. Funk, “Run-length-limited codes with multiple spacing,” IEEE Trans. Magnet., vol. MAG-18, no. 2, pp. 772–775, Mar. 1982.
52. D. Rugar, “Magnetooptic direct overwrite using a resonant bias coil,” IEEE Trans. Magnet., vol. 24, no. 1, pp. 666–669, Jan. 1988.
53. D. Rugar and P. Siegel, “Recording results and coding considerations for the resonant bias coil overwrite technique,” in G. R. Knight and C. N. Kurtz, Eds, Topical Meeting on Optical Data Storage, Proc. SPIE, 1989, vol. 1078, pp. 265–270.
54. T. Weigandt, “magnetooptic recording using a ‘2, 18, 2’ run-length-limited code,” S.M. thesis, Mass. Inst. Technol., Cambridge, MA, 1991.
55. J. Eggenberger and A. M. Patel, “Method and apparatus for implementing optimum PRML codes,” U.S. Patent 4,707,681, Nov. 17, 1987.
56. B. Marcus, A. Patel, and P. Siegel, “Method and apparatus for implementing a PRML code,” U.S. Patent 4,786,890, Nov. 1988.
57. S. Williams, “Covers of non-almost-finite-type systems,” Proc. AMS, vol. 104, pp. 245–252, 1988.
58. R. Fischer, “Graphs and symbolic dynamics,” Colloquia Math. Societatis Janos Bolyai, ‘Topics in Information Theory’, vol. 16, pp. 229–243, 1975.
59. M. Boyle, B. Kitchens, and B. Marcus, “A note on minimal covers for sofic systems,” Proc. Amer. Math. Soc., vol. 95, no. 3, pp. 403411, Nov. 1985.
60. M. Nasu, “An invariant for bounded-to-one factor maps between transitive sofic subshifts,” Ergod. Theory Dynam. Syst., vol. 5, pp. 89–105, 1985.
61. F. R. Gantmacher, The Theory of Matrices, Vol. II. New York: Chelsea, 1959.
62. E. Seneta, Non-Negative Matrices and Markov Chains, 2nd ed. New York: Springer-Verlag, 1981.
63. I. N. Herstein, Topics in Algebra, 2nd ed. New York: Wiley, 1975.