Coded data generation or conversion – Digital code to digital code converters – To or from minimum d.c. level codes
Reexamination Certificate
2001-08-28
2002-12-10
Young, Brian (Department: 2819)
Coded data generation or conversion
Digital code to digital code converters
To or from minimum d.c. level codes
C341S068000, C341S069000, C341S059000, C369S013010, C369S053130, C369S059160
Reexamination Certificate
active
06492915
ABSTRACT:
BACKGROUND OF THE INVENTION
The present invention relates to a method of recording and reproducing information in and from an optical disk such as a DVD, and more particularly to run-length limited codes suitable for high integration.
For a conventional optical disk drive, user data is changed to RLL (run-length limited) codes which are NRZI modulated to be converted into two-value data of “1” and “−1”. This data of “1” and “−1” is assigned a mark and a non-mark which are then written in a medium.
Famous run-length limited codes for optical disks are EFM codes (U.S. Pat. No. 4,501,000) for DVD and EFMPlus codes (U.S. Pat. No. 5,696,505) for DVD. EFM and EFMPlus codes are (d, k) RLL (run-length limited) codes where d=2 and k=10. The minimum value of the number of 0's inserted between 1 and 1 of the run-length limited codes is represented by d=2, whereas the maximum value thereof is represented by k=10. With the NRZI modulation, the sign of a run-length limited code “
1
” is inverted as 1→−1 and −1→1, whereas the sign of a run-length limited code “
0
” is remained unchanged. Therefore, d+1 is the length of a shortest mark or non-mark. Namely, the length of the shortest mark or non-mark of the EFM code or EFMPlus code is 3 bits.
Under such background, if the length d of the shortest mark is shortened, a conversion ratio m:n of user data to run-length limited codes becomes small, which broadens a detection window and is advantageous in terms of jitters. However, since the shortest mark of an optical disk is set to have a shape like a circle, as the length of the mark becomes short, the width of the mark becomes narrow. It arises therefore the problem that a signal amplitude corresponding to the minimum size of a mark becomes low in proportion to the square of the mark length. For example, if user data is written at the same density, a (
1
,
7
) code of d=1 has a conversion ratio of 2:3 and a (
2
,
7
) code of d=2 has a conversion ratio of 1:2. However, since (
1
,
7
) code : (
2
,
7
) code=8:9, the (
1
,
7
) code is shorter by 8/9 than the (
2
,
7
) code. Since the signal amplitude is proportional to the square of the mark length, (
1
,
7
) code : (
2
,
7
) code=64:81 so the signal amplitude of the (
1
,
7
) code becomes about 3/4 of that of the (
2
,
7
) code. As the signal amplitude becomes small, an S/N ratio lowers so that errors are likely to occur, which poses the problem that it is impossible to lower the conversion ratio by reducing d and broaden the detection window.
SUMMARY OF THE INVENTION
In order to solve this problem, this invention provides modulation codes in which the shortest length of the mark and the shortest length of the non-mark are set asymmetrically and the length of the mark is set to 3 bits or longer.
A comparison table between modulation codes of the invention and conventional modulation codes is shown in Table 1.
TABLE 1
Comparison modulation code
Modulation
(1, 7)
(2, 10)
8-14
8-15
code
modulation code
modulation code
Asymmetric code
Asymmetric code
User bit
n
2
8
8
8
Channel bit
m
3
16
14
15
Detection
Tw
2T/3 = 0.66T
8T/16 = 0.5T
8T/14 = 0.571T
8T/15 = 0.533T
window
ns
16
12
14
13
Lowest
fmin
3/(32T) = 0.09375/T
1/(11T) = 0.091/T
14/(8*2*13T) = 0.0673/T
15/(8*2*16T) = 0.0586/T
frequency
MHZ
3.87
3.75
2.78
2.42
Highest
fmax
3/(8T) = 0.375/T
1/(3T) = 0.33/T
2T:1/4Tw, 3T:1/6Tw
2T:1/4Tw, 3T:1/6Tw
frequency
MHZ
15.5
13.6
18/12
19.3/12.9
Number of
7
9
???
???
pattern
Shortest mark
Tmin M
4T/3 = 1.33T
3T/2 = 1.5T
24T/14 = 1.714T
24T/15 = 1.6T
length
2Tw
3Tw
3Tw
3Tw
ns
32
36
42
39
Shortest gap
Tmin S
4T/3 = 1.33T
3T/2 = 1.5T
16T/14 = 1.14T
16T/15 = 1.06T
length
2Tw
3Tw
2Tw
2Tw
ns
32
36
28
26
Average of
Tmin
4T/3 = 1.33T
3T/2 = 1.5T
10T/7
4T/3
Shortest mark
ave
2Tw
3Tw
2.5Tw
2.5Tw
and gap
ns
32
36
35
32
Longest mark
Tmax
16T/3 = 5.33T
11T/2
104T/14 = 7.42T
124T/15 = 8.55T
length
8Tw
11Tw
13Tw
16Tw
ns
129
133
180
207
Clock
fc
3/(2T) = 1.5T
2/T
14/(8T) = 1.75/T
15/(8T) = 1.875/T
frequency
MHz
61.9
82.5
72.2
77.3
T[ns] = 24
If the user bit time T is made equal, although conventional (
1
,
7
) modulation codes have a detection window width Tw broader than (
2
,
10
) modulation codes, there is the problem that the shortest mark length (shortest gap length) is short and a sufficient amplitude cannot be obtained. On the other hand, (
2
,
10
) modulation codes have a shortest mark length (shortest gap length) longer than (
1
,
7
) modulation codes, and the detection window width Tw is narrower.
Asymmetric codes of the invention have the shortest mark length longer than conventional (
1
,
7
) and (
2
,
10
) modulation codes and an intermediate detection window width between both modulation codes. However, since the shortest gap is shorter than (
1
,
7
) modulation codes, modulation codes of the invention is associated with the problem that if a conventional method of directly slicing a detected waveform is used, a sufficient amplitude cannot be obtained from the shortest non-mark and the edge cannot be detected. An average interval of shortest marks (gaps) is approximately that of conventional modulation codes, as shown in Table 1. The average interval of shortest marks of asymmetric codes, particularly (8-14) asymmetric codes, is approximately that of (
2
,
10
) modulation codes having a longest interval and the detection window width is broadened. From these re a sons, the invention provides an approach to enabling to write the shortest mark shorter and the shortest gap longer and detect asymmetric codes.
FIG. 1
shows the position relation between shortest marks and gaps of a combination pattern written in a disk.
In
FIG. 1
, modulation codes obtained by converting n user bits into m channel bits are represented by n-m modulation codes.
FIG. 1
shows the relation between a user bit interval T and each channel bit interval, by taking as examples conventional
8
-
16
modulation codes and
2
-
3
modulation codes (which are (
1
,
7
) modulation codes presently used widely) and
8
-
15
asymmetric codes and
8
-
14
asymmetric codes. In the upper area of asymmetric codes, the layout of marks formed by writing modulation codes themselves is shown, and in the lower area, marks before write compensation are shown by broken lines and marks after write compensation are shown by solid lines. According to the invention, when data of asymmetric codes is written, all the marks are recorded shorter, for example, as shown in
FIG. 1
, by about 0.5 Tw in order to make the shortest marks and gaps have an equal interval. In this manner, even a combination of the shortest mark and gap forms a write mark and a write gap each having a length of 2.5 Tw. A sufficient signal amplitude for the shortest gap can be obtained similar to conventional (
2
,
10
) modulation codes so that front and rear edges can be detected reliably. Since the detection window width is broader than conventional (
2
,
10
) modulation codes, the reliability of data detection can be improved. As compared to conventional (
1
,
7
) modulation codes, although the detection window width is not broader, the reproduction signal amplitudes for the shortest mark and gap are high so that the reliability of data signal detection is excellent.
A first reproduction method is to separately detect the positions of front and rear edges of a mark. With reference to
FIG. 4
, a read head in relative motion along a track reads an analog signal corresponding to data recorded in a track
1
. A quantized signal such as indicated in (c) is obtained from the read analog signal by using a proper threshold value
4
. The analog signal indicated in (b) has an amplitude, waveform and the like which are considerably changed in accordance with the read/write conditions. It is known that at
Katayama Yukari
Maeda Takeshi
Minemura Hiroyuki
Nguyen John B
Young Brian
LandOfFree
Method for recording information, method for reproducing... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for recording information, method for reproducing..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for recording information, method for reproducing... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2996405