Data processing method and apparatus, recording medium, reproducing method and apparatus
AssigneeKabushiki Kaisha Toshiba
InventorTadashi Kojima
Life of this patent
Estimating the term…
Abstract
A row of the data block which is a set of the data sector is distributed to constitute two blocks. In this case, as a distribution condition, an even-number row block of the even-number sector and the odd-number row block of the even-number sector, the odd-number row block of the even-number sector and an even-number row block of the even-number sector are obtained. Then, the block is aggregated in the transmission order, and an outer parity is scattered to each sector to form an interleaved form.
Claims10
A data processing method comprising the steps of:
- arranging data in bytes in a matrix direction to form information data block;
- constituting an outer parity with respect to 32k bytes unit of the information data block as an error correction code;
- and
- further adding an overall error correcting code including the outer parity in the 62k byte unit of the information data block.
A data processing method, wherein:
- digital data is processed in bytes to configure one information data block in (M×N) bytes of M rows N columns;
- data is arranged in bytes in the information data block, so that data is arranged in the data transmission order from the 0th column to the (N−1)-th column for each row while data is arranged in the data transmission order from the 0-th row to the (M−1)-th row;
- (K×M) rows×N columns matrix block is further constructed which is a set of the information data block, and which is constituted of K information data blocks composed of information data blocks from the 0-th information data block to the (K−1)-th information data block which continue in the data transmission order;
- on each column of (K×N) bytes of the matrix block, an error-correcting word PO-b{(K/2)×Q bytes} is created with respect to the (K/2)×(mi+mj) bytes which is constituted by aggregating the even-number rows and the odd-number rows specified in the K information data block order, and an error-correcting word PO-b {(K/2)×Q} bytes is created with respect to the (K/2)×(mj+mi) bytes which is constituted by aggregating the remaining even-number rows and the odd-number rows specified in the K information data blocks;
- PO-a and PO-b are scattered and arranged into K information data blocks constituted of (M×N) bytes of N rows and N columns so that
- each column of N columns is formed as two sets of Reed-Solomon code PO of (K/2)×(mi+mj)+Q) bytes and (K/2)×(mj+mi)+Q) bytes (however, M=mi (the number of even-number rows)+mj (the number of odd-number rows) and (Q is an integar of 1 or more));
- and
- the error-correcting word of P bytes is further added for each row of N bytes;
- whereby as an overall block an error-correcting product code block is realized which constitutes (K×(M+Q))×(N+F)) or (K×(M+2Q)×(N+P)) bytes Reed-Solomon error-correcting word having K information data block of (K×M×N) bytes as information portion.
A data processing apparatus, wherein:
- digital data is processed in bytes to configure one information data block in (M×N) bytes of M rows and N columns;
- data is arranged in bytes in the information data block, so that data is arranged in the data transmission order from the 0th column to the (N−1)-th column for each row while data is arranged in the data transmission order from the 0-th row to the (M−1)-th row;
- (K×M) rows×N columns matrix block is further constructed which is a set of the information data block, and which is constituted of K information data blocks composed of information data blocks from the 0th information data block to the (K−1)-th information data block which continue in the data transmission order;
- on each column of (K×N) bytes of the matrix block, an error-correcting word PO-a{(K/2)×Q bytes} is created with respect to the (k/2)×(mi+mj) bytes which is constituted by aggregating the even-number rows and the odd-number rows specified in the K information data block order, and an error-correcting word PO-b {(K/2)×Q} bytes is created with respect to the (K/2)×(mj+mi) bytes which is constituted by aggregating the remaining even-number rows and the odd-number rows specified in the K information data blocks;
- PO-a and PO-b are scattered and arranged into K information data blocks constituted of (M×N) bytes of M rows and N columns so that each column of N columns is formed as two sets of Reed-Solomon code PO of (K/2)×(mi+mj)+Q) bytes and (K/2)×(mj+mi)+Q) bytes (however, M=mi (the number of even-number rows)+mj (the number of odd-number rows) and (Q is an integar of 1 or more));
- and
- the error-correcting word of P bytes is further added for each row of N bytes;
- whereby as an overall block an error-correcting product code block is realized which constitutes (K×(M+Q)×(N+P)) or (K×(M+2Q)×(N+P)) bytes Reed-Solomon error-correcting word having K information data blocks of (K×M×N) bytes as information portion.
Dependencies are inferred from the claim text.