Capacity of M-ary 2-D RLL constraints for optical recording channels

A new class of M-ary two-dimensional (2-D) run-length limited (RLL) constraints is introduced in this paper. In particular, only RLL d constraints on 2D m /spl times/ n arrays with limited height m are considered. Column vectors of 2-D arrays are used as states in a directed graph. The transfer matrix of the graph is obtained with consideration of non-binary alphabet, and the largest eigenvalue of the transfer matrix is used to calculate the capacity of 2-D (M, d, /spl infin/) RLL constraints on 2-D arrays. Some numerical results are derived for RLL d = 1 and d = 2 constraints. We also present an example of efficient finite-state encoder for d = 1 constraint by state splitting and merging algorithm. The 2-D (M, d, /spl infin/) constrained codes have potential to be applied in advanced 2-D optical recording channels.

[1]  Herbert S. Wilf,et al.  The Number of Independent Sets in a Grid Graph , 1998, SIAM J. Discret. Math..

[2]  Paul H. Siegel,et al.  Efficient coding schemes for the hard-square model , 2001, IEEE Trans. Inf. Theory.

[3]  R. Roth,et al.  Parallel constrained coding with application to two-dimensional constraints , 2002, Proceedings IEEE International Symposium on Information Theory,.

[4]  Bahram Honary,et al.  Nonlinear signal-processing model for signal generation in multilevel two-dimensional optical storage. , 2004, Optics letters.

[5]  J. Wolf,et al.  Bit-stuffing bounds on the capacity of 2-dimensional constrained arrays , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[6]  Duanyi Xu,et al.  Signal processing and coding for multiwavelength and multilevel photochromic optical storage , 2005, SPIE/COS Photonics Asia.

[7]  Schouhamer Immink,et al.  Codes for mass data storage systems , 2004 .

[8]  Kenneth Zeger,et al.  Asymptotic capacity of two-dimensional channels with checkerboard constraints , 2003, IEEE Trans. Inf. Theory.

[9]  Jiangxin Chen,et al.  Improved bit-stuffing bounds on two-dimensional constraints , 2002, Proceedings IEEE International Symposium on Information Theory,.

[10]  Brian H. Marcus,et al.  Finite-State Modulation Codes for Data Storage , 2004 .

[11]  Duanyi Xu,et al.  Multi-wavelength and multi-level optical storage based on photochromic materials , 2005, International Workshop on Information Data Storage and International Symposium on Optical Storage.

[12]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[13]  R. Blahut,et al.  The capacity and coding gain of certain checkerboard codes , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[14]  Kenneth Zeger,et al.  On the capacity of two-dimensional run-length constrained channels , 1999, IEEE Trans. Inf. Theory.

[15]  Jørn Justesen,et al.  Entropy Bounds for Constrained Two-Dimensional Random Fields , 1999, IEEE Trans. Inf. Theory.