Integer Programming Model and Heuristic on the Guided Scrambling Encoding for Holographic Data Storage 


Vol. 38,  No. 8, pp. 656-661, Aug.  2013


PDF
  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.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

T. Park and J. Lee, "Integer Programming Model and Heuristic on the Guided Scrambling Encoding for Holographic Data Storage," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 8, pp. 656-661, 2013. DOI: .

[ACM Style]

Taehyung Park and Jaejin Lee. 2013. Integer Programming Model and Heuristic on the Guided Scrambling Encoding for Holographic Data Storage. The Journal of Korean Institute of Communications and Information Sciences, 38, 8, (2013), 656-661. DOI: .

[KICS Style]

Taehyung Park and Jaejin Lee, "Integer Programming Model and Heuristic on the Guided Scrambling Encoding for Holographic Data Storage," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 8, pp. 656-661, 8. 2013.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880