Unified Error Correction and Error Detection Code Generator
A technology of error detection codes and code blocks, which is applied in the field of unified error correction and error detection code generators, and can solve the problem of useless protection of information bit blocks
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0133] Such as figure 2 shown in, in this example, with x 3 +x 2 +1 the corresponding CRC generator is used. There are three registers, represented by R1, R2 and R3. There are two XOR operators, denoted by X1 and X2.
[0134] Assumed information bits [b n-1 ,b n-2 ,...,b 2 ,b 1 ,b 0 ] will be processed. Furthermore, the information bits are sent into the CRC generator one by one based on the ascending order of their index.
[0135] In this example, 3 auxiliary bits will be generated. For other numbers of auxiliary bits, a similar approach can be used.
[0136] One scheme to generate 3 auxiliary bits is based on the number of input information bits. When 4, 6 and 8 information bits are respectively input, the auxiliary bits are obtained as the value of the first register R1.
[0137] When 4 information bits b 0 to b 3 is entered, the first register has the value c 0 =b 0 +b 3 , which is the first auxiliary bit.
[0138] When 6 information bits b 0 to b 5 i...
Embodiment 2
[0145] In this example, image 3 The CCITT CRC-16 generator shown in is used. It includes 16 registers represented by R0-R15 and three XOR operators.
[0146] information bits [b n-1 ,b n-2 ,...,b 2 ,b 1 ,b 0 ] will be processed. The information bits are sent into the CRC generator one by one based on the ascending order of their index.
[0147] The 16 CRC bits are obtained by fetching the register value when all n information bits are input into the generator. In this embodiment, the number of auxiliary bits J'=4. When 18, 19, 20, 21 information bits are respectively input into the CRC generator, the auxiliary bit is obtained by fetching the value of the register R5. Then, the four auxiliary bits are:
[0148] c 0 =b 1 +b 17 +b 12
[0149] c 1 =b 2 +b 18 +b 13
[0150] c 2 =b 3 +b 19 +b 14
[0151] c 3 =b 4 +b 20 +b 15
[0152] In this embodiment, the auxiliary bits are transmitted after permutation so that they follow their corresponding informa...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


