Link-quality estimation method and components for multi-user wireless communication systems |
| OF THE PREFERRED EMBODIMENT(S) The present invention is directed to wireless communication systems ... |
|
Drilling restart control system |
| It is therefore an object of the present invention to provide a drilling restart control system of ... |
|
Method and apparatus for automatically correcting errors detected in a memory subsystem |
| An apparatus and method for correcting corrupted data are disclosed. Access logic is provided to ... |
|
Replacement data error detector |
| A cache is described which includes an error circuit for detecting errors in the replacement data. I... |
|
Soft error detection in high speed microprocessors |
| The present invention provides aspects for soft error detection for a superscalar microprocessor. T... |
|
Semiconductor integrated circuit device, manufacturing method thereof, and driving method for the same |
| To solve the above-described problems, the present invention employs the below-mentioned means. As ... |
|
Integration of security modules on an integrated circuit |
| In accordance with the preferred embodiment of the present invention, an integrated circuit ... |
|
Semiconductor memory with a multiplexer for selecting an output for a redundant memory access |
| The invention may be incorporated into an integrated circuit memory with redundant memory cells, by ... |
|
|
Data processing method and apparatus, recording medium, reproducing method and apparatus using the same method
| Details |
Inventors: Kojima, Tadashi;
Assignee: Kabushiki Kaisha Toshiba (Kawasaki, JP)
Primary Examiner: Decady; Albert
Assistant Examiner: Chase; Shelly A
Attorney, Agent or Firm: Oblon, Spivak, McClelland, Maier & Neustadt, P.C.
A burst error-correcting capability is largely improved. At least the even-number row and at least the odd-number row of the data block which is a set of data sectors are separated. An outer parity is created for each column and an inner parity is created for each row. Then, the outer parity is scattered with respect to each of the sectors of the data block to be interleaved. |
|
DETAILED DESCRIPTION OF THE INVENTION Hereinafter, referring to the accompanying drawings, embodiments of the present invention will be explained. In a structure of an error-correcting information data block in which an error-correcting code is created and added to the information data block, the Reed-Solomon error correction is used many times for heightening the random error and burst error correction capability. Furthermore, generally, in the digital data processing, a unit of 8 bits constitutes one byte. In consideration of other aspects of the development, such concept is favorable in the data processing efficiency. Hereinafter, a detailed explanation will be given by referring to the drawings and the DVD standard. FIG. 1 is an M row. times. N columns information data block. In the field of computers, 128. times. (multiple of 2) is used as processed information data block. In the DVD standard, 2048 bytes are used an information block unit. By adding ID and a control code or the like to 2048 bytes main data, 2064 bytes is set to constitute 12 rows. times. 172 columns information data block. When an attempt is made to gain an expected error-correcting capability by directly adding an error-correcting code to (M. times. N=12. times. 172) byte block, the redundancy ratio of the correction code becomes too high. Then, (K. times. (M. times. N)) bytes information data block is constructed by aggregating K information data blocks. FIG. 2 is a view showing this (K. times. (M. times. N)) bytes information data block. In the DVD standard, K=16 is adopted. The row (vertical) direction in the information data block is the (K. times. M) bytes data. In the (K. times. M) byte data in each of the N rows, (K. times. Q) bytes error-correcting code is created and added. Next, the row (vertical) direction in the information data block of FIG. 2 is N bytes data. Furthermore, the row number is (K. times. M)+(K. times. Q) row because of an increase in the previous error-correcting code (K. times. Q). In each of the (K. times. M)+(K. times
|
|