Abstract
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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
