DATA MODULATING METHOD AND APPARATUS, DATA DEMODULATING METHOD AND APPARATUS, AND CODE ARRANGING METHOD
First Claim
1. A method for processing data recorded on a recording layer in an information storage medium, the method comprising:
- performing a modulation operation of source data into a modulated code stream of code words where a minimum run length is confined to “
d” and
a maximum run length is confined to a “
k”
, wherein “
d” and
“
k”
are positive integers, wherein, when a code word “
c”
is obtained by combining a preceding code word “
a” and
a following code word “
b”
, at least one of the code word “
a” and
the code word “
b”
is changed into another code word so that the code word “
c”
satisfies a run length limit.
0 Assignments
0 Petitions
Accused Products
Abstract
In a data demodulating method and apparatus, and a code arranging method, a multiplexer multiplexes an input data stream divided by a predetermined length into a plurality of types of pseudo random data streams using multiplexed information of predetermined bits by applying a predetermined multiplexing method to each of the pseudo random data streams. An encoder RLL-modulates the plurality of types of pseudo random data streams to create a modulated code stream including a minimum of DC components. The multiplexer generates the random data streams by inconsecutively scrambling the input data stream using the multiplexed information. The encoder weak DC-free RLL-modulates each of the multiplexed data streams without using a DC control sub code conversion table to which additional bits are added and provides a code stream including a minimum of DC components among multiplexed, RLL-modulated code streams.
53 Citations
3 Claims
-
1. A method for processing data recorded on a recording layer in an information storage medium, the method comprising:
-
performing a modulation operation of source data into a modulated code stream of code words where a minimum run length is confined to “
d” and
a maximum run length is confined to a “
k”
, wherein “
d” and
“
k”
are positive integers,wherein, when a code word “
c”
is obtained by combining a preceding code word “
a” and
a following code word “
b”
, at least one of the code word “
a” and
the code word “
b”
is changed into another code word so that the code word “
c”
satisfies a run length limit. - View Dependent Claims (2, 3)
-
Specification