JP2008159251A - Data processing method, data reproducing method, and information recording medium - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide an error correcting method significantly improving the recording density of a recording medium, in which Reed-Solomon product codes, which are currently used for DVD, are optimally used to significantly improve burst error correcting ability. <P>SOLUTION: An outer code is generated for each column and an inner code is generated in units of rows, separately for even-numbered rows and odd-numbered rows of a data block composed of data sectors. The outer codes are distributed and interleaved for each sector of the data block. Also, data processing can be performed while maintaining a sector ID, so that data processing can be easily performed. <P>COPYRIGHT: (C)2008,JPO&INPIT

Description

  The present invention relates to a data processing method, a reproduction method, and an information recording medium for an error correction product code block suitable for use in recording / transmission of digital data.

  More specifically, the present invention provides an error correction product code composed of an outer code and an inner code for error correction, which is particularly effective when recording information data on a plurality of types of recording media having greatly different recording densities. The data processing system used. Here, in particular, the outer code is formed by using a PO generation sequence of n sets of data aggregated every n rows, and even if recording is performed in the order of data transmission without performing the data interleaving process, the defect response capability is high. Greatly improved.

  In a system in which digital data is recorded on an optical disk in units of bytes (1 byte is 8 bits) or sent to a transmission line, a Reed-Solomon error correction product code block is constructed and processed. That is, (M × N) bytes of data are arranged in an M row × N column matrix, a PO byte error correction check word is added to the M byte information portion for each column, and an N byte information portion is provided for each row. Is added with an error correction check word of PI bytes to construct a Reed-Solomon product code block of (M + Po) rows × (N + Pi) columns. By recording or transmitting the Reed-Solomon error correction product code block, the error correction processing unit on the reproduction side or the reception side can correct random errors and burst errors.

  Such a Reed-Solomon error correction product code block has a redundancy portion (Pi × M + Po × N + Po × Pi) of the error correction check word with respect to the size of the entire code word called redundancy ratio, that is, (M + Po) × (N + Pi). The smaller the ratio, the higher the data processing efficiency. On the other hand, the larger Pi and Po, the higher the correction capability for both random errors and burst errors.

  Here, when Reed-Solomon error correction product code blocks having the same redundancy rate are compared, in the case of a Reed-Solomon error correction product code block where M and N are small and Pi and Po are also small, the probability of erroneous correction is relative. It is known that the correction ability decreases due to the increase.

  On the contrary, if M and N are increased, Pi and Po can be increased even with the same redundancy rate, and it is known that high correction capability can be obtained. However, this cannot be realized unless the following constraint conditions are satisfied.

  First, there is a constraint that M + Po and N + Pi must be 255 bytes or less as codeword lengths for forming a Reed-Solomon codeword (when the word length is 8 bits). Note that Pi is the error correction check code length of the PI sequence, and Po is the error correction check code length of the PO sequence.

  Second, there is a cost limitation due to the hardware scale.

  Considering these conditions, the improved Reed-Solomon error correction product code block is adopted as an optical recording medium such as DVD-ROM, DVD-RAM and DVD-R, which are recent information recording media. The standard was announced. Of these standards, ISO (International Organization for Standardization) of DVD-ROM and DVD-RAM has been determined as DIS 16448 (80 mm DVD-ROM), DIS 16449 (120 mm DVD-ROM), and DIS 16825 (DVD-RAM).

  In this DVD standard, the above-mentioned concept is adopted for the error correction check coding processing method, and the error correction capability is remarkably improved with an error correction check word having a low redundancy rate as compared with the method used in the conventional optical disk system. Was met.

  The concept of the DVD error correction scheme is basically as described above, but the basic problem is how to set the target values of random error correction capability and burst error correction capability. is there. These decisions must be made in consideration of the recording method of the recording medium and the occurrence of defects resulting from handling.

  The recording / reproducing system is determined by the recording / reproducing beam spot size that comes from the recording wavelength and optical system characteristics in the optical disc system. Here, the recording density has a large factor in determining the error correction method. In particular, in determining the burst error correction capability, the defect length such as scratches caused by handling is required from experience, but the error correction capability is obtained by multiplying the physical defect length by the linear recording density to determine the burst error of information data. As the recording density increases, it becomes necessary to increase the correction capability.

  Regarding the recording density, the reproduction system is described as an example as follows.

If the light source wavelength is λ and the aperture ratio of the objective lens is NA, the recording density is
(NA / λ) ²
Is proportional to The wavelength adopted for DVD is 650 nm and NA is 0.6.

The error correction method is a Reed-Solomon product code, and for an information data block of (M × N) = (192 × 172) bytes, PI (inner code) = 10 bytes and PO (outer code) = 16 bytes, respectively. ,
Row side inner code RS (182, 172, 11)
Outer column code RS (208, 192, 17)
(RS is called Reed-Solomon). A block handled by this error correction method is an error correction product code block.

Here, the error correction product code block is first subjected to error correction using a PI sequence, and an error mark is attached to an uncorrectable row. Thereafter, when error correction is performed in the PO series, a burst error of up to 16 lines can be corrected by using an “erasure correction” method in which an error mark is treated as an error position and only an error pattern is calculated and extracted. In DVD, the recording density is data bit length = 0.267 μm.
0.000267 × 8 × 182 × 16 = 6.2 mm
It can be said that it has a burst error correction capability of about 6 mm.

  However, studies of large-capacity optical disks with higher density as next-generation DVDs have begun. In order to increase the capacity beyond the above-mentioned DVD, the recording density must be increased. Recently, a blue laser diode with a wavelength of 405 nm has been announced to meet these requirements. If this laser is used, a recording density of about 2.6 times can be expected even in an optical system similar to a DVD. By improving the optical system, it becomes possible to increase the density by 4 to 5 times or more, and high-definition video such as Hi-vision can be recorded on one disc for 2 hours or more.

  In this increase in density (for example, a linear density of about twice that of the prior art), if a conventional error correction method is introduced, it can only have a correction capability of about 3 mm for burst errors. Become.

  Furthermore, as described above, the maximum error correction check code length is 255 bytes as long as a word = 8-bit processing system is used. In the DVD standard, since the PO series is 208 bytes, the above error correction method has a limit to the burst error handling capability and can be expected to improve only slightly.

  In order to increase the correction code length, the word length may be increased. As the word length, a multiple of 8 is easy to use because of other systems, and as a result, “1 word = 16 bits” can be considered. There are many.

  In such a case, there is a technique that generally adopts data interleaving to disperse burst errors and improve the burst correction capability without changing the correction code length.

  However, even in the DVD standard, data interleaving is not adopted. The reason is that in the case of a video signal in which information data is compressed, if an error larger than the correction capability occurs in the playback process, the error data will be dispersed, resulting in playback video defects at many positions. Will end up. In the reproduction processing of a video signal or the like, it is preferable as the defect occurrence processing that processing is performed such that defective videos are concentrated as much as possible. This is because it is possible to complete the reproduction of a defective video for a moment.

Also, the next generation system is preferably a structure close to the current DVD system for upward compatibility. Note that there are the following documents disclosing techniques related to error correction.
JP 09-293331 A Japanese Patent Laid-Open No. 10-172243

  In general, the Reed-Solomon product code method is often introduced as an error correction processing method for package media and the like. This is because, in the case of detecting and correcting defect error data such as defects that occur in package media during manufacturing and distribution, this method can be expected to provide high performance and high efficiency.

  The unit of processing data is conveniently 1 word = 1 byte (8 bits). In consideration of system application development, the processing circuit needs to be limited to an appropriate hardware scale. This is necessary not only for error correction processing but also for the ease of coupling with the pre- and post-processing circuits for recording on a recording medium and data transmission to a certain transmission path. .

  Under such circumstances, the following Reed-Solomon product code that is currently used in DVDs is optimally used as an error correction method that can cope with a significant increase in recording density of recording media.

Row side inner code RS (182, 172, 11)
Outer column code RS (208, 192, 17)
However, the problem here is that a solution to improve the burst error correction capability is necessary.

  In the present invention, digital data is processed in units of bytes, and one information data block is composed of (12 × N) bytes of M rows × N columns, and data is arranged in units of bytes in the information data block. In each row, the 0th to (N-1) th columns are arranged in the data transmission order, and the 0th to 11th rows are arranged in the data transmission order. The head of each row includes identification information (ID) for identifying the information data block and control data. The data in each row of the information data block is scrambled, and A set of the information data blocks, which is composed of K information data blocks from the 0th information data block to the (K-1) th information data block, which are consecutive in the data transmission order. A matrix block of (K × 12) rows × N columns is arranged, and in each column of (K × 12) bytes of this matrix block, an error correction check word for data (K × 6) bytes of even rows Error correction inspection PO-b ((K / 2) × Q) bytes are generated for PO-a ((K / 2) × Q) bytes and odd row data (K × 6) bytes, and PO -a and PO-b are distributed and arranged in the K information data blocks composed of 12 rows × N columns of (12 × N) bytes, and each column of N columns is (K × (12 + Q)). ) Or (K × (12 + 2Q)) bytes of Reed-Solomon code word PO (where Q is an integer of 1 or more), and an error correction check word P byte is added to each row of N bytes, and (K × ( 12 + Q)) or (K × (12 + 2Q)) rows, where each row is a (N + P) byte Reed-Solomon code As a whole block formed as a word PI, the information part is K information data blocks maintaining the identification information (ID) and control data (K × (12 + Q) × (N + P)) bytes of Reed-Solomon It is based on processing a block that constitutes an error correction check code.

  The above means is an error correction method that can cope with a significant increase in recording density of the recording medium, has high error correction capability against burst errors, and facilitates data processing.

  Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings.

  Reed-Solomon error correction is often used for the structure of an information data block for error correction inspection, which is generated by adding an error correction code to an information data block, to improve random error and burst error correction capability. Digital data processing is generally processing in units of 8 bits as 1 byte, and is advantageous in terms of data processing efficiency when considering other developments.

  Hereinafter, the drawings and the DVD standard will be described in detail.

  FIG. 1 is an information data block of M rows × N columns. In the computer field, 128 × (multiple of 2) bytes of information blocks are used as processing information data blocks.

  In the DVD standard, 2048 bytes are used in units of information blocks. This 2048-byte main data includes 2064 bytes including ID, control code, etc., and constitutes an information data block of 12 rows × 172 columns. If an error correction code is added directly to a block of (M × N = 12 × 172) bytes to obtain the expected correction capability, the redundancy rate of the correction code becomes too high. Therefore, K information data blocks are collected to form an information data block of (K × (M × N)) bytes.

  FIG. 2 shows this information data block of (K × (M × N)) bytes. In the DVD standard, K = 16 is adopted.

  In the information data block of FIG. 2, the row (vertical) direction is (K × M) bytes of data. (K × Q) bytes that are error correction codes are generated and added to (K × M) bytes of data in each of N columns. Next, in the information data block of FIG. 2, the column (horizontal) direction is N bytes of data. The number of rows is (K × M) + (K × Q) because the previous error correction code (K × Q) has increased. A P byte which is an error correction code is generated and added to each of the (K × M) + (K × Q) rows.

  FIG. 3 shows a state in which (K × Q) bytes as an error correction code and P bytes as an error correction code are added to the information data block of (K × (M × N)).

  In the DVD standard, Q = 1 and P = 10.

  Next, an error correction code of (K × Q) bytes is distributed by Q bytes and added to each of K (M × N) bytes of information data blocks so that each information data block has the same form. To do.

  This process has an objection that all K information data blocks have the same structure. That is, ID indicating the address of the information data is added to the (N × M) bytes of information data, but all the correction code blocks (K × Q × 172) which are the outer codes PO are error correction codes. An ID cannot be added to this. Therefore, this error correction code is distributed and arranged in each information data block so that all the information data blocks have the same structure and have an ID.

  The procedure for distributed arrangement is to generate an error correction inspection code in the row (vertical) direction, and then distribute (K × Q) rows and arrange them in each information data block, and then error in the column (horizontal) direction. A correction code may be generated and added to each row, or an error correction code in the column (horizontal) direction may be generated and added to each row, and then (K × Q) of the error correction inspection code in the row (vertical) direction. ) Rows may be distributed and arranged in each information data block. In any order, the DVD standard system gives the same result.

  FIG. 4 shows a new block structure in which (K × Q) rows of error correction check codes are distributed and arranged in each information data block (K pieces). In the DVD standard, an error correction product code block of (K × (M + 1) × (N + P)), that is, “16 × (208 × 182)” bytes is configured.

  FIG. 5 shows the structure of one information data block (M + Q) × (N + P) to which an error correction code is added. An ID and a control signal (CNT-sig) that are also address information of the information data block are arranged in the first row, and an error correction inspection code Q in the row (vertical) direction is arranged in the last row. In the DVD standard, Q = 1, and this structure can increase the number of K until K × (M + Q) is 255.

  FIG. 6 is a diagram showing in detail the information data block of FIG. An EDC is added to the end of the main data.

  FIG. 7 shows an embodiment of an information data block according to the present invention.

  As shown in FIG. 1, N pieces of information data blocks of N columns × M rows are assembled, and a (K × M) row × N columns matrix block as shown in FIG. 2 is constructed. Here, (K × Q) bytes or (K / 2 × Q) bytes of error correction check code (error correction check word) for (K × M / 2) bytes of data in each column of even rows PO-a is generated.

  Next, (K × Q) bytes or ((K / 2) × Q) bytes of error correction check code (error correction check) is applied to (K × M / 2) bytes of data in each column of odd rows. Word) PO-b is generated.

  The PO-a and PO-b generated here are distributed in K information data blocks of (M × N) bytes.

  Here, if PO-a = PO-b = (K × Q), Q bytes from PO-a and PO-b are distributed and arranged in each (M × N) byte information data block. When -a = PO-b = ((K / 2) × Q), PO-a is distributed in even-numbered information data blocks or the first half of the information data blocks among the K information data blocks. Then, PO-b is distributed and arranged by Q bytes in odd-numbered information data blocks or in the latter half of the information data blocks.

  Here, in the present invention, as in the DVD standard of FIG. 1, when M = 12 and N = 172, K = 32 (= 16 × 2), Q = 1, and PO−a = PO−b = 16 Then, an error correction check code PO-a for even rows and an error correction check code PO-b for odd rows are generated for an error correction data block of 172 columns × (12 × 32) = 384 rows. The Then, PO-a is distributed in the even number of each of the 32 information data blocks, and PO-b is distributed in the odd number, and 32 new information data blocks of (12 + 1) bytes × 172 bytes are formed. . Further, a 10-byte error correction check code PI is added to each row of each information data block, and 32 information data blocks of the result (12 + 1) rows × (172 + 10) columns are formed. This is an error correction product code block.

  Each information data block after the error correction check code is added has the same structure as the conventional block shown in FIG. However, the value of K is different. The DVD information data block is composed of 2048 bytes of main data composed of 12 rows and 172 columns, an ID and control signal (12 bytes), and an EDC (4 bytes). Is the unit.

  The present invention is not limited to the above embodiment.

  Here, as another embodiment, (M = 24 rows) × (N = 172 columns) = 4096 bytes of main data (information block), ID and control signal (24 bytes), and EDC (8 bytes) are added. Consider an information data block. Now, assuming that K = 16 and Q = 1, and PO-a = PO-b = 16 bytes, one byte from PO-a and PO-b is distributed and arranged in each information data block. In this case, one information data block after adding the error correction check code has a structure as shown in FIG.

  Next, the error correction inner code PI will be described.

  FIG. 9 shows a series of error correction inspection word (inner code) PI adopted in the DVD standard and an example of the present invention. An inner code PI is generated for data in the column (horizontal) direction, which is the order of transmission data.

  FIG. 10 shows a modification for generating an error correction check word (inner code) PI according to another embodiment of the present invention.

  For data of M rows × N columns of the information data block, (N + P) bytes of Reed-Solomon codeword (inner code) PI are formed from columns 0 to ((N + P) −1). This is realized by data from the 0th row to the (M-1) th row. In generating an error correction check code of a PI sequence for an information data block to which PO is added, each row and each column is incremented by one unit starting from the byte data of each head column, and an increase result row is obtained. (M) The row number (M) obtained by increasing is rotated to 0 row so that it is shifted to 0 row when it becomes the row (M), and (M) sets of PI series correction codes are configured. .

  In the conventional recording density, the random error has 1 to 2 byte errors dispersed, but in the high density recording, the random error increases to about 5 bytes.

  Therefore, by making the error correction sequence different from the recording order and the data set sequence of the interlaced arrangement, the recording arrangement does not change with respect to the data order, but since the error correction check code sequence is different from the recording order, a small concentration error occurs. The error correction processing is distributed, and the random error correction capability in execution can be improved.

  FIG. 11 is another example of the present invention of a method for forming a PO sequence error correction check code.

  In FIG. 11, error correction data blocks (matrix blocks) of (K × M) rows × N columns as in the conventional DVD standard are formed in the recording order. Block B2 is the current block, and block B1 is the previous block. In the generation of the PO sequence error correction check code Po, the even row data of the current error correction data block B2 and the odd row data of the previous error correction data block B1 are aggregated to obtain the PO sequence error correction check code Po. A data block B22 to be generated is configured. Next, when the error correction check code Po is generated, the error correction check code Po is distributed in the current error correction data block B22 to form a block B23. Thereafter, the PI series error correction code Pi described above is generated in this block B23 and added to each row.

  In this error correction check code data processing method, the PO sequence is subjected to convolutional processing, but this method has the advantage of requiring a small read data range in the reproduction processing of any two information data blocks. There is.

  FIG. 12 is a diagram showing a data processing procedure of the recording apparatus to which the present invention is applied.

  Data for recording is input from the outside to the data sectoring unit 42 and is sectorized. In this embodiment, 2 Kbytes is the basis. An error detection code (EDC) is added to the data block in units of 2K bytes. This data block is referred to as an information data block. This process is performed in the EDC encoding unit 43. Next, an ID for identifying the information data block (sector) and other control signals are added by the ID adding unit 44. Next, the scramble processing unit 45 scrambles the main information data.

  This scrambling process is performed for the following reason. That is, when the main data is a video signal or the like, “0” is continued in the blank portion. When such a signal is handled as a recording signal, the recording signal tends to repeat the same pattern. If the same pattern of the recording signal exists in adjacent tracks such as an optical disk, the servo operation becomes unstable due to the influence of crosstalk between the tracks. In order to prevent this, data scramble is performed by using a scramble pattern determined by an ID, for example, by superimposing scramble data on data.

  The scrambled data (sectors) is collected, for example, in units of 32 sectors in the order of transfer, and is converted into ECC blocks by the ECC blocking unit 46. This ECC block is input to the even / odd row blocking unit 47. Here, even / odd are once blocked separately. Each block is subjected to PO sequence error correction check coding as described in FIG. 7 in the even / odd PO encoder 48. Next, PI sequence error correction check coding is performed on each row in the PI encoder 49. Next, in the ECC blocking unit 50, the blocks of even rows and odd rows are merged. Further, in the PO parity interleaving unit 51, the parity of the PO sequence is distributed to each sector as shown in FIG. 8, and the check and correction words of the PO sequence are interleaved to each data sector in the entire block.

  Next, the ECC block is input to the recording sector converting unit 52. Further, the recording sector converting unit 52 and the next modulation and synchronization adding unit 53 add a synchronization signal and perform 8/16 modulation. This modulation signal is supplied to the optical pickup 55 via the driver 54 to drive the laser diode. Thereby, the laser beam is irradiated onto the disk 56, and signal recording is performed. The disk 56 is rotationally controlled by a disk motor 57.

  FIG. 13 shows the structure of the data sector in the DVD format created during the recording process. The data sector has 172 columns (172 bytes) and 12 rows. The first line includes ID (4 bytes), IED (ID error detection code: 2 bytes), CPR-MAI (copyright management information: 6 bytes), and main data 160 bytes. At the end of the last line (the 12th line), main data and a 4-byte error detection code are added. The remaining lines are all main data.

  FIG. 14 shows a state where 32 sectors of FIG. 13 are assembled into ECC blocks.

  In FIG. 15, the ECC block of FIG. 14 is divided into even rows and odd rows to form even row blocks and odd row blocks, and PO series codes PO-a and PO- It shows how b is created and added.

  FIG. 16 shows a single ECC block in which the even-numbered block and the odd-numbered block are integrated together with the symbols PO-a and PO-b. In addition, it shows a state where a PI sequence code is created and added. The arrangement order of PO-a and PO-b is not limited to that shown in the drawings.

  FIG. 17 shows a state where the above-described PO sequence codes are distributed to each sector. This is a recording sector. Each recording sector is added with a synchronization signal, further modulated, and recorded on a recording medium.

  In the present invention, the PO sequence error correction check code is generated and the PI sequence error correction check code is generated in the above description, but this processing procedure is not limited to this. This processing order may be reversed. That is. After the data sector of FIG. 14 is converted into an ECC block, an error correction check code for the PI sequence is generated, and the ECC block to which the PI code is added is divided into a block in which even rows are assembled and a block in which odd rows are assembled. Thereafter, a PO sequence error correction check code including the PI code may be generated. Thereafter, the even-numbered block and the odd-numbered block may be reassembled, and then the PO code may be distributed by interleave processing.

  FIG. 18 shows a configuration example of a playback apparatus to which the basics of the present invention are applied.

  Data is recorded on the disk 56 by the recording method described with reference to FIG. The modulation signal read by the pickup head 55 is supplied to the channel data reading unit 81 and is in channel bit units. The synchronization signal is separated in the synchronization separation unit 82 and divided in symbol units. Next, the demodulator 83 demodulates the data from 16 bits to 8 bits and supplies the data to the sector ID detector 84. Here, each sector is identified and divided and input to the ECC blocking unit 85. Here, sectors are aggregated to form ECC block unit data. The ECC block is input to the PI decoding unit 86, and PI sequence error detection and correction are performed. Next, the PO-a decoding unit 87 performs PO-a sequence error detection and correction, and the PO-b decoding unit 88 performs PO-b sequence error detection and correction.

  Next, descrambling of the main data portion is executed in the descrambling processing unit 89. Further, in the error detection unit 90, error detection in the main data portion is executed based on EDC, and normal main data is extracted. This main data is transferred to the subsequent processing unit via the interface 91.

  In the reproduction process, any one of the PI error detection and correction process and the PO error detection and correction process may be executed first, and is not limited to the order shown in the drawing.

  By the way, in DVD, video objects (VOB) are designated in cell units, and VOB is a format including a plurality of video object units (VOBU). The video object includes a plurality of video packets (V_PCK) and audio packets (A_PCK), and also allows sub-picture packets (SP_PCK) to be included. Further, in the recording / reproducing format, a control packet (RDI_PCK) including real-time data information (RDI) is arranged at the head of VOBU. In this packet, VOBU playback start time, recording time information, display control information (aspect ratio information), copy control information, and the like can be described. A reserved area is also secured in this pack.

  Furthermore, the video data stored in V_PCK is compressed by MPEG1 or MPEG2. In the MPEG1 or MPEG2 system, information indicating an aspect ratio or the like is described in the sequence header. Furthermore, GOP user data for the line 21 can be inserted into a part of the compressed data. This part is used when sending character code data or the like.

  In the recordable / reproducible DVD standard, a control data area describing program chain information for determining the reproduction order of programs recorded in the user data area is also secured.

  Therefore, when the ECC block according to the embodiment of the present invention is adopted, a part of the RDI_PCK, an arrangement part of the GOP user data, or a part of the control data area is used, and the ECC block form is determined. ECC block identification information indicating whether or not it is in a form may be stored.

  When this ECC block identification information is stored, it is possible to identify what type of ECC block the recorded information or transferred information is. As a result, the present invention can be additionally added to a conventional DVD reproducing apparatus and can be widely applied. Of course, each of the recording and playback processing apparatuses shown in FIGS. 12 and 18 may be provided with a circuit for processing in the conventional ECC block form in parallel, so that the user can arbitrarily adopt one of the processing forms during recording. In this case, the ECC block identification information described above is automatically created according to the ECC block form selected at the time of recording, and stored or arranged in a predetermined area.

  The method (or form) for creating the PI sequence error correction check code of the present invention is not limited to the above embodiment.

  FIG. 19 shows another method for creating an error correction check code for a PI sequence. In this example, two rows of data are alternately selected every other column, and a 10-byte code is created using the selected data. If the number of rows is an even number, an error correction check code for a PI sequence can be easily created by this method. Even if a part of the data in one row is damaged, the PI series correction capability can be enhanced.

  In the above description, the description has focused on recording the ECC block structure according to the present invention on a recording medium. However, the present invention is not limited to the processing method and apparatus for recording on a recording medium. Absent. Also in the communication apparatus, data may be packetized, data sectors may be created, and the data sectors may be aggregated and subjected to modulation processing for transmission. In this case, as a matter of course, the form of the present invention may be adopted as the form of the ECC block in which the data sectors are assembled. Further, the modulation processing method is not limited to the above description, and the data of the ECC block may be modulated by QPSK, QAM method, etc., and further transmitted by using the OFDM method for the transmission path.

  In the above embodiment, the sector set block of a predetermined unit is divided into the even-numbered block and the odd-numbered block, and the error correction check words PO-a and PO-b are generated for each block. The PO sequence may be configured by generating an error correction check word by dividing into more than the number of divisions (Y).

  As described above, if the present invention is used, even in an error correction method based on byte data, the burst error correction capability can be greatly improved while the correction flag redundancy rate is the same as the conventional one. According to the present invention, it is possible to realize error correction processing for a high-density optical disk using a blue laser, which has been started, up to a physical error correction length larger than that of the conventional one.

The figure which shows the information block of (MxN) byte. The figure which shows the structure when the information block of (MxN) bytes is aggregated (Kx (MxN)). The figure which shows the correction block structure which added the error correction code by the product code structure to (K * (M * N)). The figure which shows the correction block structure which distributed the check word PO for error correction PO (KxQ) to each information data block in Q byte unit so that the information data block to which the correction flag was added may become the same structure. The figure which shows the structure of the information data block to which the error correction code of FIG. 4 was added. The figure which showed the structure of the information data block of FIG. 5 with the code length used by DVD specification. The figure which shows an example of a structure of the error correction block which concerns on this invention. The figure which shows the state by which the error correction test | inspection word PO was distributed and arrange | positioned at the information data block of (MxN) bytes concerning this invention. The figure shown in order to demonstrate the example of the series of the error correction inspection word PI. The figure shown in order to demonstrate other examples of the series of error correction inspection word PI concerning the present invention. The figure shown in order to demonstrate the other example of the series of the error correction inspection word PO of this invention. Explanatory drawing which shows the production process and recording apparatus of the ECC block which concerns on this invention. Explanatory drawing which shows the structure of the data sector in DVD. Explanatory drawing which shows a mode that the sector which concerns on this invention was made into ECC block. FIG. 15 is an explanatory diagram showing a state in which the ECC block of FIG. 14 is divided into an even-numbered block and an odd-numbered block and a PO series error correction check code is added to each block. The figure which shows a mode that the even-numbered block and odd-numbered block of FIG. 15 were integrated, and the PI series error correction check code was added. FIG. 17 is an explanatory diagram illustrating a state in which a PO sequence code is interleaved in the ECC block of FIG. 16. The figure which shows the reproduction | regeneration processing apparatus of the ECC block which concerns on this invention. The figure which shows the other example of the error correction check code production method of PI series of the ECC block which concerns on this invention.

Explanation of symbols

  42 ... Data sectorization unit, 43 ... EDC encoding unit, 44 ... ID addition unit, 45 ... Scramble processing unit, 46 ... ECC blocking unit, 47 ... Even / odd row blocking unit, 48 ... Even / odd PO code 49 ... PI encoding unit, 50 ... ECC blocking unit, 51 ... PO parity interleaving unit, 52 ... recording sectoring unit, 53 ... modulation and synchronization adding unit, 54 ... driver, 55 ... optical pickup, 56 ... Disc 57: Disc motor 81 ... Channel data reading unit 82 ... Sync separation unit 83 ... Demodulation unit 84 ... Sector ID detection unit 85 ... ECC blocking unit 86 ... PI decoding unit 87 ... PO- a decoding unit, 88... PO-b decoding unit, 89... descrambling processing unit, 90.

Claims (4)

Digital data processing is performed in units of bytes, and one information data block is composed of 12 rows × N columns of (12 × N) bytes,
In the information data block, data is arranged in byte units, arranged in the data transmission order from the 0th column to the (N-1) th column for each row, and from the 0th row to the 11th row. Are arranged in the order of data transmission,
The head of the first row of the information data block includes 4-byte identification information (ID) for identifying the information data block, 2-byte ID error detection code, and 6-byte copyright management information. ,
The data in each row of the information data block is scrambled,
Furthermore, it is a set of the information data blocks, and is composed of K information data blocks (K × 12) rows from the 0th information data block to the (K−1) th information data block, which are consecutive in the data transmission order. A matrix block of × N columns is arranged,
For each column of (K × 12) bytes of this matrix block,
An error correction check word PO-a ((K / 2) × Q) bytes are generated for even-numbered data (K × 6) bytes, and an error correction check word PO-b is generated for odd-numbered data (K × 6) bytes. ((K / 2) × Q) bytes are generated,
PO-a and PO-b are distributed and arranged one row at a time for the K information data blocks composed of (12 × N) bytes of 12 rows × N columns,
Each column of N columns is formed as a (K × (12 + Q)) byte Reed-Solomon codeword PO (where Q is an integer of 1 or more),
Further, an error correction check word P byte is added to each row of N bytes, and each row of (K × (12 + Q)) rows is formed as a Reed-Solomon code word PI of (N + P) bytes. . In claim 1,
K = 32, Q = 1, PO-a = PO-b = 16, and the total of one information data block (12 × N) bytes and the average number of inspection word bytes added thereto is a constant value 13 A data processing method comprising configuring an error correction product code block configured to be (N + P) bytes. Digital data processing is performed in units of bytes, and one information data block is composed of (12 × N) bytes of M rows × N columns,
In the information data block, data is arranged in byte units, arranged in the data transmission order from the 0th column to the (N-1) th column for each row, and from the 0th row to the 11th row. Are arranged in the order of data transmission,
The beginning of the first row of the information data block includes identification information (ID) and control data for identifying the information data block,
The data in each row of the information data block is scrambled,
Furthermore, it is a set of the information data blocks, and is composed of K information data blocks (K × 12) rows from the 0th information data block to the (K−1) th information data block, which are consecutive in the data transmission order. A matrix block of × N columns is arranged,
In each column of (K × 12) bytes of this matrix block, an error correction check word PO-a ((K / 2) × Q) bytes and odd numbers for even-numbered data (K × 6) bytes For a row of data (K × 6) bytes, error correction inspection PO-b ((K / 2) × Q) bytes are generated,
PO-a and PO-b are distributed and arranged in the K information data blocks composed of (12 × N) bytes of 12 rows × N columns one by one,
Each column of N columns is formed as a Reed-Solomon code word PO of (K × (12 + Q)) or (K × (12 + 2Q)) bytes (where Q is an integer of 1 or more),
Further, an error correction check word P byte is added for each row of N bytes, and each row of (K × (12 + Q)) or (K × (12 + 2Q)) is formed as a Reed Solomon codeword PI of (N + P) bytes,
As the entire block, a Reed-Solomon error correction check code of (K × (12 + Q) × (N + P)) bytes is used, where the information information portion is K information data blocks that maintain the identification information (ID) and control data. A method for processing a block
Performing error detection and correction processing of the Reed-Solomon codeword PI sequence;
A data reproduction method comprising a step of performing error detection and correction processing of a series of two types of Reed-Solomon codewords PO. Digital data processing is performed in units of bytes, and one information data block is composed of 12 rows × N columns of (12 × N) bytes,
In the information data block, data is arranged in byte units, arranged in the data transmission order from the 0th column to the (N-1) th column for each row, and from the 0th row to the 11th row. Are arranged in the order of data transmission,
The head of the first row of the information data block includes 4-byte identification information (ID) for identifying the information data block, 2-byte ID error detection code, and 6-byte copyright management information. ,
The data in each row of the information data block is scrambled,
Furthermore, it is a set of the information data blocks, and is composed of K information data blocks (K × 12) rows from the 0th information data block to the (K−1) th information data block, which are consecutive in the data transmission order. A matrix block of × N columns is arranged,
For each column of (K × 12) bytes of this matrix block,
An error correction check word PO-a ((K / 2) × Q) bytes are generated for even-numbered data (K × 6) bytes, and an error correction check word PO-b is generated for odd-numbered data (K × 6) bytes. ((K / 2) × Q) bytes are generated,
PO-a and PO-b are distributed and arranged one row at a time for the K information data blocks composed of (12 × N) bytes of 12 rows × N columns,
Each column of N columns is formed as a (K × (12 + Q)) byte Reed-Solomon codeword PO (where Q is an integer of 1 or more),
Further, an error correction check word P byte is added to each row of N bytes, and information formed as (N + P) bytes of Reed-Solomon code word PI is modulated and recorded for each row of (K × (12 + Q)). An information recording medium characterized by the above.

Images