A MaxMin Model for the Worst Case Performance Evaluation of GS Coding for DC-free Modulation 


Vol. 38,  No. 8, pp. 644-649, Aug.  2013


PDF
  Abstract

For effective DC-free coding in the optical storage systems, the Guided Scrambling algorithm is widely used. To reduce digital discrepancy of the coded sequence, functions of digital sum value (DSV) are used as criteria to choose the best candidate. Among these criteria, the minimum digital sum value (MDSV), minium squared weight (MSW), and minimum threshold overrun (MTO) are popular methods for effective DC-suppression. In this paper, we formulate integer programming models that are equivalent to MDSV, MSW, and MTO GS coding. Incorporating the MDSV integer programming model in MaxMin setting, we develop an integer programming model that computes the worst case MDSV bound given scrambling polynomial and control bit size. In the simulation, we compared the worst case MDSV bound for different scrambling polynomial and control bit sizes. We find that careful selection of scrambling polynomial and control bit size are important factor to guarantee the worst case MDSV performance.

  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, "A MaxMin Model for the Worst Case Performance Evaluation of GS Coding for DC-free Modulation," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 8, pp. 644-649, 2013. DOI: .

[ACM Style]

Taehyung Park and Jaejin Lee. 2013. A MaxMin Model for the Worst Case Performance Evaluation of GS Coding for DC-free Modulation. The Journal of Korean Institute of Communications and Information Sciences, 38, 8, (2013), 644-649. DOI: .

[KICS Style]

Taehyung Park and Jaejin Lee, "A MaxMin Model for the Worst Case Performance Evaluation of GS Coding for DC-free Modulation," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 8, pp. 644-649, 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