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

A data modulating method of modulating m-bit source data into n-bit, wherein n≧m, and m and n are positive integers, code words where a minimum run length limit is confined to “d” and a maximum run length limit is confined to “k”, wherein “d” and “k” are positive integers, the data modulating method comprising:

• multiplexing 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;
• and
• RLL-modulating the plurality of types of pseudo random data streams to create a modulated code stream in which an optimal DC suppression is performed.

A data modulating method of modulating m-bit source data into n-bit, wherein n≧m, and m and n are positive integers, code words where a minimum run length limit is confined to “d” and a maximum run length limit is confined to “k”, wherein “d” and “k” are positive integers, the data modulating method comprising:

• multiplexing 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;
• and
• weak DC-free RLL-modulating the multiplexed data streams without using a DC control code conversion table comprising additional bits and providing a code stream comprising a minimum of DC components among multiplexed, RLL-modulated code streams.

A data demodulating method comprising:

• demodulating each n bit of input digital data into m-bit where n≧m, and m and n are positive integers, of a demodulation code unit to generate a non-inverted data stream having a predetermined length;
• and
• inconsecutively descrambling the non-inverted data stream using multiplexed information to generate an inverted data stream.

A method of arranging m-bit source data into n-bit, where n≧m, and n and m are positive integers, code words by confining a minimum run length limit “d” to 1 and a maximum run length limit “k” to 7, where “d” and “k” are positive integers, the method comprising:

• when a code word a is connected to a code word b, the code word a is a preceding code word, the code word b is selected from code words b1 and b2, a code stream in which the code word a is connected to the code word b1 is X1, and a code stream in which the code word a is connected to the code word b2 is X2, arranging the code words b1 and b2 to have opposite parameters INV predicting a transition of a next code depending on whether a number of bits of value “1” in a code word is odd or even;
• and
• when the code word a is connected to the code word b1 or b2, although the code word a, b1, or b2 is modulated into another type of code word according to a boundary rule, arranging the code streams X1 and X2 to have opposite parameters INV.

A method of arranging m-bit source data into n-bit, wherein n≧m, and n and m are positive integers, code words by confining a minimum run length limit “d” to 1 and a maximum run length limit “k” to 7, where “d” and “k” are positive integers, the method comprising:

• when a code word b is connected to a code word c, the code word b is a preceding code word, the code word b is selected from code words b1 and b2, a code stream in which the code word b1 is connected to the code word c is Y1, and a code stream in which the code word b2 is connected to the code word c is Y2, the code words b1 and b2 are arranged to have opposite parameters INV predicting a transition of a next code depending on whether a number of bits of value “1” in a code word is odd or even;
• and
• when the code word b1 or b2 is connected to the code word c, although the code word b1, b2, or c is modulated into another type of code word according to a boundary rule, arranging the code streams Y1 and Y2 to have opposite parameters INV.

A data modulating apparatus to modulate m-bit source data into n-bit, wherein n ≧m, and n and m are positive integers, code words where a minimum run length limit is confined to “d” and a maximum run length limit is confined to “k”, wherein “d” and “k” are positive integers, the data modulating apparatus comprising:

• a multiplexer that 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;
• and
• an encoder that RLL-modulates the plurality of types of pseudo random data streams to create a modulated code stream in which an optimal DC suppression is performed.

A data demodulating apparatus comprising:

• a decoder demodulating each n bit of input digital data into m-bit, wherein n≧m, and n and m are positive integers, of a demodulation code unit to generate a non-inverted data stream having a predetermined length;
• and
• a demultiplexer that inconsecutively descrambles the non-inverted data stream using multiplexed information to generate an inverted data stream.

A computer-readable medium having computer-executable instructions for performing operations of a data modulating method of modulating m-bit source data into n-bit, wherein n≧m and m and n are positive integers, code words where a minimum run length limit is confined to “d” and a maximum run length limit is confined to “k”, wherein “d” and “k” are positive integers, the operations comprising:

• multiplexing 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;
• and
• RLL-modulating the plurality of types of pseudo random data streams to create a modulated code stream in which an optimal DC suppression is performed.

A computer-readable medium having computer-executable instructions for performing operations of a data modulating method of modulating m-bit source data into n-bit, wherein n≧m and m and n are positive integers, code words where a minimum run length limit is confined to “d” and a maximum run length limit is confined to “k”, wherein “d” and “k” are positive integers, the operations comprising:

• multiplexing 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;
• and
• weak DC-free RLL-modulating the multiplexed data streams without using a DC control code conversion table comprising additional bits and providing a code stream comprising a minimum of DC components among multiplexed, RLL-modulated code streams.

A computer-readable medium having computer-executable instructions for performing operations of a data demodulating method, the operations comprising:

• demodulating each n bit of input digital data into m-bit, where n≧m and m and n are positive integers, of a demodulation code unit to generate a non-inverted data stream having a predetermined length;
• and
• inconsecutively descrambling the non-inverted data stream using multiplexed information to generate an inverted data stream.

A computer-readable medium having computer-executable instructions for performing operations of a method of arranging m-bit source data into n-bit, where n≧m and n and m are positive integers, code words by confining a minimum run length limit “d” to 1 and a maximum run length limit “k” to 7, where “d” and “k” are positive integers, the operations comprising:

• when a code word a is connected to a code word b, the code word a is a preceding code word, the code word b is selected from code words b1 and b2, a code stream in which the code word a is connected to the code word b1 is X1, and a code stream in which the code word a is connected to the code word b2 is X2, arranging the code words b1 and b2 to have opposite parameters INV predicting a transition of a next code depending on whether a number of bits of value “1” in a code word is odd or even;
• and
• when the code word a is connected to the code word b1 or b2, although the code word a, b1, or b2 is modulated into another type of code word according to a boundary rule, arranging the code streams X1 and X2 to have opposite parameters INV.

A computer-readable medium having computer-executable instructions for performing operations of a method of arranging m-bit source data into n-bit, wherein n≧m and n and m are positive integers, code words by confining a minimum run length limit “d” to 1 and a maximum run length limit “k” to 7, where “d” and “k” are positive integers, the operations comprising:

• when a code word b is connected to a code word c, the code word b is a preceding code word, the code word b is selected from code words b1 and b2, a code stream in which the code word b1 is connected to the code word c is Y1, and a code stream in which the code word b2 is connected to the code word c is Y2, the code words b1 and b2 are arranged to have opposite parameters INV predicting a transition of a next code depending on whether a number of bits of value “1” in a code word is odd or even;
• and
• when the code word b1 or b2 is connected to the code word c, although the code word b1, b2, or c is modulated into another type of code word according to a boundary rule, arranging the code streams Y1 and Y2 to have opposite parameters INV.