Cutting Plane Algorithm for the Selection of Non-Isolated Pixel Modulation Code 


Vol. 38,  No. 6, pp. 465-470, Jun.  2013


PDF
  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), while when these codewords are randomly arranged on the storage, isolated pixel cannot be formed. Codeword selection problem and isolated pixel detection problem are formulated as integer program models and we develop a cutting plane algorithm where a valid cut is generated to remove current feasible solution to avoid isolated pixel by solving the isolated pixel detection subproblem. Using the proposed method, 4x2 6/8 codewords with non-isolated pixel are found.

  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, "Cutting Plane Algorithm for the Selection of Non-Isolated Pixel Modulation Code," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 6, pp. 465-470, 2013. DOI: .

[ACM Style]

Taehyung Park and Jaejin Lee. 2013. Cutting Plane Algorithm for the Selection of Non-Isolated Pixel Modulation Code. The Journal of Korean Institute of Communications and Information Sciences, 38, 6, (2013), 465-470. DOI: .

[KICS Style]

Taehyung Park and Jaejin Lee, "Cutting Plane Algorithm for the Selection of Non-Isolated Pixel Modulation Code," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 6, pp. 465-470, 6. 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