A Recognition Method of Systematic RS Code Order and Primitive Polynomial
A primitive polynomial and identification method technology, which is applied in the field of system RS code order and primitive polynomial identification, can solve problems such as large amount of computation, poor error tolerance, and large amount of data, and achieves the effect of small amount of computation
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0093] The RS code of the system to be identified is (31, 25) RS code, the order is m=5, and the primitive polynomial p(x)=1+x+x 3 +x 4 +x 5 , the bit error rate is 0.001.
[0094] The specific identification process is as follows:
[0095] i. In practical applications, the order of RS codes is generally not greater than 8, so take mSet=[3,4,5,6,7,8], and take M=200;
[0096] ii. Traverse mSet=[3,4,5,6,7,8];
[0097] iii. Traverse all orders of mSet and all primitive polynomials under this order, construct corresponding binary check matrix, and calculate checksum, as shown in Table 1;
[0098] iii. It can be seen from Table 1 that when s=3 and z=5, the checksum takes the minimum value, so there are m e =m 3 =5,p e (x)=p 3,5 (x)=1+x+x 3 +x 4 +x 5 .
[0099] Thus, the correct recognition of order and primitive polynomials is realized.
[0100] Table 1 Checksums under different orders and different primitive polynomials
[0101]
[0102] Summary The present inven...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


