- •Methodical instructions and the task for course work on discipline «data transmission systems»
- •The task for course work
- •Initial data
- •Cyclic code combination synthesis
- •7.1 Compositing of the information block
- •7.2 Choice of a generating polynomials of a cyclic code
- •7.3 Synthesis of a cyclic code combination
- •7.4 Check of correctness of reception resolved ccc
7.4 Check of correctness of reception resolved ccc
Check of correctness of a code combination of a cyclic code we will execute in the binary form. For this purpose it is necessary sequence F (x) in the binary form to combine on the module two with generating polynomials Р (x), also taken in the binary form (Р (x) 1001 1001). In case of correctness of construction, we will receive zero. We will check up it on the example resulted above.
|
100001100111001010000001111011 |
||||||||||
10011001 |
|
||||||||||
|
000111110111001010000001111011 |
||||||||||
10011001 |
|
||||||||||
|
011000101001010000001111011 |
||||||||||
10011001 |
|
||||||||||
|
01011100001010000001111011 |
||||||||||
10011001 |
|
||||||||||
|
0010000101010000001111011 |
||||||||||
10011001 |
|
||||||||||
|
00011100010000001111011 |
||||||||||
10011001 |
|
||||||||||
|
01111011000001111011 |
||||||||||
10011001 |
|
||||||||||
|
0110111100001111011 |
||||||||||
10011001 |
|
||||||||||
|
010001110001111011 |
||||||||||
10011001 |
|
||||||||||
|
00010111001111011 |
||||||||||
10011001 |
|
||||||||||
|
00100000111011 |
||||||||||
10011001 |
|
||||||||||
|
000110101011 |
||||||||||
10011001 |
|
||||||||||
|
010011001 |
||||||||||
10011001 |
|
||||||||||
|
0 |
||||||||||
As the remainder of division has turned out equal to zero formation of the resolved cyclic code combination was correct.