Data modulating method and apparatus, data demodulating method and apparatus, and code arranging method

• US 7,450,034 B2
• Filed: 11/21/2007
• Issued: 11/11/2008
• Est. Priority Date: 09/27/2002
• Status: Expired due to Fees

• Current Assignee: Samsung Electronics Co. Ltd.
• Original Assignee: Samsung Electronics Co. Ltd.
• Inventors: Shim, Jae-seong, Kim, Jin-han, Jung, Kiu-hae
• Primary Examiner(s): YOUNG, BRIAN K
• Application Number:
  US11/943,794
• Publication Number:
  US 20080094262A1
• Time in Patent Office: 356 Days
• Field of Search: 341/58, 341/59, 341/60, 341/102, 341/103
• US Class Current: 341/59
• CPC Class Codes: G11B 20/1426 conversion to or from block codes or representations thereof
• CPC Class Codes: H03M 5/145 Conversion to or from block codes or representations thereof

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.

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.

2. The method of claim 1, wherein the minimum run length “

d”

is 1 and the maximum run length “

k”

is 7, the code word a is changed into a code word in which a least significant bit (LSB) of the code word is “

0”

when the endzero of the code word a is “

0” and

the leadzero of the code word b is “

0”

.

3. The method of claim 1, wherein changing at least one of a code word a and a code word b into another code word comprises changing least significant bits (LSBs) of the code word a or most significant bits (MSBs) of the code word b.