Browse > Article
http://dx.doi.org/10.7840/kics.2013.38A.6.459

Integer Programming Models for the Design of Two-Dimensional Holographic Storage Modulation Code  

Park, Taehyung (숭실대학교 산업정보시스템공학과)
Lee, Jaejin (숭실대학교 정보통신전자공학부 정보저장및통신 연구실)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.38A, no.6, 2013 , pp. 459-464 More about this Journal
Abstract
In this paper, we introduce a modulation code design problem where best selection of two-dimensional codewords are determined to reduce two-dimensional (2D) intersymbol interference (ISI) and interpage interference (IPI). Codeword selection problem is formulated as a quadratic integer programming model that minimizes intra- and inter-symbol differences subject to uniform symbol usage and minimal Hamming distance violations. Second integer programming model detects the occurrence of isolated pixel pattern in the selected codewords. The proposed models are applied to 4-level and 2-level 6/8 codes.
Keywords
Holographic data storage; Intersymbol interfernece; Quadratic Integer Programming; Isolated pixel detection;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 L. Hesselink, S. S. Orlov, and M. C. Bashaw, "Holographic data storage systems," in Proc. IEEE, vol. 92, no. 8, pp. 1231-1280, July 2004.   DOI   ScienceOn
2 V. Vadde and B. V. K. V. Kumar, "Channel modeling and estimation for intrapage equalization in pixel-matched volume holographic data storage," Appl. Opt., vol. 38, no. 20, pp. 4374-4386, July 1999.   DOI
3 J. Kim, J.-K. Wee and J. Lee, "Error correcting 4/6 modulation codes for holographic data storage," Japanese J. Appl. Phys., vol. 49, Article no. 08KB04, Aug. 2010.
4 J. Kim and J. Lee, "Error-correcting 6/8 modulation code for reducing two-dimensional intersymbol interference," Japanese J. Appl. Phys., vol. 50, no. 9, pp. 09MB06, Sep. 2011.   DOI
5 J. Kim and J. Lee, "Two-dimensional non-ioslated pixel modulation code for holographic data storage," J. KICS, vol. 34, no. 2, pp. 163-168, Feb. 2009.   과학기술학회마을
6 M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., 1979.
7 H. D. Sherali and J. C. Smith, "A polyhedral study of the generalized vertex packing problem," Math. Programming, vol. 107, no. 3, pp. 367-390, July 2006.   DOI
8 E. M. Macambira and C. C. de Souza, "The edge-weighted clique problem: valid inequalities, facets and polyhedral computations," European J. Operational Research, vol. 123, no. 2, pp. 346-371, June 2000.   DOI   ScienceOn
9 P. Bonami and J. Lee, BONMIN 1.1 Users' Manual, Retrieved Dec., 21, 2009, from http://projects.coin-or.org/Bonmin.
10 R. Fourer, D. M. Gay, and B. W. Kernighan, AMPL: A Modeling Language for Mathematical Programming, Scientific Press, 1993.
11 IBM, IBM ILOG CPLEX V12.1: User's Manual for CPLEX, Retrieved Dec., 19, 2009, from ftp://public.dhe.ibm.com/software/websphere/ilog/docs/optimization/cplex/ps_usrmancplex.pdf.