Two-dimensional charge constrained modulation codes

Yinyi Lin; Pi Hai Liu

doi:10.1109/20.573872

Two-dimensional charge constrained modulation codes

Yinyi Lin, Pi Hai Liu

Department of Communication Engineering

Research output: Contribution to journal › Article › peer-review

Abstract

Two-dimensional (2-D) (d, k) codes have been proposed for multichannel recording systems. These codes increase storage density by employing a multichannel timing recovery mechanism. In addition to the (d, k) constraint, some recording systems require a charge constraint to meet the channel requirements. In this study, capacities of 2-D charge constrained modulation codes are derived and computed from the binary and runlength graphs of the codes. The power spectral densities of codes are computed from their runlength graphs. Finally, a method to construct 2-D charge constrained modulation codes is provided.

Original language	English
Pages (from-to)	2451-2458
Number of pages	8
Journal	IEEE Transactions on Magnetics
Volume	33
Issue number	3
DOIs	https://doi.org/10.1109/20.573872
State	Published - 1997

Keywords

(d, k) modulation code
Binary graph
Capacity
Power spectrum
Runlength graph

Access to Document

10.1109/20.573872

Cite this

@article{6b45d92a79194660b28ee534ac1cd722,

title = "Two-dimensional charge constrained modulation codes",

abstract = "Two-dimensional (2-D) (d, k) codes have been proposed for multichannel recording systems. These codes increase storage density by employing a multichannel timing recovery mechanism. In addition to the (d, k) constraint, some recording systems require a charge constraint to meet the channel requirements. In this study, capacities of 2-D charge constrained modulation codes are derived and computed from the binary and runlength graphs of the codes. The power spectral densities of codes are computed from their runlength graphs. Finally, a method to construct 2-D charge constrained modulation codes is provided.",

keywords = "(d, k) modulation code, Binary graph, Capacity, Power spectrum, Runlength graph",

author = "Yinyi Lin and Liu, {Pi Hai}",

note = "Funding Information: Manuscript received June 7, 1996; revised November 5, 1996. This work was supported by the National Science Council, R.O.C., under Contract NSC 86-2213-E-008-016. The authors are with the Department of Electrical Engineering, National Central University, Chung Li, Taiwan 32054, R.O.C. Publisher Item Identifier S 0018-9464(97)02219-X.",

year = "1997",

doi = "10.1109/20.573872",

language = "???core.languages.en_GB???",

volume = "33",

pages = "2451--2458",

journal = "IEEE Transactions on Magnetics",

issn = "0018-9464",

number = "3",

}

TY - JOUR

T1 - Two-dimensional charge constrained modulation codes

AU - Lin, Yinyi

AU - Liu, Pi Hai

N1 - Funding Information: Manuscript received June 7, 1996; revised November 5, 1996. This work was supported by the National Science Council, R.O.C., under Contract NSC 86-2213-E-008-016. The authors are with the Department of Electrical Engineering, National Central University, Chung Li, Taiwan 32054, R.O.C. Publisher Item Identifier S 0018-9464(97)02219-X.

PY - 1997

Y1 - 1997

N2 - Two-dimensional (2-D) (d, k) codes have been proposed for multichannel recording systems. These codes increase storage density by employing a multichannel timing recovery mechanism. In addition to the (d, k) constraint, some recording systems require a charge constraint to meet the channel requirements. In this study, capacities of 2-D charge constrained modulation codes are derived and computed from the binary and runlength graphs of the codes. The power spectral densities of codes are computed from their runlength graphs. Finally, a method to construct 2-D charge constrained modulation codes is provided.

AB - Two-dimensional (2-D) (d, k) codes have been proposed for multichannel recording systems. These codes increase storage density by employing a multichannel timing recovery mechanism. In addition to the (d, k) constraint, some recording systems require a charge constraint to meet the channel requirements. In this study, capacities of 2-D charge constrained modulation codes are derived and computed from the binary and runlength graphs of the codes. The power spectral densities of codes are computed from their runlength graphs. Finally, a method to construct 2-D charge constrained modulation codes is provided.

KW - (d, k) modulation code

KW - Binary graph

KW - Capacity

KW - Power spectrum

KW - Runlength graph

UR - http://www.scopus.com/inward/record.url?scp=0031143035&partnerID=8YFLogxK

U2 - 10.1109/20.573872

DO - 10.1109/20.573872

M3 - 期刊論文

AN - SCOPUS:0031143035

SN - 0018-9464

VL - 33

SP - 2451

EP - 2458

JO - IEEE Transactions on Magnetics

JF - IEEE Transactions on Magnetics

IS - 3

ER -

Two-dimensional charge constrained modulation codes

Abstract

Keywords

Access to Document

Fingerprint

Cite this