5–67
1
2
3
4
5
6
ït
çi
G3 FACSIMILE COMMUNICATIONS
Fig. 5-56 Mapping Rules in Trellis Coding (1)
If we focus on only expression by A to H regarding these 128 signal
points, of points A to H, four respective points A, B, C and D will be
selected under the condition Y0n=0. If the condition Y1n=0 is added to
each of these points A, B, C and D, the signal points to be selected will be
limited to two points, A and C. Further, of points A and C, A will be
selected if Y2n is 0, and C will be selected if Y2n is 1, and finally one of A
to H will be determined. Fig. 5-57 shows the finally selected point as a
large dot. If we focus on only the 16 points relating to point A selected
here, it can be seen that the minimum distance between each of the 16
points will be mapped to become twice the root extraction of 2 of the min-
imum distance between each of the 128 points.
C
7
B
6
C
3
C
1
A
1
D
3
F
9
H
0
H
7
F
4
H
3
F
8
H
1
A
6
D
5
A
4
D
13
A
8
C
5
E
5
G
2
E
13
G
10
B
2
C
11
B
10
A
14
H
15
F
6
H
11
D
9
A
12
E
9
G
0
B
0
B
7
B
15
C
9
H
5
F
2
H
9
F
0
D
4
A
2
D
12
A
0
G
3
E
4
G
11
E
12
B
1
G
1
D
8
A
10
F
14
H
13
F
10
B
3
C
13
F
12
B
11
E
14
G
15
E
6
G
7
E
7
G
6
E
15
G
14
A
7
C
6
A
15
C
14
D
1
D
0
E
1
G
8
G
9
E
0
B
8
C
10
B
9
C
12
H
14
F
13
H
10
F
15
H
12
F
11
A
13
D
11
D
2
A
11
D
10
E
10
G
13
E
2
G
5
E
3
G
4
E
11
G
12
C
8
B
13
C
4
B
5
B
4
C
2
B
12
C
0
H
2
F
5
H
6
F
7
H
4
F
3
H
8
F
1
D
14
A
3
D
6
A
5
D
7
A
9
D
15
E
8
B
14
C
15