1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
|
====================================
Test of convolutional coders
====================================
------------------------------------------------------------------------------
1) Rate 1/2 code
------------------------------------------------------------------------------
Catastrophic test = 0
Code rate = 0.5
Spectrum:
* Ad = [0 0 0 0 0 0 0 0 0 0 11 0 38 0 193 0 1331 0 7275 0]
* Cd = [0 0 0 0 0 0 0 0 0 0 36 0 211 0 1404 0 11633 0 77433 0]
Spectrum, fast:
* Ad = [0 0 0 0 0 0 0 0 0 0 11 0 38 0 193 0 1331 0 7275 0]
* Cd = [0 0 0 0 0 0 0 0 0 0 36 0 211 0 1404 0 11633 0 77433 0]
Distance profile = [2 3 3 4 4 4 4]
Tail method test. Printing 30 bits starting from bit 1400:
* Input bits = [1 1 0 0 0 1 1 0 0 1 1 1 0 0 1 1 0 1 0 1 0 1 1 0 1 1 0 1 0 1]
* Coded bits = [0 1 0 1 0 1 1 1 1 0 0 0 0 1 0 1 0 1 0 0 0 1 1 1 0 0 0 1 1 0]
* Decoded bits = [1 1 0 0 0 1 1 0 0 1 1 1 0 0 1 1 0 1 0 1 0 1 1 0 1 1 0 1 0 1]
BER = 0
Tailbite method test. Printing 30 bits starting from bit 1400:
* Input bits = [1 1 0 0 0 1 1 0 0 1 1 1 0 0 1 1 0 1 0 1 0 1 1 0 1 1 0 1 0 1]
* Coded bits = [0 1 0 1 0 1 1 1 1 0 0 0 0 1 0 1 0 1 0 0 0 1 1 1 0 0 0 1 1 0]
* Decoded bits = [1 1 0 0 0 1 1 0 0 1 1 1 0 0 1 1 0 1 0 1 0 1 1 0 1 1 0 1 0 1]
BER = 0
Trunc method test. Printing 30 bits starting from bit 1400:
* Input bits = [1 1 0 0 0 1 1 0 0 1 1 1 0 0 1 1 0 1 0 1 0 1 1 0 1 1 0 1 0 1]
* Coded bits = [0 1 0 1 0 1 1 1 1 0 0 0 0 1 0 1 0 1 0 0 0 1 1 1 0 0 0 1 1 0]
* Decoded bits = [1 1 0 0 0 1 1 0 0 1 1 1 0 0 1 1 0 1 0 1 0 1 1 0 1 1 0 1 0 1]
BER = 0
------------------------------------------------------------------------------
1) Punctured code (R = 3/4)
------------------------------------------------------------------------------
Catastrophic test = 0
Code rate = 0.75
Puncture matrix = [[1 0 1]
[1 1 0]]
Tail method test. Printing 30 bits starting from bit 1400:
* Input bits = [0 0 0 0 1 1 0 1 1 1 0 0 0 0 1 1 0 0 0 0 0 1 1 1 1 0 1 0 1 0]
* Coded bits = [0 0 0 1 1 1 0 1 0 0 1 0 1 1 1 0 1 1 1 0 1 1 1 0 0 0 1 1 1 0]
* Decoded bits = [0 0 0 0 1 1 0 1 1 1 0 0 0 0 1 1 0 0 0 0 0 1 1 1 1 0 1 0 1 0]
BER = 0
Tailbite method test. Printing 30 bits starting from bit 1400:
* Input bits = [0 0 0 0 1 1 0 1 1 1 0 0 0 0 1 1 0 0 0 0 0 1 1 1 1 0 1 0 1 0]
* Coded bits = [0 0 0 1 1 1 0 1 0 0 1 0 1 1 1 0 1 1 1 0 1 1 1 0 0 0 1 1 1 0]
* Decoded bits = [0 0 0 0 1 1 0 1 1 1 0 0 0 0 1 1 0 0 0 0 0 1 1 1 1 0 1 0 1 0]
BER = 0
Trunc method test. Printing 30 bits starting from bit 1400:
* Input bits = [0 0 0 0 1 1 0 1 1 1 0 0 0 0 1 1 0 0 0 0 0 1 1 1 1 0 1 0 1 0]
* Coded bits = [1 0 1 0 1 1 1 0 0 0 1 1 1 1 0 1 0 1 0 1 0 1 0 1 1 0 0 1 1 1]
* Decoded bits = [0 0 0 0 1 1 0 1 1 1 0 0 0 0 1 1 0 0 0 0 0 1 1 1 1 0 1 0 1 0]
BER = 0
|
