Data recording method and data recording apparatus

Abstract: In recording information by shifting the positions of the front edge and the rear edge of each pit on a medium stepwise from specified reference positions according to recording data, the edges of each pit are displaced stepwise with a unit of macro-step of 0.04 µm, to express the data. The positions of the edges with macro-step are further adjusted to be displaced stepwise with a unit of micro-step of 256 kinds, thus suppressing the Inter Symbol Interference. With this adjustment, it is possible to reduce the influence of the Inter Symbol Interference, and hence to perform the recording with high density.

Description: BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data recording method and a data recording apparatus. 2. Description of the Related Art The present inventor has proposed a technique of displacing the position of the edge of each pit stepwise according to recording data, for example, in Unexamined Japanese Patent No. HEI 4-207074 and International Application No. PCT/JP92/01250. Namely, as shown in Fig. 17, each of the positions of edges b n-1 , a n , b n , and a n-1 of pits is displaced to either of the positions of from 0 to 7 according to recording data. Further, as shown in Fig. 17, the level of the reproduced signal from an optical pick-up for detecting a reflection light from each pit is subjected to sample-and-hold with a timing of a rising edge of a clock A or a clock B to be analog-digital converted, so that it is possible to judge what position the edge is disposed among the position of from 0 to 7. Assuming that the value obtained by sampling and analog-digital converting the reproduced signal from the edge a n is taken as Va(n) and the value obtained by sampling and analog-digital converting the reproduced signal from the edge b n is taken as Vb(n), the values Va(n) and Vb(n) are expressed on XY coordinate axes as shown in Fig. 18. As the positions of the edges a n and b n are displaced into the positions of from 0 to 7, the points (information points) specified by the reproduced values Va(n) and Vb(n) are ideally positioned at the points (grids) where dotted lines are crossed to each other in Fig. 18. In practice, however, the edge b n interferes with the reproduced signal from the edge a n , or the edge a n interferes with the reproduced signal from the edge b n . As a result, the positions of the information points (in Fig. 18, shown as black dots) specified by the level of the actual reproduced signals are deviated from the grids. For this reason, in the previous application described above, under consideration of the deviation of the information point from the grid, the present inventor has proposed such a technique that, the position of the information point (position of the edge) on the coordinate axes is read-out as the position on the coordinate plane. As described above, in the previous proposal technique, only the I. S. I (Inter Symbol Interference) between two edges has been examined; however, actually, there occurs the I. S. I between three or more edges. As a result, as shown in Fig. 19, the area of each information point on the coordinate axes is broadened, and the boundary between the adjacent information points is made obscure, which makes it difficult to discriminate each information point. (Namely, it is difficult to enhance the recording density). EP 0 477 892 A2 discloses a data recording method and a data recording apparatus, wherein a record signal associated with the data is collated with patterns in a table in the unit of n patterns so as to determine a pattern matching with the record signal. For the obtained pattern, the last edge thereof is corrected depending on the data stored in the table. The table is thereby obtained in the following manner. First, a comparison is made between the record signal and a read-out signal. Based on the comparison, a laser power is varied in a step-wise manner to record a first record pattern. Then, the read-out signal and the record signal are compared again to determine a second record pattern which is recorded N times. In the read-out signal of the second pattern, the second record pattern is further classified into a third pattern. For each of the third patterns, an ideal edge position associated with the record signal as compared with an edge position thereof. The results of this comparison are then loaded in a table, which is stored in the memory. For single patterns, which are not recognised as a third pattern, corresponding results are obtained through an interpolation. In this disclosed correction method, only the very first step is made in step-wise manner. Second and third patterns are determined straight ahead on the basis of the first pattern. The actual correction of a record signal is made by a simple comparison of the patterns into table with a record signal. The comparison is made between a predetermined reference table, which contains correction values for the record data. Therefore, the correction method for the data recording method and the data recording apparatus disclosed in EP 0 477 892 A2 is complicated and requires many complicated circuit elements. The object of the present invention is therefore to provide a method for recording data according to the preamble of claim 1 and a apparatus for recording data according to the preamble of claim 3, which provide a more simple but precise data recording system, in which the influence of the symbol interference is suppressed and the recording density is enhanced. This object is achieved by a method for recording data according to claim 1 and an apparatus for recording data according to claim 3. Advantageous features are defined in the corresponding subclaims 2 and 4. According to a first aspect, there is provided a data recording method comprising the steps of: displacing the position of the edge of each pit stepwise with a unit of a macro-step as a first width according to the data to be recorded: and displacing the position of the edge specified by the macro-step, at a position where the interference due to the positions of the other edges is minimized, stepwise with micro-step as a second width smaller than the macro-step. Preferably, the adjustment for the position of the edge with micro-step is performed in consideration of the positions of at least two adjacent edges or the positions of at least four continuous edges. Further, this adjustment may be performed using a line spread function or a Hopkins' method. Further, the adjustment for the position of the edge with micro-step may be performed in such a manner that the information point specified by the positions of the adjacent two edges is positioned at a grid on coordinate axes specified by the positions of the adjacent two edges. The adjustment may be performed in such a manner that the area of the information is made smaller on the coordinate axes. In addition, the adjustment may be performed in such a manner that, on second coordinate axes specified by the positions of the other edges positioned on the front and rear sides of the adjacent two edges specifying the coordinate axes, the information point is concentrated at the intermediate position. According to a second aspect, there is provided a data recording apparatus for recording data on a recording medium by displacing the position of the edge of each pit stepwise with macro-step, comprising: a conversion circuit 3 as a converting means for converting data corresponding to the number of steps changed with macro-step; a recording edge position calculating circuit 9 as a calculating means for calculating the position of the edge displaced with macro-step according to the data converted by the converting circuit 3, and displacing the position of the edge specified by the macro-step stepwise with micro-step smaller than the macro-step for calculating a position where the interference due to the position of the other edges is minimized; and an edge modulation circuit 10 as a signal generating means for outputting a signal with a timing corresponding to the position of the edge of each pit according to the output from the recording edge position calculating circuit 9. Preferably, the edge modulation circuit 10 includes a D/A converter 31 as a D/A converting means for digital-analog converting the output of the recording edge position calculating circuit 9; a sawtooth wave generating circuit 33 as a sawtooth wave generating means for generating a sawtooth wave; and an analog comparator 32 as a comparing means for comparing the sawtooth wave outputted from the sawtooth wave generating circuit 33 with the output of the D/A converter 31. In the data recording method according to the first aspect, the position of the edge specified by macro-step is further finely displaced stepwise with micro-step. Accordingly, the data is recorded in such a state that the inter symbol interference is suppressed. In the recording apparatus according to the second aspect, the position of the edge displaced with macro-step according to recording data is calculated by the recording edge position calculating circuit 9, and the position is further finely displaced with micro-step. Accordingly, it is possible to record the data on the recording medium with high density. BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 is a block diagram showing the construction of a data recording apparatus of the present invention; Fig. 2 is a block diagram showing the construction of a recording edge position calculating circuit in Fig. 1; Fig. 3 is a block diagram showing the construction of an edge modulation circuit in Fig. 1; Fig. 4 is a timing chart for explaining the operation of the embodiment as shown in Fig. 3; Fig. 5 is a view for explaining pits recorded in a disk of Fig. 1; Fig. 6 is a view for explaining the relationship between the macro-step and the micro-step; Fig. 7 is a view for explaining a principle of adjusting the position of the edge expressed by macro-step to be disposed at the position of the edge expressed by micro-step using a line spread function; Fig. 8 is a view for explaining the state of information points in the case that the correction in Fig. 7 is not carried out; Fig. 9 is a view for explaining the state of information points in the case that the correction in Fig. 7 is carried out; Figs. 10A and 10B are views for explaining the relationship between the information point and the grid; Figs. 11A and 11B are flow charts for explaining the processes for calculating the edge position to be corrected for positioning the information point at the grid; Fig. 12 is a view for explaining the state where the information points are scattered; Fig. 13A and 13B are flow charts for explaining the processes for calculating the edge position for concentrating the information point at a specified point; Fig. 14 is a view for explaining the state of the information points obtained by executing the processes as shown in Figs. 10A and 10B; Fig. 15 is a view for explaining the state of the information points obtained by executing the processes as shown in Figs. 13A and 13B; Fig. 16 is a view for explaining the state of the information points in the case that the processes in Figs. 11A and 11B, and Figs. 13A and 13B are not executed for comparison with Figs. 14 and 15; Fig. 17 is a view for explaining the principle of displacing the edges of pits on a medium stepwise for recording the information; Fig. 18 is a view for explaining the principle wherein two edge positions are read out as the information points on a coordinate plane; and Fig. 19 is a view for explaining the diffusion of the information points. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT Hereinafter, embodiments of the present invention will be described with reference to the accompanying drawings. Fig. 1 is a block diagram showing the construction of one embodiment of a data recording apparatus of the present invention. An information source 1 outputs a signal to be recorded, for example, a digitized recording signal. An ECC circuit 2 adds an error detection and correction code to the digital audio data supplied from the information circuit 1, and outputs the data to a conversion circuit 3. The conversion circuit 3 converts the inputted data into the data with an unit of 3bit. Namely, in this embodiment, the position of each edge is set at either of the eight positions of from 0 to 7. Accordingly, for specifying the position of each edge, 3 bit data are required. In the conversion circuit 3, the 3 bit data are produced. A clock information generating circuit 5 generates the data required for producing a clock necessary for reading out the data recorded in a disk. A bias gain information generating circuit 6 generates the data indicating a bias point (the data indicating a reference point (0, 0), that is, the data indicating that the positions of the edges a n and b n are both 0); and the data indicating the data for setting a gain (the data indicating a reference point (7, 7), that is, the data indicating that the positions a n and b n are both 7). A PLL drawing signal circuit 7 generates a signal for drawing PLL. An education data generating circuit 8 generates the data wherein the edge position (a n , b n ) corresponds to each of the edge positions of from (0, 0) to (7, 7). The Data outputted from these clock information generating circuit 5, bias gain information generating circuit 6, PLL drawing signal generating circuit 7 and education data generating circuit 8 are supplied to an adder 4, in which the above data are added with the data supplied from the conversion circuit 3 (subjected to time-division multiplexing). The output of the adder 4 is supplied to a recording edge position calculating circuit 9, and the output of the recording edge position calculating circuit 9 is supplied to an edge modulation circuit 10. The output of the edge modulation circuit 10 is supplied to a mastering apparatus 11, wherein cutting, development, plating, transfer, aluminum deposition, protective film coating are performed, thus forming a disk 12. Next, the operation will be described. The audio data outputted from the information source 1 are supplied to the ECC circuit 2, being added with an error detection and correction code, and are then supplied to the conversion circuit 3. The conversion circuit 3 converts the inputted data into the data with a unit of 3 bit. The 3 bit data specify the position of the edge of each pit at either of the eight positions of from 0 to 7. The 3 bit data outputted from the conversion circuit 3 are supplied to the recording edge position calculating circuit 9 through the adder 4. The recording edge position calculating circuit 9, as described later, corrects the 3 bit data corresponding each edge position into 256 kinds of fine positions for correcting inter symbol interference. Namely, in the recording edge position calculating circuit 9, the position of the edge basically displaced with eight kinds of steps (macro-step) is steppedly (micro-step) corrected to be positioned at one of 256 kinds of edge positions. Namely, in the recording edge position calculating circuit 9, the original position is corrected to be disposed at the position where the inter symbol interference is made as small as possible. The edge modulation circuit 10 generates the pulse with the timing corresponding to the data outputted from the recording edge position calculating circuit 9, and outputs the pulse to the mastering apparatus 11. The mastering apparatus 11 cuts an original disk in synchronization with the timing signal supplied from the edge modulation circuit 10. The original disk thus cut is developed, followed by plating, to produce a stamper. The pits formed with the stamper are transferred on a replica. The replica is applied with aluminum deposition, and is coated with a protective film. Thus, a lot of disks 12 are mass-produced. In addition, the adder 4 is supplied with the data outputted from the clock information generating circuit 5, bias gain information generating circuit 6, PLL drawing signal generating circuit 7 and education data generating circuit 8. Accordingly, pits corresponding to these data are formed on the disk 12. Fig. 2 shows the construction of the recording edge position calculating circuit 9. In this embodiment, the 3 bit data supplied from the adder 4 are sequentially supplied to four-stepped flip-flops 21 to 24. The outputs of the flip-flops 21 to 24 are each supplied to an ROM 25. The ROM 25 outputs 8bit data Da and 8 bit data Db corresponding to two edge positions. Namely, the 3 bit input data are sequentially delayed by the flip-flops 21 to 24; accordingly, when the flip-flop 23 outputs the data of the rear edge a n of the n-th pit and the flip-flop 22 outputs the data of the front edge b n of the (n+1) -th pit, the flip-flop 24 outputs the data of the front edge b n-1 of the n-th pit and the flip-flop 21 outputs the data of the rear edge a n+1 of the (n+1)-th pit (see Fig. 5). Thus, the data corresponding to the four continuous edges of the two continuous pits are inputted in the ROM 25. The ROM 25 receives the input of the data corresponding to the macro-stepwise positions of the four edges, and calculates the data Da corresponding to the edge a n and the data Db corresponding to the edge b n in order that the inter symbol interference from each edge is minimized, and outputs these data Da and Db. These Da and Db are each output as the 8bit data. Namely, the ROM 25 converts the data expressed by the macro-steps into the data expressed (finely corrected) by the micro-steps of 256 kinds, and outputs the data. The content of the converting table of this ROM 25 will be described later. Fig. 3 shows the construction of the edge modulation circuit 10 in Fig. 1. In this embodiment, the 8 bit data Da outputted from the ROM 25 are delayed by a delay circuit including a D/A converter 31, an analog comparator 32 and a sawtooth wave generating circuit 33, and are supplied to one of input terminals of an OR-gate 37. Similarly, the 8 bit data Db outputted from the ROM 25 are delayed by a delay circuit including a D/A converter 34, an analog comparator 35 and a sawtooth wave generating circuit 36, and are then supplied to the other input terminal of the OR-gate 37. The output of the OR-gate 37 is supplied to a mastering apparatus 11 as recording pulses through a T-type flip-flop 38. Next, the operation of the embodiment in Fig. 3 will be described with reference to the timing chart of Fig. 4. The 8 bit data Da corresponding to the edge a n outputted from the ROM 25 [Fig. 4(a)] is inputted in the D/A converter 31 to be digital-analog converted. The output of the D/A converter 31 is supplied to a non-reversal input terminal of the analog-comparator 32. A sawtooth wave signal periodically outputted from the sawtooth wave generating circuit 33 [Fig. 4(b)] is supplied in the reversal input terminal of the analog-comparator 32. The analog-comparator 32 compares the level of the signal inputted from the D/A converter 31 (this level corresponds to the position of the edge a n ) with the level of the sawtooth wave signal outputted from the sawtooth wave generating circuit 33. When the former is larger than the latter, the analog-comparator 32 outputs a logic H; and when being smaller, it outputs a logic L. As a result, in the output of the analog-comparator 32 [Fig. 4(c)], the timing of the rising edge is changed according to the data Da (namely, changed in 256 kinds). On the other hand, similarly, the D/A converter 34 digital-analog converts the data Db corresponding to the edge b n outputted from the ROM 25 [Fig. 4(d)], and supplies the converted data to the non-reversal input terminal of the analog-comparator 35. A sawtooth wave signal periodically outputted from the sawtooth wave generating circuit 36 [Fig. 4(e)] is supplied in the reversal input terminal of the analog-comparator 35. The analog-comparator 35 compares the levels of both the inputs with each other. When the output from the D/A converter 34 is larger than the sawtooth wave signal outputted from the sawtooth wave generating circuit 36, the analog-comparator outputs a logic H; and when being smaller, it outputs a logic L [Fig. 4(f)]. Namely, the timing of the rising edge in the pulse outputted from the analog-comparator 35 is changed in 256 kinds according to the data Db. The OR-gate 37 supplies the pulses outputted from the analog-comparators 32 and 35 to a trigger terminal of the T-type flip-flop 38 [Fig. 4(g)]. The T-type flip-flop 38 is triggered at the rising edge of the output of the OR-gate 37 [Fig. 3(g)], to reverse the logic of the output pulse for each trigger [Fig. 4(h)]. As a result, in the output of the T-type flip-flop 38 [Fig. 4(h)], the rising edge is changed according to the position of the edge a n , and tailing edge is changed according to the position of the edge b n . The position of the edge is defined as one of the positions of 256 kinds. Thus, the recording pulses outputted from the T-type flip-flop 38 are supplied to the mastering apparatus 11, wherein the original disk is cut, thus producing the disk 12. The disk 12 thus obtained is formed with the pits as shown in Fig. 5. Next, the example of the converting table stored in the ROM 25 will be described. As shown in Fig. 5, it is assumed that the basic step (serration) of the edge of each pit stored in the disk 12 is taken as 0.04 µm. Namely, as the position of the edge of each pit is displaced from 1 to 7, the position of the edge is basically changed by 0.04 µm. In other words, it is assumed that the macro-step is taken as 0.04 µm. Further, assuming that, every time when the output of the D/A converters 31 and 34 are changed by one step, the position of the edge of each pit is changed by about 1.67nm (namely, one micro-step is taken as 1.67nm), one macro-step corresponds to 24 (= 0.04 µm/1.6nm) micro-steps. When the linear velocity of the disk 12 is taken as 1.2m/s and the minimum length of the pit (the length of the pit wherein the positions of the front and rear edges are both 0) is taken as 0.53 µm, the width of the recording width is 440ns, the length of one macro-step is 40nm (= 0.04 µm), and the length of one micro-step is 1.67nm (Fig. 6). In the case that the influence by the edges b n-1 and a n+1 is not considered, the data Da and Db can be calculated by the following equation: Da = 24 × a n + Ca Db = 24 × (-b n ) + Cb where Ca and Cb are constants. Next, there will be examined the cancellation of the influence of the edge b n-1 on the reproduced value Va(n) of the edge a n . Assuming that the transmitting characteristic of the optical pickup of the reproducing system is linear, MTF (Modulation Transfer Function) being the absolute value of OTF (Optical Transfer Function) of the reproducing system is subjected to inverted Fourier conversion, to obtain a line spread function h(X). Fig. 7 shows the line spread function. The influence of the edge b n-1 on the reproduced value Va(n) is proportion to the amplitude of the bottom portion of the line spread function in Fig. 7. Namely, the correction value of the table stored in the ROM 25 can be calculated by the ratio (h 2 /h 1 ) between the height h 1 of the portion corresponding to the edge a n (central portion of the line spread function in Fig. 7) and the height h 2 corresponding to the edge b n-1 . In addition, the line spread function is disclosed in [S. Kubota: "Aplanatic condition required to produce jitter-free signals in an optical digital disk system"; APPLIED OPTICS/Vol. 26, N. 18/p. 3961-3972 (Fig. 13 etc.)/September 1987 ]. When the distance between pits is 1.67 µm, the wavelength of a laser is 780nm, and NA of an object lens is 0.45, the correction value S (b n-1 ) is calculated as Table 1. recording data just before correction value b n-1 S (b n-1) 0 0 1 2 2 3 3 4 4 5 5 6 6 7 7 8 Since the influence of the edge a n+1 on the data Db is the same as described above, the correction S (a n+1 ) is calculated as shown in Table 2. recording data just before correction value a n+1 S (a n+1 ) 0 0 1 2 2 3 3 4 4 5 5 6 6 7 7 8 As described above, the data written in the ROM 25 is required by the following equation: Da = 24 × a n -S (b n-1 ) + Ca Db = 24 × (-b n ) + S (a n+1 ) + Cb Fig. 8 shows the state of the information points in the case that the correction is not performed. As shown in this figure, the information points are diffused (the area is enlarged), the boundary between the adjacent information points is made obscure. This means that the accurate judgement for each information point is made difficult. On the contrary, Fig. 9 shows the distribution state for the information points in the case that the converting table added with the correction value is written in the ROM 25. As is shown in this figure, as compared with the case as shown in Fig. 8, the information points are not diffused, so that each information point can be accurately separated and judged. In the above-described embodiment, the inter symbol interference is corrected using the line spread function. However, the above correction for the inter symbol interference may be performed using the Hopkins' method on the basis of the content described in [H.H. Hopkins: "Diffraction theory of laser read-out system for optical video discs"; Journal Optical Society of America/Vol. 69, No. 1/p. 4-24/January 1979. In this case, the data Da and Db are calculated by the following equations: Da = 24 × a n + X mshift (a n , b n ) + X isicomp (a n , b n , b n-1 , a n+1 ) Db = 24 × b n + Y mshift (a n , b n ) + Y isicomp (a n , b n , b n-1 , a n+1 ) In the right sides of the above equations, the first terms are intended to convert the macro-step into the micro-step, the second terms mean correction amounts for positioning the information points on the grids, and the third terms mean correction amounts for lowering the diffusion of the information points and making the area thereof as small as possible. Next, the calculating method for the second term in the above equation will be described. As shown in Fig. 10A, in the case that the correction is not made, information points are deviated from grids: however, as shown in Fig. 10B, by the correction, the information points are positioned on the grids. This calculating may be executed on the basis of the flow chart as shown in Figs. 11A and Fig. 11B. This calculation is executed by, for example a computer, and the result is written in the ROM 25. First, the step S1, the dynamic range of the grid is set. The dynamic range is specified by the hardware of the reproducing apparatus, and which is divided into eight grids. In the step S2, the positions of the edges b n-1 and a n+1 are made to correspond to the position of 4 of the positions of from 0 to 7. The process proceeds to the step S3, wherein the horizontal position X ap (a n , b n ) of an information point I (a n , b n ) is compared in magnitude with a horizontal position X dp (a n , b n ) of the desired grid. When the horizontal position X ap (a n , b n ) of the information point I(a n , b n ) is smaller than the horizontal position X dp (a n , b n ) of the grid (when the information point is positioned on the left side of the grid), the process proceeds to the step S4, wherein the edge a n is made longer by one micro-step. Thus, the horizontal edge a n of the information point is regenerated in the data made longer by one micro-step. Then, the process proceeds to the step S5, wherein it is judged whether or not X ap (a n , b n )-X dp (a n , b n ) is minimized. Namely, it is judged whether or not the horizontal position of the information point comes to the nearest position to the horizontal position of the grid. When being not minimized yet, the process is returned to the step S4, and the process in the step S4 is repeated. By repeating the processes in the steps S4 and S5, the horizontal position of the information point is disposed at the nearest position to the position of the grid. In the step S5, when it is judged that the X ap (a n , b n )-X dp (a n , b n ) is minimized, the process proceeds to the step S6, wherein the repeated number between the steps S4 and S5 (correction number of the micro-steps) is set in X mshift (a n , b n ). On the other hand, in the step S3, when X ap (a n , b n ) is equal to or more than X dp (a n , b n ), the process proceeds from the step S3 to the step S8, wherein it is judged whether or not X ap (a n , b n ) is more than X dp (a n , b n ). When the former is larger than the latter, the information point is positioned on the right side of the grid. Accordingly, in this case, the process proceeds to the step S9, wherein the position of the edge a n is shortened by one micro-step, The shortened position is regenerated as a new horizontal position X ap (a n , b n ). After that, the process proceeds to the step S10, wherein it is judged whether or not X ap (a n , b n )-X dp (a n , b n ) is minimized. When being not minimized, the process is returned to the step S9, and the process in the step S9 is repeated. Namely, the position of the edge a n is changed by each micro-step until the horizontal position of the information point comes to the nearest position of the horizontal position of the grid. When it is judged that the nearest position is determined, in the step S11, the number of the micro-steps is set in X mshift (a n , b n ). In the step S8, when X ap (a n , b n ) is not more than X dp (a n , b n ), since X ap (a n , b n ) is eventually equal to X dp (a n , b n ), the process proceeds to the step S12. In this case, 0 is set in X mshift (a n , b n ). Namely, in this case, since the horizontal position of the information point is equal to the horizontal position of the grid, the fine correction with a unit of micro-step is not performed. After the steps S6, S10 or S12, the process proceeds to the step S7, wherein it is judged whether or not the horizontal adjustment for all information points is performed. When being not performed, the process is returned to the step S3, and the processes thereafter are repeated. Namely, the horizontal positions of all information points are adjusted to be disposed at the nearest positions to the horizontal positions of the grids. In the step S7, when it is judged that the horizontal positions of all information points are adjusted, the process proceeds to the step S13, wherein all information points are regenerated at the positions calculated as described above. In the step S14, wherein it is judged whether or not the vertical position Y ap (a n , b n ) of an information point is smaller than the vertical position Y dp (a n , b n ) of the grid. When is is judged that the former is smaller than the latter, the process proceeds to the step S15, wherein the edge b n is made longer by one micro-step. Thus, the value made longer is regenerated as Y ap (a n , b n ). Then, the process proceeds to the step S16, wherein it is judged whether or not Y ap (a n , b n )-Y dp (a n , b n ) is minimized. Namely, it is judged whether or not the vertical position of the information point comes to the nearest position to the vertical position of the grid. When being not disposed at the nearest position, the process is returned to the step S15, and the process in the step 15 is repeated. In the step S16, when it is judged that the vertical position of the information point is disposed at the nearest position to the vertical position of the grid, the process proceeds to the step S17, wherein the number of the micro-steps shifted in the step S15 is set in Y mshift (a n , b n ). In the step S14, when Y ap (a n , b n ) is equal to or more than Y dp (a n , b n ), the process proceeds to the step S19, wherein it is judged whether or not Y ap (a n , b n ) is more than Y dp (a n , b n ). When it is judged that the former is larger than the latter (in Fig. 10, Y ap (a n , b n ) is positioned over Y dp (a n , b n ), the process proceeds to the step S20, where the position of the edge b n is shortened by one micro-step. Thus, Y ap (a n , b n ) is regenerated as the edge position shortened by one micro-step. Next, the process proceeds to the step S21, wherein it is judged whether or not Y ap (a n , b n )-Y dp (a n , b n ) is minimized. Namely, it is judged whether or not the vertical position of the information point is disposed at the nearest position to the vertical position of the grid. When being not disposed, the process is returned to the step S20, and the process in the step S20 is repeated. In the step S21, when it is judged that the vertical position of the information point is disposed at the nearest position to the vertical position of the grid, the process proceeds to the step S22, wherein the number of the micro-steps corrected in the step S20 is set in Y mshift (a n , b n ). In the step S19, when it is judged that Y ap (a n , b n ) is not more than Y dp (a n , b n ), since Y ap (a n , b n ) is eventually equal to Y dp (a n , b n ), the process proceeds to the step S23. In this case, 0 is set in Y mshift (a n , b n ). After the steps S17, S22 or S23, the process proceeds to the step S18, wherein it is judged whether or not the vertical adjustment for all information points is performed. When being not performed, the process is returned to the step S14, and the processes thereafter are repeated. In the step S18, when it is judged that the vertical processes for all information points are performed, the process proceeds to the step S24, wherein the vertical positions of all information points are regenerated. By the above processes, there is calculated the data capable of disposing the information points, as shown in Fig. 10A, deviated from the grids at the nearest positions to the grids as shown in Fig. 10B [the data of the second terms of the right sides of the equations (5) and (6). Next, a method of concentrating the information point at a specified point (reducing the area of the information point) will be described. As is apparent from the enlarged view of the one information as shown in Fig. 12, the one information point is is constituted of a set of small information points in the number of 8 × 8 pieces (these are also produced in correspondence to the positions of the edges of from 0 to 7) indicated on coordinate axes specified by the other edges b n-1 and a n+1 respectively disposed on the front and rear sides of the edges a n and b n . For concentrating (focussing) the information point at one point, the position of the edge may be corrected by executing the processes as shown in Figs. 13A and 13B. First, at the step S31, all information points are shifted on the grids. The processing may be performed by executing the processes as shown in Figs. 11A and 11B. Next, the process proceeds to the step S32, wherein the diffusion center (point to be concentrated) of each information point is set at the point (intermediate point) specified by (b n-1 b n-1 = 4, a n+1 = 4) on the coordinate axes indicated by the and a n+1 enlargedly shown in Fig. 12. Then, the horizontal and vertical positions of the information point are expressed as H(a n , b n , 4, 4) and V(a n , b n , 4, 4), respectively. The process proceeds to the step S33, wherein it is judged whether or not the horizontal position H(a n , b n , b n-1 , a n+1 ) of the information point is smaller than the horizontal position H(a n , b n , 4, 4) of the diffusion center specified in the step S32. Namely, it is judged whether or not the position of the information point is positioned on the left side of the center to be concentrated. When it is judged that the horizontal position of the information point is positioned on the left side of the horizontal point to be concentrated, the process proceeds to the step S34, wherein the edge a n is made longer by one micro-step. The position H(a n , b n , b n-1 , a n+1 ) of the information point is regenerated at the position thus obtained. Then, the process proceeds to the step S35, wherein it is judged whether or not H(a n , b n , b n-1 , a n+1 )-H(a n , b n , 4, 4) is minimized. Namely, it is judged whether or not the horizontal position of the information point is disposed at the nearest position to the horizontal position of the point to be concentrated. When being not disposed, the process is returned to the step S34, and the process in the step S34 is repeated. In the step S35, when it is judged that the horizontal position of the information point is disposed at the nearest position to the horizontal position of the point to be concentrated, the process proceeds to the step S36, wherein the number of the micro-steps set in the step S34 is set in X isicomp (a n , b n , b n-1 , a n+1 ). In the step S33, when it is judged that H(a n , b n , b n-1 , a n+1 ) is equal to or more than H(a n , b n , 4, 4), the process proceeds to the step S38, wherein it is judged whether or not the former is larger than the latter. When it is judged that the former is larger than the latter (when the horizontal position of the information point is positioned on the right side of the horizontal position of the point to be concentrated), the process proceeds to the step S39, wherein the edge a n is set to be shorter by one micro-step. The value made shorter is regenerated as the horizontal position H(a n , b n , b n-1 , a n+1 ) of the information point. The process proceeds to the step S40, wherein it is judged whether or not the horizontal position of the information point is disposed at the nearest position to the horizontal position of the point to be concentrated. When being not disposed, the process is returned to the step S39, and the process in the step S39 is repeated. When it is judged that the horizontal position of the information point is disposed at the nearest position to the horizontal position of the point to be concentrated, the process proceeds to the step S41, wherein the number of the micro-steps set in the step S39 is set in X isicomp (a n , b n , b n-1 , a n+1 ). In the step S38, when it is judged that H(a n , b n , b n-1 , a n+1 ) is not more than H(a n , b n , 4, 4), since the former is eventually equal to the latter, the process proceeds to the step S42, wherein 0 is set in X isicomp (a n , b n , b n-1 , a n+1 ). After the processes of the steps S36, S41 and S42, the process proceeds to the step S37, wherein it is judged whether or not the horizontal positions of all information points are disposed at the nearest positions to the horizontal positions of the points to be concentrated. When the information points for which the process is not completed are present, the process is returned to the step S33, and the processes thereafter are repeated. In the step S37, when it is judged that the horizontal positions of all information points are concentrated at the nearest positions to the horizontal positions of the points to be concentrated, the process proceeds to the step S43, wherein the horizontal positions of all information points are regenerated. Thus, the process proceeds to the step S44. The processes from the steps S44 to S54 are similar to those from the steps S33 to S42, except that the direction is changed from the horizontal direction to the vertical direction. Accordingly, by executing the processes from the steps S44 to S54, the vertical positions of the information points are concentrated at the nearest positions to the vertical positions of the points to be concentrated. As described above, the data of the third terms on the right sides in the equations (5) and (6) are calculated. The data thus obtained are stored in the ROM 25 as the converting table. Fig. 14 shows the information points obtained by the reproduced signals in the case that the converting table in the ROM 25 is produced so as to contain the correction amount obtained by execution of the processes as shown in Figs. 11A and 11B. It is revealed that the information points correspond to the grids. Further, Fig. 15 shows the information points in the case that the converting table is written in the ROM 25 in consideration of the correction amount obtained by the processes as shown in Figs. 13A and 13B other than Figs. 11A and 11B. As compared with the case as shown in Fig. 16 in which the correction is not performed, the area of the information is made smaller (concentrated at the specified point), and the separation from the adjacent information point is made easy. In the method using the line spread function as shown in Fig. 7, the information point is concentrated at the position (0,0) within the plane specified by the coordinate axes (Fig. 12) of the edges b n-1 , and a n+1 . On the contrary, in the processes as shown in Figs. 13A and 13B, the information point is concentrated at the position (4, 4) as shown in Fig. 12. The concentration to the latter point is preferable because the distance by which the fine information point is shifted is made smaller, and the number of the micro-steps necessary for the correction is reduced. Namely, the inter symbol interference is reduced, which makes it possible to reduce the calculating number. As described above, according to the data recording method defined in claim 1, since the position of the edge specified by the first width is displaced, at a position where the interference due to the positions of the other edges is minimized, stepwise with the second step, it is possible to reduce the inter symbol interference, and hence to perform a higher density recording.

Claims: Method for recording data by data pits, the data values being converted by means of a stored conversion table into pit edge positions, the conversion table shifting the edge positions of a recorded data pit with a first step width the number of first steps corresponding to the value of the recorded data, and further shifting the edge positions with a second step width smaller than the first step width the number of the second steps being dependent on neighbouring values so as to minimize the interference due to the positions of these neighbouring pit edges, a step of generating the conversion table being characterised by generating information points I(a n , b n ) whose coordinates (V a , V b ) are represented by sampled position values generated from the reproduction of at least two successive pit edges (a n , b n ), comparing each information point with a respective point of a desired grid coordinate system, stepwise adjusting the number of second steps at said successive pit edges of recorded data so as to minimize the differences in both of the coordinate directions and to generate the desired number of second steps (X mshift(an,bn) and Y mshift(an,bn) ) to be stored in the conversion table. Method for recording data according to claim 1, characterised in that in said step of generating the conversion table information points are generated, whose coordinates are represented by sampled position values generated from the reproduction of four successive pit edges, whereby the diffusion of an information point is lowered. Apparatus for recording data by data pits, comprising a conversion means (3) for converting data values by means of a stored conversion table into pit edge positions, the conversion table shifting the edge positions of a recorded data pit with a first step width the number of first steps corresponding to the value of the recorded data, and further shifting the edge positions with a second step width smaller than the first step width the number of the second steps being dependent on neighbouring values so as to minimize the interference due to the positions of these neighbouring pit edges, and a means (9) for generating the conversion table, said means (9) for generating the conversion table being characterised by means for generating information points I(a n , b n ) whose coordinates (V a , V b ) are represented by sampled position values generated from the reproduction of at least two successive pit edges (a n , b n ,), means for comparing each information point with a respective point of desired grid coordinate system, means for stepwise adjusting the number of second steps at said successive pit edges of recorded data so as to minimize the differences in both of the coordinate directions and to generate the desired number of second steps (X mshift(an,bn) and Y mshift(an,bn) ) to be stored in the conversion table. Apparatus for recording data according to claim 3, characterised in that in said means (9) for generating the conversion table information points are generated, whose coordinates are represented by sampled position values generated from the reproduction of four successive pit edges, whereby the diffusion of an information point is lowered.

Inventors: DE KOCK JOOST, KOBAYASHI SEIJI, DE KOCK, JOOST, KOBAYASHI, SEIJI, de Kock, Joost, c/o Sony Corporation, KOBAYASHI, SEIJI, C/O SONY CORPORATION
Applicants: SONY CORP, SONY CORPORATION
Application year: 1993
Main classification: G11B20
IPC codes: G11B7, G11B20