• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.8
• /
• pp.656-661
• /
• 2013

In Guided Scrambling (GS) encoding for the holographic storage, after scrambling augmented source word into codeword, the best codeword satisfying modulation constraint is determined. Modulation constraints considered in this paper are strength which is the minimum number of transition between '0' and '1' in each row and column of codeword array and the symbol balancedness of codeword array. In this paper, we show that GS encoding procedure can be formulated as an integer programming model and develop a fast neighborhood search heuristic for fast computation of control bits. In the simulation, we compared the performance of heuristic algorithm with the integer programming model for various array and control bit size combinations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.8
• /
• pp.650-655
• /
• 2013

For the DC-free encoding of source data, the Guided Scrambling (GS) technique is widely used as multi-mode coding in the optical data storage system. For DC-suppression GS coding in the holographic data storage system, the conservative array and balanced coding criteria are proposed. In this paper, equivalent integer programming models are developed to determine the optimal control bits for the minimum digital sum value (MDSV), conservative array, and balanced coding criteria. Using the proposed integer programming models, we compare the performance of GS encoding for the various combination of control bit/array sizes and scrambling polynomials.