Finite-State Modulation Codes for Data Storage

The authors provide a self-contained exposition of modulation code design methods based upon the state splitting algorithm. They review the necessary background on finite state transition diagrams, constrained systems, and Shannon (1948) capacity. The state splitting algorithm for constructing finite state encoders is presented and summarized in a step-by-step fashion. These encoders automatically have state-dependent decoders. It is shown that for the class of finite-type constrained systems, the encoders constructed can be made to have sliding-block decoders. The authors consider practical techniques for reducing the number of encoder states as well as the size of the sliding-block decoder window. They discuss the class of almost-finite-type systems and state the general results which yield noncatastrophic encoders. The techniques are applied to the design of several codes of interest in digital data recording. >

[1]  P. Siegel,et al.  A 100% Efficient Sliding-block Code For The Charge-constrained, Run-length-limited Channel With Parameters (d, k; c) - (1, 3; 3) , 1991, Proceedings. 1991 IEEE International Symposium on Information Theory.

[2]  Paul H. Siegel,et al.  Recording Results And Coding Considerations For The Resonant Bias Coil Overwrite Technique , 1989, Photonics West - Lasers and Applications in Science and Engineering.

[3]  Brian H. Marcus,et al.  Variable-length state splitting with applications to average runlength-constrained (ARC) codes , 1991, IEEE Trans. Inf. Theory.

[4]  Thomas D. Howell.  Statistical Properties of Selected Recording Codes , 1989, IBM J. Res. Dev..

[5]  Brian H. Marcus,et al.  Bounds on the number of states in encoder graphs for input-constrained channels , 1991, IEEE Trans. Inf. Theory.

[6]  L. C. Barbosa.  Minimum noise pulse slimmer , 1981 .

[7]  Hiroshi Kamabe,et al.  Minimum scope for sliding block decoder mappings , 1989, IEEE Trans. Inf. Theory.

[8]  Don Coppersmith,et al.  Algorithms for sliding block codes - An application of symbolic dynamics to information theory , 1983, IEEE Trans. Inf. Theory.

[9]  J. Mallinson,et al.  Theory of linear superposition in tape recording , 1969 .

[10]  P. Funk,et al.  Run-length-limited codes with multiple spacing , 1982 .

[11]  Peter A. Franaszek,et al.  On Synchronous Variable Lenght Coding for Discrete Noiseless Channels , 1969, Inf. Control..

[12]  Kees Schouhamer-Immink.  Coding Techniques for Digital Recorders , 1991 .

[13]  Brian H. Marcus,et al.  Sliding-block coding for input-restricted channels , 1988, IEEE Trans. Inf. Theory.

[14]  Peter A. Franaszek.  Construction of Bounded Delay Codes for Discrete Noiseless Channels , 1982, IBM J. Res. Dev..

[15]  F. Dolivo.  Signal processing for high-density digital magnetic recording , 1989, Proceedings. VLSI and Computer Peripherals. COMPEURO 89.

[16]  Brian Marcus,et al.  Factors and extensions of full shifts , 1979 .

[17]  Kees A. Schouhamer Immink.  Coding techniques for the noisy magnetic recording channel: a state-of-the-art report , 1989, IEEE Trans. Commun..

[18]  Arvind M. Patel.  Zero-modulation encoding in magnetic recording , 1975 .

[19]  E.R. Berlekamp,et al.  The technology of error-correcting codes , 1980, Proceedings of the IEEE.

[20]  Richard E. Blahut,et al.  Digital transmission of information , 1990 .

[21]  Paul H. Siegel,et al.  Recording codes for digital magnetic storage , 1985 .

[22]  Jonathan J. Ashley.  A linear bound for sliding-block decoder window size , 1988, IEEE Trans. Inf. Theory.

[23]  Peter Lancaster,et al.  The theory of matrices , 1969 .

[24]  R. F. Williams.  Errata to "Classification of Subshifts of Finite Type" , 1974 .

[25]  R. Kost,et al.  Binary two-thirds rate code with full word look-ahead , 1984 .

[26]  Abraham Lempel,et al.  Look-ahead coding for input- restricted channels , 1982, IEEE Trans. Inf. Theory.

[27]  Roger W. Wood,et al.  Viterbi Detection of Class IV Partial Response on a Magnetic Recording Channel , 1986, IEEE Trans. Commun..

[28]  Kees A. Schouhamer Immink,et al.  Runlength-limited sequences , 1990, Proc. IEEE.

[29]  W J Tomlinson.  Topical meeting on optical data storage. , 1984, Applied optics.

[30]  Brian H. Marcus,et al.  State splitting for variable-length graphs , 1986, IEEE Trans. Inf. Theory.

[31]  Masakazu Nasu,et al.  An invariant for bounded-to-one factor maps between transitive sofic subshifts , 1985, Ergodic Theory and Dynamical Systems.

[32]  Benjamin Weiss,et al.  Equivalence of topological Markov shifts , 1977 .

[33]  Hisashi Kobayashi,et al.  Application of partial-response channel coding to magnetic recording systems , 1970 .

[34]  Paul H. Siegel,et al.  Matched spectral-null codes for partial-response channels , 1989, IEEE Trans. Inf. Theory.

[35]  G. Jacoby.  A new look-ahead code for increased data density , 1977 .

[36]  P. A. Franaszek,et al.  Sequence-state coding for digital transmission , 1968 .

[37]  Jack K. Wolf,et al.  A new rate 2/3 sliding block code for the (1, 7) runlength constraint with the minimal number of encoder states , 1991, IEEE Trans. Inf. Theory.

[38]  Aaron D. Wyner,et al.  Optimum Block Codes for Noiseless Input Restricted Channels , 1964, Inf. Control..

[39]  Marie-Pierre Béal.  The method of poles: A coding method for constrained channels , 1990, IEEE Trans. Inf. Theory.

[40]  Lalit R. Bahl,et al.  Block Codes for a Class of Constrained Noiseless Channels , 1970, Inf. Control..

[41]  Paul H. Siegel,et al.  A note on the Shannon capacity of run-length-limited codes , 1987, IEEE Trans. Inf. Theory.

[42]  M. Newman,et al.  Topics in Algebra , 1978 .

[43]  F. R. Gantmakher.  The Theory of Matrices , 1984 .

[44]  D. Rugar.  Magnetooptic direct overwrite using a resonant bias coil , 1988 .

[45]  P.,et al.  Applications of a Peak Detection Channel Model , .

[46]  Brian H. Marcus,et al.  Sofic systems and encoding data , 1985, IEEE Trans. Inf. Theory.

[47]  P. Franaszek.  Sequence-state methods for run-length-limited coding , 1970 .

[48]  Peter A. Franaszek.  A General Method for Channel Coding , 1980, IBM J. Res. Dev..

[49]  Susan G. Williams.  Covers of non-almost-finite type sofic systems , 1988 .

[50]  Mike Boyle,et al.  A note on minimal covers for sofic systems , 1985 .