TH17839B - Data processing method to generate code blocks, product multiplication, error correction. And data processing methods to save this kind of information on the recording medium. The same is true for devices for processing this type of data. - Google Patents

Abstract

A data-processing method has been provided to generate multiplicative code blocks, correct errors. The one constituted in order to maintain the current redundancy level after editing capabilities. The fault has been tampered with. Due to the advancement of semiconductor technology and the spacing recording / relaying, unlike any known technique. Regardless of the configuration Product code block corrects errors according to Reed-Solomon principle, one of (M + PO) x (N + PI) bytes for one data of (MxN) byte, modified multiplicative code block data structure. One mistake will be made through the configuration. (Kx (M + 1) x (N + P)) bytes, product code, corrects errors according to Reed-Solomon principle for (KxMxN) byte data and makes K variable. The product code block corrects errors according to the Reed-Solomon principle, variable and at the same time. Error correction capability is proportional to the value of K with increasing redundancy.

Claims (5)

1. a method of processing data by generating, multiplicative code blocks, correcting errors, which Included First, process basic digital data by byte to formulate blocks of substance information. Information of a number of information blocks (MxN) bytes of M rows x N columns, allowing data to exist on a one-by-byte basis in an information block and allow data in each row to exist by Sequence from zero column to (N-1) column according to the relay sequence and respectively from the rows. At zero to row (M-1), according to the second relay sequence, provide a block matrix of (K x M) rows x N columns by using K of the information blocks that Are arranged in sequence according to the third-stage relay sequence, adding a check word to correct the K-byte first-term error to each column of (K x M) bytes of the matrix. Block to convert each column of N columns to words. The Reed-Solomon code is C2 of (Kx (M + 1)) byte, a check word for correcting K bytes, which exists on a one-by-byte basis at a position corresponding to every M byte. Information of information; And fourth, add a check word to correct the second error of P-byte to each of the N-byte rows to convert each of the (K x (M + 1)) rows to the principle code word. Of Reed-Solomon is C1 of (N + 1) byte, where: block, error correction product code is The product code block corrects the error according to the Reed-Solomon principle of (K x (M + 1) x (N + P)) byte, which contains the information segment of K of the information block of (K x M). x N) bytes, and the sum of (M x N) bytes of information blocks and the average number of bytes of check. Exams added to that section It is fixed with a constant of (M + 1) x (N + P) byte 2. Data processing method according to claim 1, where: Each information block contains data to be recorded on Medium sector For records, and individual blocks of information Includes: sector identification, error correction ID, system backup code, and fault detection code. 3. Data processing method according to Clause 2, where: Sector identification is totaled by four bytes, ID error is combined by two bytes, System reserved word is six bytes. 4. Data processing methods to save data in the recording medium by code generation. Error correction product Which includes First, digitally process data on a one-by-byte basis to formulate blocks of substance information. Information of a number of information blocks (MxN) bytes of M rows x N columns, allowing data contained on a one-by-byte basis in the information block and allowing data in each row to exist by Sequence from zero column to (N-1) column according to the relay sequence and respectively from the rows. At zero to row (M-1) following the second relay sequence, produce a matrix block of (K x M) rows x N columns by using K of the data block. The information is sorted in chronological order of the tertiary relay, adding a check word to correct the first K byte error to each column of (K x M) bi. Matrix block to convert each column of N columns to words. The Reed-Solomon based code is C2 of (Kx (M + 1)) byte, a check word for correcting K bytes, which exists on a one-by-byte basis at the position corresponding to every M. Byte of information information; And fourth, add a check word to correct the second P-byte to each row of N-byte to transform each row of (K x (M +1)) rows to the principle code word. Reed-Solomon's is C1 of (N + P) byte, where; Product code block, the product corrects the error is The product code block corrects the error Reed-Solomon's principle of (K x (M + 1) x (N + P) bytes, which contains the segment of K of the information block of (K x M x N). ) Bytes, and the sum of (M x N) bytes of information blocks and the average number of bytes of checks. Exams added to that section Will be based on the constant of (M + 1) x (N x P) byte 5. The data processing method according to one of the claims 1 and 2, where, to add test To correct the first error, a check word for correcting the first error of K byte is added to the tail end of each column of (K x M) byte for the code word format according to the principle. Reed-Slomon is C2 of (K x (M + 1)) byte for each row of N rows, and later the check word to correct the first error of the K byte is scattered again. On a one-by-byte basis to the location of every M byte of information 6.Method of data processing according to one of Claim No. 1 and 4, where: To add a check word to correct the first error, Reed Solomon's Code of Correction Code. Is C2 of (K x (M + 1)) bytes created. By arranging a one-byte position in every M-byte for each K-byte check request to correct the first error that will be added to. Each column of (K x M) byte 7.Data processing method according to one of Claims 1 and 4, where: the value of M x N at least 2,054 and less than 2,064, K. Is an even number with at least 12, P is an even number with the least value 10, the maximum value of K x (M + 1) is 255, and the most N + P is 255 8. Data processing method according to any of the Claims 1 and 4, where M = 12, N = 172, K = 16 and P = 10. 9. Data processing method according to which clause. One of Claims 1 and 4, where M = 12, N = 172, K = 12 and P = 10 1 0. Data processing method according to any of the Claims 1 and 4 by Where M = 12, N = 172, K = 18 and P = 10 1 1. The recording medium, which includes Block product code, correct the correct mistake. Recorded on it Where the data is processed and the code blocks, the error correction product is born. By methods which include First, digitally process data on a one-by-byte basis to formulate blocks of substance information. Information of a number of information blocks of (M x N) bytes of M rows x N columns, allowing data contained on a one-by-byte basis in the information block and allowing data in each row to exist by Sequence from zero column to (N-1) column according to the relay sequence. And respectively from Row center to row (M-1), following the second relay sequence, produce a matrix block of (K x M) row x N columns by using K of the clause block. The information is organized in a sequence of third-stage transmissions, adding a check word to correct K-byte first-word errors to each column of (K x M). Matrix block bytes to convert each N column into a word. The Reed-Solomon code is C2 of (K x (M + 1)) byte, a check word for correcting K bytes, which exists on a one-by-byte basis at the position corresponding to every M. Byte of information information; And fourth, add a check word to correct the second P-byte to each row of N-byte to convert each row of (K x (M + 1)) rows to the principle code word. Reed-Solomon's is C1 of (N + P) byte, where; Product code block, the product corrects the error is The product code block corrects the error Reed-Solomon's principle of (K x (M + 1) x (N + P) bytes, which contains the segment of K of the information block of (K x M x N). ) Bytes, and the sum of (M x N) bytes of information blocks. And the average number of bytes of check Exams added to that section It is fixed with a constant of (M + 1) x (N x P) byte 1 2. The recording medium, which includes The information blocks of (M x N) bytes of the error correction product code block are recorded consecutively in the sector where the data is The processing and error correction product code are generated by means of which include First, digitally process data on a one-by-byte basis to formulate blocks of substance information. Information of a number of information blocks of (M x N) bytes of M rows x N columns, allowing data contained on a one-by-byte basis in the information block and allowing data in each row to exist by Sequence from center column to column (N-1) according to relay sequence and sequentially from zero row to row (M-1) according to second stage relay sequence, Produce a matrix block of (K x M) rows x N columns by using K of data blocks, arranged in a sequential sequence of third-step transmissions, adding checks. Correct the first word of K byte for each column of (K x M) byte of the matrix block to convert each of the N columns into words. The Reed-Solomon code is C2 of (K x (M + 1)) byte, a check word for correcting K bytes, which exists on a one-by-byte basis at the position corresponding to every M. Byte of information information; And fourth, add a check word to correct the second P-byte to each row of N-byte to convert each row of (K x (M + 1)) rows to the principle code word. Reed-Solomon's is C1 of (N + P) byte, where; Product code block, the product corrects the error is The product code block corrects the error Reed-Solomon's principle of (K x (N + 1) x (N + P)) bytes, which contains the segment of K of the information block of (K x M x. N) bytes, and the sum of (M x N) bytes of information blocks. And the average number of bytes of check Exams added to that section It is fixed with the constant of (M + 1) x (N x P) byte 1. 3. Data processing method according to Clause 4, where: Each block of information contains information that Will be recorded on the medium sector For saving, and blocking each block of news information Includes: Sector Identification, Error Correction ID, System Backup Code, and Error Detection Code 1 4. Data processing method according to Clause 13 where: Sector Identification. The four bytes are included, the ID error correction word is combined by two bytes, the system backup word is six bytes, and the error code is 4 bytes. 5. Data processing device. Which includes A way for digital data processing on a one-by-byte basis to format data blocks. Information of a number of information blocks by (M x N) bytes of M rows x N columns. Pathways for digitizing data on a byte basis in the information block. And digitally arrange each row in order from zero column to (N-1) column according to the transmission sequence. And, respectively, from the center row to the row (M-1) according to the sequence of Convey information A path for arranging a (K x M) row x column block matrix by using K of the information blocks is arranged sequentially in a relay sequence. Method for adding a check word to correct the first K byte error to each column of (K x M) byte of the matrix block to convert each row of N rows to a code word. According to the Reed-Solomon principle, C2 of (K x (M + 1)) byte and a method for adding a check word to correct the first P-byte word to each N-byte row to Change each row of (K x (M + 1)) rows to Reed- Solomon's principle code word is C1 of (N + P) byte, where: block, error correction product code is The product code block corrects the error according to the Reed-Solomon principle (K x (M + 1) x (N + P)) byte, which contains the information segment of K of the information block of (K x M x. N) bytes, and the sum of (M x N) bytes of information blocks. And the average number of bytes of check Exams added to that section It is fixed with the constant of (M + 1) x (N + P) byte 1. 6. Data processing equipment according to claim 15, whereby the method for processing the multiplicative code block corrects the error. miss Are arranged in the device Telecommunications, a recording device for recording data on the soil or a processing device. Error Correction Results 1 7. Recording Medium Which includes a product block, product code, corrects correct mistakes Recorded on it, the error correction product code blocks are formatted by: digital data processing on a one-by-byte basis to hole the information blocks Of a certain number of blocks of information by (M x N) bytes of M rows x N columns. Digital allowance exists on a one-by-byte basis in the information block and allows the digital data in each row to exist by Sequence from center column to column (N-1) according to relay sequence and sequentially from zero row to row (M-1) according to allowance relay sequence. Block matrix of (K x M) rows x N columns exist, block matrix including k of data blocks arranged sequentially by the relay sequence. Adding a check word to correct the first K byte error to each column of (K x M) bytes of matrix block. To convert each of the N columns to a word, the Reed-Solomon code word is C2 of (K x (M + 1)) byte, a check word to correct the first error of K byte. On a one-by-byte basis, the position corresponds to all M bytes of information. Adding a second error correction word P-byte to each N-byte row to convert each row of (K x (M + 1)) rows to a Reed-Solomon code word. Is C1 of (N + P) byte, where: Block error correction product code is The product code block corrects errors according to the Reed-Solomon principle of (K x (M + 1) x (N + P)) bytes, which contains the K segment of the information block of ( K x M x N) bytes, sum of (M x N) bytes of information blocks. And the average number of bytes of check The exam added to that section is fixed with a constant of (M + 1) x (N + P) byte 1. 8. Transmit device for transmitting information. Which includes A method for allowing information blocks of a number of blocks of information. Includes (M x N) bytes of M rows x N columns. Pathways for allowing data to exist on a one-by-byte basis in a block of information. Let the data in each row exist in order from the center column to the column (N - 1) according to the transfusion sequence. Cast data and sequentially from zero row to row (M - 1) according to the relay sequence. Paths for allowing matrix blocks of (K x M) rows x N columns to exist, matrix blocks included K of information blocks arranged in a chronological order of Method for adding a check word to correct the K-byte first-term error to each column of (K x M) matrix block bytes to change each of the N columns to words The Reed-Solomon code is C2 of (K x (M + 1)) byte, a check word to correct a fault. The first K-byte error is based on a one-by-byte basis at the position corresponding to every M-byte of the information information. A path for adding a check word to correct a second p-byte to Each N-byte row to convert each row of (K x (M + 1)) rows to a Reed- Solomon code word is C1 of (N + P) byte, where: block, product code, edit product. The mistake is The product code block corrects the error according to the Reed-Solomon principle of (K x (M + 1)) x (N + P)) byte, which contains the k segment of the information block of (K x M). x N) bytes, and the sum of (M x N) bytes of information blocks and the average number of check bytes. The exam added to that section is fixed with a constant of (M + 1) x (N + P) byte 1. 9. The method of processing data by generating the product code block, correcting the error which Included Digital data processing on a byte basis To organize a hole in the information block Of a number of blocks of information by (M x N) bytes of M rows x N columns, allowing data It exists on a one-by-byte basis in an information block and allows the data in each row in sequence. The center column to the column (N-1) according to the transmission sequence and respectively from the zero row to the row (M - 1) according to the transmission sequence. Align a block matrix of (K x M) rows x N columns by using K of the data block. The information is organized in chronological order according to the transmission sequence. Adding a check word to correct the first K byte error to each column of (K x M) bytes of matrix block. To convert each of the N columns to a word, the Reed-Solomon code is C2 of (Kx (M + 1)) byte, a check word for correcting K bytes. Each byte at the position corresponds to all M bytes of information information; And adding a check word to correct a second error of P byte to each row of N byte to change and the row of (K x (M + 1)) rows to a Reed-based code word. Solomon is C1 of (N + P) byte, where: Block error correction product code is The product code block corrects errors according to the Reed-Solomon principle of (K x (M + 1) x (N + P)) bytes, which contains the K segment of the information block of ( K x M x N) bytes, and the sum of (M x N) bytes of information blocks and mean number of bytes of check. Exams added to that section It is fixed with a constant of (M + 1) x (N + P) bytes 2 0. A data processing method to save data in the recording medium by origin. Product code, error correction Which includes Digital data processing on a by-byte basis to hole blocks of information. Of a number of blocks of information by (M x N) bytes of M rows x N columns, allowing data They exist on a one-by-byte basis in blocks of information and allow data in only rows to exist, respectively. Column center to column (N-1) according to the relay sequence and dole sequence from row zero to row (M - 1) according to the transmission sequence. Aligning a block matrix of (K x M) rows x N columns using K of the substance block. Information is organized in chronological order according to the transmission sequence. Adding a check word to correct the first K-byte error to each column of (K x M) byte of the matrix block to convert each of the N columns to a code word according to the principle of Reed-Solomon is C2 of (K x (M + 1)) byte, a check word for correcting K bytes, it is based on a byte basis at the position corresponding to all M bytes of data. Information; and Adding a check word to correct a second error of P byte to each N byte row to change and the row of (K x (M + 1)) rows to the Reed-Solomon code word. Is C1 of (N + P) byte, where: Block error correction product code is The product code block corrects errors according to the Reed-Solomon principle of (K x (M + 1) x (N + P)) bytes, which contains the K segment of the information block of ( K x M x N) bytes, and the sum of (M x N) bytes of information blocks. And the average number of bytes of check Exams added to that section Is fixed with a constant of (M + 1) x (N + P) byte 2. 1. Method of data processing in accordance with Clause 19, where; Each information block contains information recorded on the mediation sector. For records, and individual blocks of information Includes: sector identification, LD error code, system backup code, and fault detection code 2. 2. Data processing method according to Clause 21, where: Sector identification is totaled by four bytes, ID error correction word is combined by two bytes, System reserved word is six bytes. 4 bytes, and error detection codes are included. 3. Data processing method according to Claim 20, where: Each information block contains data recorded on the mediation sector. For the log, and each information block contains: sector identification, LD error code, system backup code, and error detection code 2. 4. Data processing method according to Clause 23, where: Sector identification is totaled by four bytes, ID error correction word is combined by two bytes, System reserved word is six bytes. 4 bytes, and error detection codes are included. 5. A disc-type transducer created and arranged to extract the data from the optical disc. Which has the product code block, the product corrects the errors that are recorded on it. And optical disc type replaceable device Are created and arranged to perform the error correction process. Compared with the data that has been decoded, the optical disc type detach device is also included. A pathway for digital information processing on a one-byte basis. To shape the information blocks (M x N) bytes of M rows x N columns. The path for allowing data to exist on a one-by-byte basis in the information block and to allow the data in each row to exist, respectively. Column at center to column (N - 1) according to the sequence of Convey data and sequentially from zero row to row (M-1) according to the relay sequence. Paths for allowing matrix blocks of (K x M) rows x N columns to exist, matrix blocks included with K of information blocks arranged in order in the sequence of the relay. Method for adding a check word to correct the first K-byte error to each column of (K x M) matrix block bytes to convert each of the N columns into words. The Reed-Solomon code is C2 of (K x (M + 1)) byte, a check word for correcting K bytes on the floor by byte. At a position corresponding to all M bytes of information; And a way for adding a check word To correct the error, the second p-byte word for each N-byte row turns each row of (K x (M + 1)) rows to a Reed- Solomon code word, C1 of ( N + P) byte, where: block the product code, error correction is The product code block corrects the error according to the Reed-Solomon principle of (K x (M + 1)) x (N + P) byte, which contains the information segment of K of the information block of (K x M). x N) bytes, and the sum of (M x N) bytes of information blocks and the average number of check bytes. The exam added to that section is fixed with a constant of (M + 1) x (N + P) byte.