Modulating method and apparatus, and demodulating apparatus.

BACKGROUND OF THE INVENTION

0001This invention relates to a modulating method and a demodulating apparatus and, more particularly, to a modulating method for modulating data so as to be suited to transmission or recording of data on a recording medium and a demodulation apparatus for reproducing the data by demodulating the modulated coded data resulting from the demodulation.

0002When transmitting the data or recording the data on the recording medium, such as a magneto-optical disc or an optical disc, the data are modulated so as to be suited for transmission or recording. Block coding has been known as one of such modulating techniques. The block coding consists in blocking a data string into units (data words) each consisting of m × i bits and translating the data words into codewords, each consisting of n × i bits, in accordance with an appropriate coding rule. The block coding becomes a fixed length code if i = 1 and becomes a variable length code if i = 1 and if <u>i</u> may assume plural values, that is if i ≧ 1, with the maximum value of <u>i</u> being i_max = r). The code produced by block coding is termed the variable length code (d, k; m, n; r), where <u>i</u> is termed a constraint length, with i_max being equal to the maximum constraint length <u>r</u>, <u>d</u> is the minimum number of the same consecutive symbols, that is a so-called minimum run of 0's, and <u>k</u> is the maximum number of the same consecutive symbols, that is a so-called maximum run of 0's.

0003When recording the variable length code on, for example, an optical disc, it is modulated into so-called non-return to zero code (NRZ code) and recorded based upon the NRZ modulated variable length code, referred to hereinafter as the recording waveform data string. With the minimum length between transitions and the maximum length between transitions of the recording waveform data string being T_min and T_max, respectively, it is desirable from the viewpoint of the recording density that the minimum length between transitions T_min be long, that is that the minimum run <u>d</u> be large, while it is desirable from the viewpoint of clock reproduction and jitter that the maximum length between transitions T_max be short, that is that the maximum run <u>k</u> be small. A variety of modulation methods have been proposed with which the above conditions are met.

0004In the case of an optical disc having audio data recorded thereon, that is a so-called compact disc (CD), a so-called eight-to-fourteen modulation (EFM) is employed. This modulation method is a variable length code (2, 10; 8, 17; 1) in which, if the interval between bits (bit length) of the recording waveform data string is T, the minimum length between transitions T_min is (2 + 1)T or 3T. What is the same thing, if the interval between bits of the data string is T₁, the minimum length between transitions T_1min is ((8/17) x 3)T₁ or 1.41T₁. In the following description, the indication of the bit length T is directly followed by the bracketed indication of the corresponding bit length T₁. The maximum length between transitions T_max (T_1max) is 11T (5.18T₁), while the window margin T_w, which stands for the allowable jitter, is represented as (m/n) × T, and has a value equal to (8/17)T or 0.47T. With such CD, it may be contemplated to diminish the minimum pit length corresponding to the minimum length between transitions T_min (T_1min) on the optical disc. However, if the minimum pit length becomes excessively shorter than the spot size of the laser beam, it becomes difficult to detect the pits so that errors tend to be produced. On the other hand, limitations are imposed on increasing the recording density by diminishing the wavelength of the laser light source for diminishing the spot size.

0005With the above in view, there has also been developed a modulation method whereby the minimum pit length on the optical disc, that is the minimum length between transitions T_min (T_1min), may be increased without diminishing the information volume.

0006For example, as shown in table 1, there has also been proposed a variable length code (4, 22; 2, 5; 5) in which the minimum length between transitions T_min is increased to 5T (2T₁) for increasing the recording density as compared to EFM. This modulation method is referred to hereinafter as variable five modulation (VFM). With the VFM, the maximum length between transitions T_max (T_1max) is increased to 23T (9.2T₁) as compared to the maximum length between transitions T_max (T_1max) of EFM which is equal to 11T (5.18T₁). That is, the VFM is not meritorious from the viewpoint of clock reproduction and jitter and renders the designing of the apparatus difficult. <tables id="tabl0001" num="0001"><img file="EP0625828A2_D0001.tif" /></tables><tables id="tabl0002" num="0002"><img file="EP0625828A2_D0002.tif" /></tables>

0007In other words, although it is necessary to increase the minimum length between transitions T_min for increasing the recording density, it is necessary to reduce the maximum length between transitions T_max simultaneously to as small a value as possible in order to assure the operating reliability of the apparatus. That is, a smaller value of the ratio of the maximum length between transitions to the minimum length between transitions is desirable. Specifically, the ratio <maths id="math0001" num=""><math display="inline"><mrow><msub><mrow><mtext>T</mtext></mrow><mrow><mtext>max</mtext></mrow></msub><msub><mrow><mtext>/T</mtext></mrow><mrow><mtext>min</mtext></mrow></msub><mtext> = 11T/3T = 3.67</mtext></mrow></math><img file="EP0625828A2_D0003.tif" /></maths> for EFM, while the same ratio for VFM is <maths id="math0002" num=""><math display="inline"><mrow><mtext>23T/5T = 4.60</mtext></mrow></math><img file="EP0625828A2_D0004.tif" /></maths> .

0008In sum, while it is necessary to increase the minimum length between transitions T_min (T_1min),that is the minimum run <u>d</u>, of the variable length code produced on modulation, in order to increase the recording density for a recording medium, such as an optical disc, the maximum length between transitions T_max (T_1max), that is the maximum run <u>k</u>, is undesirably increased with the conventional modulation methods.

SUMMARY OF THE INVENTION

0009In view of the above-described status of the art, it is a principal object of the present invention to provide a modulation method whereby the minimum run <u>d</u> may be enlarged as compared to that of EFM to assure high density recording, and the maximum run <u>k</u> may be diminished as compared to that of VFM, and a demodulating apparatus whereby the variable length code resulting form such modulation may be demodulated in order to reproduce the data.

0010According to a first modulation method of the present invention for converting data having a minimum run of 4 or more and a basic data length of <u>m</u> bits into a variable length code (d, k; m, n; r) having a basic code length of <u>n</u> bits, in which a bit at a preset position of a codeword which has the possibility of giving an infinite number (∞) of the maximum run <u>k</u> and a bit at a preset position of a codeword which gives the maximum number of "0"s consecutive from the LSB towards upper order bit side of the codeword is set as being an unfixed bit.

0011According to a second modulation method of the present invention, the unfixed bit as defined in the first modulation method is set to "1" when <u>d</u> or more bits are consecutive to the unfixed bit.

0012A modulation apparatus according to the present invention inversely converts the variable length code (d, k; m, n; r) having the minimum run <u>d</u> equal to 4 or more and the basic codeword length of <u>n</u> bits, and including an unfixed codeword having an unfixed bit at a preset position the value of which is determined by the number of "0"s consecutive to such bit, and includes detecting the codeword having the unfixed bit, means for determining the constraint length of the variable code depending on the results of detection by the unfixed codeword detection means, and inverse conversion means for inverse converting the variable length code into data based on the constraint length <u>i</u> from the constraint length decision means with the aid of inverse conversion tables of inverse converting n × i bit variable length code into m × i bit data.

0013With the first modulation method of the present invention, when converting data having the minimum run <u>d</u> of 4 or more and the basic data length of <u>m</u> bits into the variable length code (d, k; m, n; r) having the basic code length of <u>n</u> bits, the bit at a preset position of a codeword which is likely to give an infinite number (∞) of the maximum run <u>k</u> and the bit at a preset position of a codeword which gives the maximum number of "0"s consecutive from its least significant bit towards the upper order bit side is an unfixed bit the value of which is fixed depending on the number of "0"s consecutive thereto.

0014With the second modulation method according to the present invention, the unfixed bit is set to "1" when <u>d</u> or more bits are consecutive to the unfixed bit.

0015In this manner, the minimum length between transitions T_min may be increased to 5T from 3T for EFM, thereby improving the recording density. In addition, the distributions of the minimum length between transitions T_min may be concentrated in the vicinity of 5T. On the other hand, the maximum length between transitions T_max may be diminished to, for example, 19T, from 23T for VFM having the same value of the minimum length between transitions T_min, thereby simplifying the designing of the apparatus from the aspects of clock reproduction and jitter. In addition, the ratio of the maximum length between transitions to the minimum length between transitions may be reduced to 3.8 from 4.6 for VFM.

0016With the demodulation apparatus according to the present invention, in which the variable length code (d, k: m, n; r) having the minimum run <u>d</u> or 4 or more and the basic code length of <u>n</u> bits, and including a codeword having an unfixed bit the value of which is determined by the number of "0"a consecutive to the unfixed bit, is inverse converted into data having the basic data length of <u>m</u> bits, the codeword having the unfixed bit is detected, and the constraint length <u>i</u> of the variable length code is determined based upon the results of detection. The variable length code is then inverse-converted into data, on the basis of the constraint length <u>i</u>, with the aid of inverse conversion tables for inverse conversion of the n × i bit variable length code into m × i bit data. In this manner, the variable length code including variable length codeword may be demodulated into data. In addition, the inverse conversion tables for inverse conversion of the variable length code into data and hence the circuit scale may be reduced in size as compared to those of VFM,thereby decreasing the cost.

BRIEF DESCRIPTION OF THE DRAWINGS

0017Fig.1 is a block circuit diagram showing a circuit arrangement for a modulating apparatus according to the present invention.

0018Fig.2 is a graph showing the distribution of the transition lengths with the modulating method according to the present invention as compared to that with the conventional VFM.

0019Fig.3 is a block diagram showing a concrete circuit arrangement of a demodulating apparatus according to the represent invention.

DESCRIPTION OF THE PREFERRED EMBODIMENTS

0020Referring to the drawings, preferred embodiments of the modulating method and the demodulating apparatus according to the present invention are explained in detail. In these embodiments, the present invention is applied to a modulating apparatus for translating data into variable length code (d, k; m, n; r) and a demodulating apparatus for performing an inverse operation of the above-mentioned translating operation. Figs.1 and 3 illustrate circuit arrangements for the modulating apparatus and the demodulating apparatus, respectively.

0021Referring to Fig.1, the modulating apparatus includes a shift register 11 for shifting data based on <u>m</u> bits as a unit, and an encoding circuit 12 for discriminating the constraint length <u>i</u> (i = 1 to r) of data supplied from the shift register 11, based upon <u>m</u> bits as a unit, and for detecting data which is to be transformed into a codeword including an unfixed bit, referred to hereinafter as an unfixed codeword. The apparatus also includes conversion tables 14i, <u>i</u> being 1 to r, for translating data having the minimum run <u>d</u> of not less than four and the basic data length of <u>m</u> bits into the variable length code (d, k; m, n; r) having the basic codeword length of <u>n</u> bits, and a selector 13 for selecting one of the conversion tables 14i based upon the constraint length <u>i</u> from the encoding circuit 12 for supplying m × i bit data to the conversion tables 14i. The apparatus also includes an unfixed bit processing circuit 16_i for setting a bit of a pre-set position of a codeword from the conversion table 14_i which gives an infinite number (∞) of the maximum run <u>k</u> and a bit of a pre-set position of a codeword from the conversion table 14_i having the maximum number of consecutive 0's from the least significant bit towards the upper order bit side and for setting the value of the unfixed bit to 1 when <u>d</u> or more bits are consecutive to the unfixed bit, and a selector 15 for selecting one of the unfixed bit processing circuits 16_i based upon the results of detection from the encoding circuit 12 and supplying the unfixed bit to the selected one of the unfixed bit processing circuit 16_i. The apparatus also includes a multiplexor 17 for commutatively selecting the codeword from the selector 15 or the codeword from the unfixed bit processing circuit 16_i for outputting the selected codeword as serial data, and a buffer memory 18 for temporally storing the variable length codeword from the multiplexor 17 and outputting the stored codeword as the modulated codeword at a pre-set transfer rate. Finally, the apparatus includes a clock generator 19 for supplying clocks to the buffer memory 18.

0022It is now assumed that the variable length code (d, k; m, n; r) is the code (4, 18; 2, 5; 6), with the minimum run of not less than 4, the maximum run <u>k</u> of 0's equal to 18 bits, the basic data length <u>m</u> of 2 bits, the basic codeword length <u>n</u> of 5 bits and with the maximum constraint length <u>r</u> of 6 bits. Then, as shown in Table 2, the conversion table 14₁ is a conversion table for converting 2 × 1 bits or 2 bits, with the constraint length <u>i</u> equal to 1, into the codeword having the length of 5 × 1 bits or 5 bits, referred to hereinafter as a 2-5 conversion table. The conversion table 14₂ is a conversion table for converting 4 bits, with the constraint length <u>i</u> equal to 2, into a 10-bit codeword, referred to hereinafter as a 4-10 conversion table. In a similar manner, the conversion tables 14₃ to 14₆ are a 6-15 conversion table, a 8-20 conversion table, 10-25 conversion table and a 12-30 conversion table, respectively.

0023In these conversion tables, the conversion table having a codeword the maximum run <u>k</u> of which becomes equal to ∞ if the unfixed bit is set to 0, such as the conversion table 14₁ (2-5 conversion table), has a coding rule of converting data "01" in binary representation into a codeword "00*00" in which a bit as from the least significant bit (LSB) up to the m'th bit which, if set to 1, will give the least value of the maximum length of transition T_max, becomes an unfixed bit, where * is fixed to 1 or 0 depending on the number of 0's consecutive thereto. The conversion table 14₂ (4-10 conversion table) has a coding rule of converting data "1011" into a codeword "00000 00*00". The conversion table including a codeword in which the number of 0's consecutive from the LSB towards the upper order side becomes maximum, such as the conversion table 14₄ (8-20 conversion table), has a coding rule of converting data "00000100" into a codeword "00000 00000 00100 00*00". These conversion tables are implemented by, for example, a ROM in which the values of the codewords are previously stored with the data as addresses. <tables id="tabl0003" num="0003"><img file="EP0625828A2_D0005.tif" /></tables>

0024The shift register 11 is supplied with data obtained by processing video signals with data compression operations, such as predictive coding, discrete cosine transform, Huffman coding or the like. The shift register 11 shifts the input data, based upon <u>m</u> bits as a unit, and outputs the data to the encoding circuit 12.

0025The encoding circuit 12 discriminates the constraint length <u>i</u> of the input data supplied thereto based upon <u>m</u> bits as a unit. Specifically, the encoding circuit 12 checks if data supplied thereto on the 2-bit basis is present in the data portion of the 2-5 conversion table shown in Table 2. That is, the encoding circuit determines the constraint length <u>i</u> to be 1 when the data is "11", "10" and "01" and, if the data is "00", it adds the next two bits to produce 4 bits, that is it shifts the input data to the next rank. If data "10" and data "11" are consecutive to each other in this order, the constraint length <u>i</u> is determined to be 2 in order to prevent the maximum run of the variable length code produced on conversion from becoming infinite (∞).

0026The encoding circuit 12 checks if 4-bit data supplied thereto is present in a data portion of the 4-10 conversion table shown in Table 2. That is, the encoding circuit determines the constraint length <u>i</u> to be 2 when the data is "0011", "0010" and "1011" and, if the data is "0001" or "0000", it shifts the input data to the next rank.

0027In a similar manner, the encoding circuit 12 determines the data portions of the 6-15 conversion table, 8-20 conversion table or the 10-25 conversion table in which the data supplied on the 2-bit basis from the shift register 11 is present, and accordingly determines the constraint length i = 3 to 6.

0028The encoding circuit 12 also detects data "01", "1011" and "00000100" and detects these data as being data in which the codeword produced on conversion becomes an unfixed codeword.

0029The selector 13 then selects the conversion table 14_i based upon the constraint length <u>i</u> supplied from the encoding circuit 12, and routes m × i bit data to the thus selected conversion table 14_i.

0030Specifically, the selector 13 selects the conversion table 14₁ when i = 1, and routes 2-bit data "11", "10" and "01" to the thus selected conversion table 14_i.

0031The selector 13 selects the conversion table 14₂ when i = 2 and routes 4-bit data "0011", "0010" and "1011" to the thus selected conversion table 14₂. If the data "10" and data "11" are consecutive in this order, the selector selects the conversion table 14₂ and routes 4-bit data "1011" to the conversion table 14₂.

0032In a similar manner, the selector 13 selects the conversion tables 14₃ to 14₆, associated with the value of the constraint length <u>i</u> if the constraint length <u>i</u> is 3 to 6, and routes 6-12 bit data to the thus selected conversion tables 14₃ to 14₆.

0033The conversion tables 14₁ to 14₆ have the 2-5, 4-10, 6-15, 8-20, 10-25 and 12-30 conversion tables, as explained hereinabove, and reads out the codewords of the codeword portion, using the data supplied via the selector 13 as the readout addresses.

0034The result is that, if the data is "11", "10" and "01", the conversion table 14₁ outputs the codewords "10000", "01000" and an unfixed codeword "00*00", respectively.

0035If the data is "0011", "0010" and "1011", the conversion table 14₂ outputs the codewords "00010 00000", "00001 00000" and an unfixed codeword "00000 00*00", respectively.

0036If the data is "000111", "000110", ^... "000011", the conversion table 14₃ outputs the codewords "00010 00010 00000", "00010 00001 00000",. ^... "00000 00001 00000".

0037If the data is "00001011", "00001010", ^... "00000100", the conversion table 14₄ outputs the codewords "00010 00010 00010 00000", "00010 00010 00001 00000", ^... and an unfixed codeword "00000 00000 00100 00*00", respectively.

0038If the data is "0000001111", "0000001110", ^... "0000000001", the conversion table 14₅ outputs the codewords "01000 00000 00000 00010 00000", "01000 00000 00000 00001 00000" ^... "00000 00000 00100 00001 00000", respectively.

0039If the data is "000000000011", "000000000010", ^... "000000000000", the conversion table 14₆ outputs the codewords "00010 00010 00010 00010 00010 00000", "00010 00010 00010 00010 00001 00000" ^..., "00010 00010 00001 00001 00001 00000", respectively,

0040That is, these conversion tables 14₁ to 14₆ output variable length codewords and route these codewords to the selector 15. The selector 15 selects the unfixed bit processing circuit 16_i, based upon the results of detection of the unfixed codeword, supplied from the encoding circuit 12, and routes the unfixed codeword to the unfixed bit processing circuit 16_i, while routing the codewords other than the unfixed codeword to the multiplexor 17.

0041Specifically, the selector 15 selects, when supplied with an unfixed codeword "00*00" containing the unfixed bit "*", the unfixed bit processing circuit 16_i, based upon the results of detection of the unfixed codeword, and routes the unfixed codeword "00*00" to the unfixed bit processing circuit 16_i.

0042When supplied with the unfixed codeword "00000 00*00", for example, the selector 15 selects the unfixed bit processing circuit 16₂, and routes the unfixed codeword "00000 00*00" to the unfixed bit processing circuit 16₂.

0043When supplied with the unfixed codeword "00000 00000 00100 00*00", for example, the selector 15 selects the unfixed bit processing circuit 16₄, and routes the unfixed codeword "00000 00000 00100 00*00" to the unfixed bit processing circuit 16₄.

0044The unfixed bit processing circuit 16₁ sets the unfixed bit of the unfixed codeword "00*00", that is the third bit as counted from the LSB being the first bit, to 1 when not less than <u>d</u> "0" bits are continuously adjacent to the unfixed bit. Specifically, if the unfixed codeword "00*00" is followed by the codeword "10000", the processing circuit 16₁ sets the unfixed codeword "00*00" fixedly to a codeword "00000". On the other hand, if the codeword "00010 00000" is followed by the unfixed codeword "00*00", the unfixed codeword is set fixedly to a codeword "00100".

0045Also the unfixed bit processing circuit 16₂ sets the unfixed codeword "00000 00*00" fixedly to a codeword "00000 00100" or to a codeword "00000 00000" depending on the number of "0"s consecutive to the unfixed bit.

0046Furthermore, the unfixed bit processing circuit 16₄ sets the unfixed codeword "00000 00000 00100 00*00" fixedly to a codeword "00000 00000 00100 00100" or to a codeword "00000 00000 00100 00000" depending on the number of "0"s consecutive to the unfixed bit.

0047The multiplexor 17 multiplexes the codeword from the selector 15 and the codeword fixed by the unfixed bit processing circuit 16_i to produce serial data which is supplied to the buffer memory 18.

0048The buffer memory 18 transiently stores the codewords supplied thereto from the multiplexor 17 and outputs the stored codewords as the codewords at a pre-set transfer rate in an timed relation to the clocks supplied from the clock generator 19.

0049That is, if the bit length of the NRZI modulated variable length codeword, referred to herein as the recording waveform data string, is T, the minimum length between transitions T_min with the variable length code (4, 18; 2, 5; 6) of the present embodiment is (4 + 1)T or 5T. The maximum length between transitions T_max is (18 + 1)T or 19T, while the window margin T_w which gives an allowable jitter value is represented by (m/n) × T and has a value equal to 2/5T or 0.4T. The ratio of the maximum length between transitions to the minimum length between transitions, as referred to in connection with the prior art, is <maths id="math0003" num=""><math display="inline"><mrow><msub><mrow><mtext>3.8 (T</mtext></mrow><mrow><mtext>max</mtext></mrow></msub><msub><mrow><mtext>/T</mtext></mrow><mrow><mtext>min</mtext></mrow></msub><mtext> = 19T/5T)</mtext></mrow></math><img file="EP0625828A2_D0006.tif" /></maths> .

0050In other words, with the present variable length code (4, 18; 2, 5; 6), the minimum length between transitions T_min may be increased to 5T from the minimum length between transitions T_min of the eight to fourteen modulation (EFM), that is the variable length code (2, 10; 8, 17; 1), which is 3T, thus improving the recording density, In addition, the distribution of the minimum length between transitions T_min may be concentrated in the vicinity of 5T, as shown for example in Table 3 and Fig.2. Specifically, as shown in Fig.2, the occurrences of 5T and 6T may be increased by approximately 17% and 14%, respectively, as compared to those in the cases of the variable five modulation (VFM), that is the variable length code (4, 22; 2, 5; 5) referred to in connection with the prior art, such that the mean length between transitions, which is the total number of bits divided by the number of times of transitions, may be decreased to 7.82 from 8.21 for VFM. <tables id="tabl0004" num="0004"><table frame="all"><title>TABLE 3</title><tgroup cols="4" colsep="1" rowsep="0"><colspec colnum="1" colname="col1" colwidth="39.37mm" /><colspec colnum="2" colname="col2" colwidth="39.37mm" /><colspec colnum="3" colname="col3" colwidth="39.37mm" /><colspec colnum="4" colname="col4" colwidth="39.37mm" /><thead valign="top"><row><entry namest="col1" nameend="col1" align="center">length between transitions</entry><entry namest="col2" nameend="col2" align="center">VFM</entry><entry namest="col3" nameend="col3" align="center">(4,18; 2,5; 6)</entry><entry namest="col4" nameend="col4" align="center">(4,19; 2,5; 5)</entry></row></thead><tbody valign="top"><row><entry namest="col1" nameend="col1" align="right">5T</entry><entry namest="col2" nameend="col2" align="right">423</entry><entry namest="col3" nameend="col3" align="right">505</entry><entry namest="col4" nameend="col4" align="right">495</entry></row><row><entry namest="col1" nameend="col1" align="right">6T</entry><entry namest="col2" nameend="col2" align="right">336</entry><entry namest="col3" nameend="col3" align="right">383</entry><entry namest="col4" nameend="col4" align="right">378</entry></row><row><entry namest="col1" nameend="col1" align="right">7T</entry><entry namest="col2" nameend="col2" align="right">292</entry><entry namest="col3" nameend="col3" align="right">312</entry><entry namest="col4" nameend="col4" align="right">314</entry></row><row><entry namest="col1" nameend="col1" align="right">8T</entry><entry namest="col2" nameend="col2" align="right">242</entry><entry namest="col3" nameend="col3" align="right">238</entry><entry namest="col4" nameend="col4" align="right">236</entry></row><row><entry namest="col1" nameend="col1" align="right">9T</entry><entry namest="col2" nameend="col2" align="right">147</entry><entry namest="col3" nameend="col3" align="right">152</entry><entry namest="col4" nameend="col4" align="right">154</entry></row><row><entry namest="col1" nameend="col1" align="right">10T</entry><entry namest="col2" nameend="col2" align="right">132</entry><entry namest="col3" nameend="col3" align="right">125</entry><entry namest="col4" nameend="col4" align="right">126</entry></row><row><entry namest="col1" nameend="col1" align="right">11T</entry><entry namest="col2" nameend="col2" align="right">102</entry><entry namest="col3" nameend="col3" align="right">106</entry><entry namest="col4" nameend="col4" align="right">107</entry></row><row><entry namest="col1" nameend="col1" align="right">12T</entry><entry namest="col2" nameend="col2" align="right">82</entry><entry namest="col3" nameend="col3" align="right">66</entry><entry namest="col4" nameend="col4" align="right">68</entry></row><row><entry namest="col1" nameend="col1" align="right">13T</entry><entry namest="col2" nameend="col2" align="right">61</entry><entry namest="col3" nameend="col3" align="right">63</entry><entry namest="col4" nameend="col4" align="right">63</entry></row><row><entry namest="col1" nameend="col1" align="right">14T</entry><entry namest="col2" nameend="col2" align="right">44</entry><entry namest="col3" nameend="col3" align="right">51</entry><entry namest="col4" nameend="col4" align="right">49</entry></row><row><entry namest="col1" nameend="col1" align="right">15T</entry><entry namest="col2" nameend="col2" align="right">23</entry><entry namest="col3" nameend="col3" align="right">32</entry><entry namest="col4" nameend="col4" align="right">32</entry></row><row><entry namest="col1" nameend="col1" align="right">16T</entry><entry namest="col2" nameend="col2" align="right">23</entry><entry namest="col3" nameend="col3" align="right">20</entry><entry namest="col4" nameend="col4" align="right">22</entry></row><row><entry namest="col1" nameend="col1" align="right">17T</entry><entry namest="col2" nameend="col2" align="right">21</entry><entry namest="col3" nameend="col3" align="right">17</entry><entry namest="col4" nameend="col4" align="right">15</entry></row><row><entry namest="col1" nameend="col1" align="right">18T</entry><entry namest="col2" nameend="col2" align="right">20</entry><entry namest="col3" nameend="col3" align="right">6</entry><entry namest="col4" nameend="col4" align="right">9</entry></row><row><entry namest="col1" nameend="col1" align="right">19T</entry><entry namest="col2" nameend="col2" align="right">12</entry><entry namest="col3" nameend="col3" align="right">2</entry><entry namest="col4" nameend="col4" align="right">2</entry></row><row><entry namest="col1" nameend="col1" align="right">20T</entry><entry namest="col2" nameend="col2" align="right">10</entry><entry namest="col3" nameend="col3" /><entry namest="col4" nameend="col4" align="right">1</entry></row><row><entry namest="col1" nameend="col1" align="right">21T</entry><entry namest="col2" nameend="col2" align="right">4</entry><entry namest="col3" nameend="col3" /><entry namest="col4" nameend="col4" /></row><row><entry namest="col1" nameend="col1" align="right">22T</entry><entry namest="col2" nameend="col2" align="right">2</entry><entry namest="col3" nameend="col3" /><entry namest="col4" nameend="col4" /></row><row rowsep="1"><entry namest="col1" nameend="col1" align="right">23T</entry><entry namest="col2" nameend="col2" align="right">0</entry><entry namest="col3" nameend="col3" /><entry namest="col4" nameend="col4" /></row><row rowsep="1"><entry namest="col1" nameend="col1" align="left">number of times of transitions</entry><entry namest="col2" nameend="col2" align="right">1985</entry><entry namest="col3" nameend="col3" align="right">2078</entry><entry namest="col4" nameend="col4" align="right">2071</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="left">number of bits</entry><entry namest="col2" nameend="col2" align="right">16300</entry><entry namest="col3" nameend="col3" align="right">16255</entry><entry namest="col4" nameend="col4" align="right">16280</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="left">mean length between transitions</entry><entry namest="col2" nameend="col2" align="right">8.21</entry><entry namest="col3" nameend="col3" align="right">7.82</entry><entry namest="col4" nameend="col4" align="right">7.86</entry></row></tbody></tgroup></table></tables>

0051Besides, with the present variable length code (4, 18; 2, 5; 6), the maximum length between transitions T_max may be diminished to 19T, as compared to the maximum length between transitions T_max equal to 5T for VFM having the same value of the minimum length between transitions T_min, thereby simplifying the designing of the apparatus from the aspects of clock reproduction and jitter. Besides, the ratio of the maximum length between transitions to the minimum length between transitions may be diminished to 3.8 as compared to the value of the same ratio of 4.6 for VFM.

0052Also, a may be seen from tables 1 and 2, the conversion tables 14₁ to 14₆ of the variable length code (4, 18; 2, 5; 6) may be rendered smaller than those for VFM.

0053It is noted that, if the bit length of the data string is T₁, the minimum length between transitions T_1min and the maximum length between transitions T_1max, based on the bit length T₁ as a reference, are 2.0T₁ and 7.6T₁, respectively.

0054The modulation method according to the present invention is not limited to the above-described embodiment. For example, the variable length code may also be a variable length code (4, 19; 2, 5; 5) which is inclusive of unfixed bits such as those in unfixed codewords "00*00", "00000 00*00", "00000 00000 00100 00*00" and "00000 00000 00010 000*0" and which is made up of a 2-5, 4-10. 6-15, 8-20 and 10-25 conversion tables. In this case, the minimum length between transitions T_min, the maximum length between transitions T_max, window margin T_w and the ratio of the maximum length between transitions to the minimum length between transitions are equal to 5T (2.0T_i), 20T (8.0T₁), 0.4 and 4.0, respectively, such that the maximum length between transitions T_max and the ratio may be smaller than those for VFM.

0055Table 4 shows another example of the conversion tables, which may be employed in the modulation method according to the present invention. <tables id="tabl0005" num="0005"><img file="EP0625828A2_D0007.tif" /></tables>

0056The other embodiments of the conversion tables applicable for the modulation method according to the present invention are hereinafter explained.

0057Table 5 also shows a conversion table of the variable length code (4, 18; 2, 5; 5), which represents an example in which the size is reduced by employing a large number of unfixed bits *. <tables id="tabl0006" num="0006"><img file="EP0625828A2_D0008.tif" /></tables>

0058Table 6 shows a conversion table for the variable length code (4, 19; 2, 5; 6). Although the size is enlarged as compared to those shown in tables 2 and 4, the number of unfixed bits * is diminished to avoid complexity of operation in order to achieve a more favorable hardware configuration. <tables id="tabl0007" num="0007"><img file="EP0625828A2_D0009.tif" /></tables><tables id="tabl0008" num="0008"><img file="EP0625828A2_D0010.tif" /></tables>

0059Table 7 shows a conversion table for the variable length code (4, 20; 2, 5; 5). Although T_max becomes larger than that with the other codes, the size may be reduced. <tables id="tabl0009" num="0009"><img file="EP0625828A2_D0011.tif" /></tables>

0060The modulation apparatus is hereinafter explained.

0061The present demodulation apparatus includes an unfixed codeword detection circuit 21 for detecting a codeword including an unfixed bit from the variable length code (d, k; m, n; r) having a minimum run <u>d</u> of 4 and a basic codeword length of <u>n</u> bits, with the unfixed bit being at a preset Position as determined by the number of "0"s consecutive to the preset bit position, and constraint length determining circuits 22a, 22b, for determining the constraint length <u>i</u> of the variable length code based upon the results of detection by the unfixed codeword detection circuit 21. The apparatus also includes inverse conversion tables 24a_i, 24b_i for inverse conversion of the n × i bits of the variable length code into m × i data, where i = 1 to r, and selectors 23a, 23b for selecting the inverse conversion tables 24a_i, 24b_i based upon the constraint length <u>i</u> from the constraint length determining circuits 22a, 22b and supplying the n × i bit variable length codewords to the selected inverse conversion tables 24a_i, 24b_i. The apparatus also includes multiplexors 25a, 25b for commutatively selecting data from the inverse conversion tables 24a_i, 24b_i and outputting the selected data as serial data, and a buffer memory 26 for transiently storing data from the multiplexors 25a and 25b and outputting the stored data as playback data. Finally, the apparatus includes a phase locked loop (PLL) 27 for reproducing clocks based upon the variable length code and supplying the clocks to the buffer memory 26.

0062Assuming that the variable length code (d, k; m, n; r) is the variable length code (4, 19; 2, 5; 5) in which the minimum run <u>d</u> is 4 bits, the maximum run <u>k</u> is 19 bits, the basic data length <u>m</u> is 2 bits, the basic codeword length <u>n</u> is 5 bits and the maximum constraint length <u>r</u> is 5, the inverse conversion tables 24a_i, 24b₁ on the whole are inverse conversion tables corresponding to the 2-5 conversion tables shown in table 4, that is inverse conversion tables each having a constraint length <u>i</u> equal to 1 and adapted for converting a 5-bit codeword into 2-bit data, referred to hereinafter as 5-2 conversion talbes. Of these inverse conversion tables, the inverse conversion table 24a₁ are those tables for codewords liable to become unfixed codewords, that is codewords in which five bits as counted form the MSB are "00000" or "00100", whereas the inverse conversion tables 24b₁ are those tables for other codewords, that is codewords in which five bits as counted from the MSB are "10000" or "01000".

0063On the other hand, the inverse conversion tables 24a₂, 24b₂ on the whole are inverse conversion tables corresponding to the 4-10 conversion tables shown in 4, that is inverse conversion tables each having a constraint length <u>i</u> equal to 2 and adapted for converting a 10-bit codeword into 4-bit data, referred to hereinafter as 10-4 inverse conversion tables. Of these inverse conversion tables, the inverse conversion tables 24a₂ are those tables for codewords liable to become unfixed codewords, that is codewords in which five bits as counted from the MSB are "00000", "00001", whereas the inverse conversion tables 24b₂ are those tables for other codewords, that is codewords in which five bits as counted from the MSB are "00010, "00001".

0064In a similar manner, the inverse conversion tables 24a₃, 24b₃ comprise 15-6 inverse conversion tables having a constraint length <u>i</u> equal to 3 and adapted for converting 15-bit codewords into 6-bit data, while the inverse conversion tables 24a₄, 24b₄ comprise 20-8 inverse conversion tables having a constraint length <u>i</u> equal to 4 and adapted for converting 20-bit codewords into 8-bit data, and the inverse conversion tables 24a₅, 24b₅ comprise 25-10 inverse conversion tables having a constraint length <u>i</u> equal to 5 and adapted for converting 25-bit codewords into 10-bit data.

0065Referring to Fig.3, the unfixed bit detection circuit 21 is made up an unfixed pattern detection circuit 21a for detecting a 5-bit pattern including an unfixed bit, referred to hereinafter as an unfixed pattern, and an unfixed codeword decision circuit 21b for detecting the unfixed codeword based upon the results of detection from the unfixed pattern detection circuit 21a, These circuits are fed with variable length codewords corresponding to the data reproduced from the recording medium and subsequently processed with NRZI demodulation, error correction or the like.

0066The unfixed pattern detection circuit 21a detects the unfixed patterns based upon a group of 5 bits from the leading end as a unit of detection. Specifically, there are two patterns likely to become the unfixed patterns, that is patterns "00000" and "00100". The detection circuit 21a detects these patterns "00000" and "00100" and route the results of detection to the unfixed codeword discrimination circuit 21b.

0067When the unfixed codeword discrimination circuit 21b detects the pattern "00100", it determines the pattern to be an unfixed codeword "00*00". When the discrimination circuit detects the pattern "00000", it combines the pattern with the next 5-bit pattern to produce a 10-bit pattern and checks if the 10-bit pattern corresponds to patterns "00000 10000", "00000 01000" or "00000 00100". If the 10-bit pattern corresponds to the patterns "00000 10000" or "00000 01000", the discrimination circuit determines the first 5-bit pattern "00000" to be an unfixed codeword "00*00". If the 10-bit pattern corresponds to the pattern "00000 00100", the discrimination circuit determines the 10-bit pattern "00000 00100" to be an unfixed codeword "00000 00*00".

0068In a similar manner, the discrimination circuit 21b detects unfixed codewords, such as "00000 00000 00100 00*00" or "00000 00000 00010 000*0" as it appends 5 bits each time, and routes the results of detection of the unfixed codeword to the constraint length decision circuits 22a, 22b.

0069Based upon the results of detection of the unfixed codewords, supplied from the unfixed codeword discrimination circuit 21b, the constraint length discrimination circuits 22a and 22b determine the constraint length <u>i</u> of the unfixed codeword and the constraint length <u>i</u> of the codewords other than the unfixed codewords, respectively.

0070Based upon the constraint length <u>i</u> from the constraint length discrimination circuits 22a, 22b, the selectors 23a, 23b select the inverse conversion tables 24a_i, 24b_i and routes n × i bit variable length codewords to the thus selected inverse conversion tables 24a_i, 24b_i.

0071Specifically, when i = 1, for example, the selector 23a selects the inverse conversion 24a₁ and routes 5-bit codewords "00000" or "00100" to the thus selected inverse conversion table 24a₁, while the selector 23b selects the inverse conversion table 24b₁ and routes 5-bit codewords "10000" or "01000" to the thus selected inverse conversion table 24b₁.

0072On the other hand, when i = 2, for example, the selector 23a selects the inverse conversion table 24a₂ and routes 10-bit codewords "00000 00000" or "00000 00100" to the thus selected inverse conversion table 24a₂, while the selector 23b selects the inverse conversion table 24b₂ and routes 10-bit codewords "00010 00000" or "00001 00000" to the thus selected inverse conversion table 24b₂.

0073In a similar manner, when the constraint length <u>i</u> is 3 to 5, the selectors 23a, 23b select the inverse conversion tables 24a₃ to 24a₅ and 24b₃ to 24b₅ and routes 15 to 25 bit codewords to the selected inverse conversion tables 24a₃ to 24a₅ and 24b₃ to 24b₅.

0074The inverse conversion tables 24a₁ to 24a₅ and 24b₁ to 24b₅ each have a 5-2, 10-4, 15-6, 20-8 and 25-10 inverse conversion tables, and read out data of the data portions shown in 4, using the codewords from the selectors 23a and 23b as the readout addresses.

0075The result is that, for the codewords "10000", "01000" and "00*00", the inverse conversion table 24b₁ outputs data "11" and "10", while the inverse conversion table 24a₁ outputs data "01".

0076For the codewords "00010 00000", "00001 00000" and "00000 00*00", the inverse conversion table 24b₂ outputs data "0011" and "0010", while the inverse conversion table 24a₂ outputs data "1011".

0077For the codewords "00010 00010 00000", "00010 00001 00000" ^... "00000 00001 00000", the inverse conversion table 24b₃ outputs data "000111", "000110" ^... "000011".

0078For the codewords "00010 00010 00010 00000", "00010 00010 00001 00000" ^... "00000 00000 00010 00*00", the inverse conversion table 24b₄ outputs data "00001011", "00001010", ^... "00000101", while the inverse conversion table 24a₄ outputs data "00000100" and "00000011".

0079For the codewords "00010 00010 00010 00010 00000", "00010 00010 00010 00001 00000" ^... "00000 00000 00010 00001 00000", the inverse conversion table 24b₅ outputs data "0000001101", "0000001010", ^... "0000000000".

0080That is, 2 × i bit data, as inverse converted from 5 × i bit variable length codewords, are outputted from these inverse conversion tables 24a₁ to 24a₅ and 24b₁ to 24b₅ and routed to the multiplexors 25a and 25b.

0081The multiplexors 25a and 25b multiplex the data routed from the inverse conversion tables 24a₁ to 24a₅ and 24b₁ to 24b₅ and transmit the resulting data as serial data to the buffer memory 26.

0082On the other hand, the PLL 27 reproduces clocks based upon the variable length codewords, and transmits the reproduced clocks to the buffer memory 26.

0083The buffer memory 26 transiently stores data supplied thereto from the multiplexors 25a, 25b and outputs the stored data at a preset rate as playback data in a timed relation to the clocks supplied thereto from the PLL 27. These output data are processed with, for example, with inverse DCT, predictive decoding or the like, for reproducing video signals.

0084With the present demodulation apparatus, the variable length code including an unfixed codeword into data may be demodulated into data by detecting the codeword having the unfixed bit, determining the constraint length <u>i</u> of the codeword of the variable length code based upon the results of detection, and inverse-converting the codeword into data based upon the constraint length <u>i</u> with the aid of the inverse conversion tables of inverse converting the n × i bit variable length code into m × i bit data. With the present demodulating apparatus, similarly to the modulation apparatus, the inverse conversion tables 24a₁ to 24a₅ and 24b₁ to 24b₅ and hence the circuit size may be reduced in size as compared to those of the VFM. In addition, since the maximum length between transitions T_max may be diminished as compared to that of VFM, the PLL 27 may be improved in reliability.