The search functionality is under construction.

The search functionality is under construction.

Guided Scrambling (GS) is used for control of the runlength within code blocks, such as *d* or *k*, as well as for DC component suppression. A code designed by the GS technique, called a *weakly constrained code*, does not strictly guarantee the imposed *k*-constraint, but rather generates code blocks that violate the prescribed constraint with very low probability. In this case, the code rate and efficiency become very high, compared with typical RLL codes using a small constrained length. In this paper, weakly constrained codes based on the convolutional GS and GF-addition GS generate the weakly *k*-constraint sequences. The probability that a code block violates the *k*-constraint is measured. To show the superior performance of the GS, the occurrence probability of each runlength is also investigated and compared with the 24/25(0, 8) block code which has a high code rate and adheres to channel constraints. We also compare it with the runlength distribution of a maxentropic RLL sequence and show that the statistical property of the GS-encoded sequences is similar to that of the maxentropic RLL sequence on runlength distribution.

- Publication
- IEICE TRANSACTIONS on Electronics Vol.E82-C No.12 pp.2209-2217

- Publication Date
- 1999/12/25

- Publicized

- Online ISSN

- DOI

- Type of Manuscript
- Special Section PAPER (Special Issue on Information Storage Technologies for the 21st Century)

- Category

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Akiomi KUNISA, "Runlength Control Based on Guided Scrambling for Digital Magnetic Recording" in IEICE TRANSACTIONS on Electronics,
vol. E82-C, no. 12, pp. 2209-2217, December 1999, doi: .

Abstract: Guided Scrambling (GS) is used for control of the runlength within code blocks, such as *d* or *k*, as well as for DC component suppression. A code designed by the GS technique, called a *weakly constrained code*, does not strictly guarantee the imposed *k*-constraint, but rather generates code blocks that violate the prescribed constraint with very low probability. In this case, the code rate and efficiency become very high, compared with typical RLL codes using a small constrained length. In this paper, weakly constrained codes based on the convolutional GS and GF-addition GS generate the weakly *k*-constraint sequences. The probability that a code block violates the *k*-constraint is measured. To show the superior performance of the GS, the occurrence probability of each runlength is also investigated and compared with the 24/25(0, 8) block code which has a high code rate and adheres to channel constraints. We also compare it with the runlength distribution of a maxentropic RLL sequence and show that the statistical property of the GS-encoded sequences is similar to that of the maxentropic RLL sequence on runlength distribution.

URL: https://global.ieice.org/en_transactions/electronics/10.1587/e82-c_12_2209/_p

Copy

@ARTICLE{e82-c_12_2209,

author={Akiomi KUNISA, },

journal={IEICE TRANSACTIONS on Electronics},

title={Runlength Control Based on Guided Scrambling for Digital Magnetic Recording},

year={1999},

volume={E82-C},

number={12},

pages={2209-2217},

abstract={Guided Scrambling (GS) is used for control of the runlength within code blocks, such as *d* or *k*, as well as for DC component suppression. A code designed by the GS technique, called a *weakly constrained code*, does not strictly guarantee the imposed *k*-constraint, but rather generates code blocks that violate the prescribed constraint with very low probability. In this case, the code rate and efficiency become very high, compared with typical RLL codes using a small constrained length. In this paper, weakly constrained codes based on the convolutional GS and GF-addition GS generate the weakly *k*-constraint sequences. The probability that a code block violates the *k*-constraint is measured. To show the superior performance of the GS, the occurrence probability of each runlength is also investigated and compared with the 24/25(0, 8) block code which has a high code rate and adheres to channel constraints. We also compare it with the runlength distribution of a maxentropic RLL sequence and show that the statistical property of the GS-encoded sequences is similar to that of the maxentropic RLL sequence on runlength distribution.},

keywords={},

doi={},

ISSN={},

month={December},}

Copy

TY - JOUR

TI - Runlength Control Based on Guided Scrambling for Digital Magnetic Recording

T2 - IEICE TRANSACTIONS on Electronics

SP - 2209

EP - 2217

AU - Akiomi KUNISA

PY - 1999

DO -

JO - IEICE TRANSACTIONS on Electronics

SN -

VL - E82-C

IS - 12

JA - IEICE TRANSACTIONS on Electronics

Y1 - December 1999

AB - Guided Scrambling (GS) is used for control of the runlength within code blocks, such as *d* or *k*, as well as for DC component suppression. A code designed by the GS technique, called a *weakly constrained code*, does not strictly guarantee the imposed *k*-constraint, but rather generates code blocks that violate the prescribed constraint with very low probability. In this case, the code rate and efficiency become very high, compared with typical RLL codes using a small constrained length. In this paper, weakly constrained codes based on the convolutional GS and GF-addition GS generate the weakly *k*-constraint sequences. The probability that a code block violates the *k*-constraint is measured. To show the superior performance of the GS, the occurrence probability of each runlength is also investigated and compared with the 24/25(0, 8) block code which has a high code rate and adheres to channel constraints. We also compare it with the runlength distribution of a maxentropic RLL sequence and show that the statistical property of the GS-encoded sequences is similar to that of the maxentropic RLL sequence on runlength distribution.

ER -