 |
Claims  |
|
|
What is claimed is:
1. A code conversion apparatus for generating run length limited codes
wherein m-bit data words are converted into n-bit code words which are
concatenated to form a bit sequence where a number of successive bits
having a same binary value is limited to a range of a smaller value d to a
larger value k, the apparatus comprising:
(a) means for classifying the code words into groups corresponding to the
respective data words, wherein each of the groups includes at least one
code word and any code words in respective different groups are different
from each other; and
(b) means for correcting selection of a code word W1 from a group
containing the code word W1 in accordance with only selection of a code
word W2, following the code word W1, from a group containing the code word
W2.
2. A code coversion apparatus for generating run length limited codes
wherein m-bit data words are converted into n-bit code words which are
concatenated to form a bit sequence where a number of successive bits
having a same binary value is limited to a range of a smaller value d to a
larger value k, the apparatus comprising:
(a) first generation means for generating an n-bit code word W2a
corresponding to an inputted m-bit data word;
(b) second generation mean for generating an n-bit code word W2b
corresponding to the inputted m-bit data word;
(c) first replacement means for replacing the code word W2a by a code word
W2a' in accordance with information related to a code word W1 preceding
the code word W2 and with information related to the code word W2a,
wherein the code word W2a' is precombined with the code word W2a;
(d) second replacement means for replacing the code word W2b by a code word
W2b' precombined with the code word W2b;
(e) first delay means for delaying the code word W2a or 22a';
(f) second delay means for delaying the code word W2b or W2b'; and
(g) means for selecting one of code words outputted from the first and
second delay means in accordance with information related to the code word
outputted from the first delay mean and with information related to the
code word W2a outputted from the first generation means.
3. The apparatus of claim 2 wherein the values d, k, m, and n are equal to
2, 10, 8, and 12 respectively.
4. The apparatus of claim 2 wherein the values d, k, m, and n are equal to
2, 12, 6, and 9 respectively.
5. The apparatus of claim 2 wherein output of the selecting means consists
of the output from the first generation means when there is a single code
word corresponding to the inputted data word.
6. The apparatus of claim 2 wherein output of the selecting means consists
of the output from the first replacement means when there are only two
code words W2a and W2a' corresponding to the inputted data word.
7. The apparatus of claim 2 wherein output of the selecting means consists
of one of the outputs from the first and second generation means when
there are only two code words W2a and W2b corresponding to the inputted
data word.
8. The apparatus of claim 2 further comprising:
(a) means for inserting a synchronous pattern allowing block
synchronization;
(b) means for dividing the n-bit code word into first and second sub code
words;
(c) first preliminary coding means for generating information identifying
the first sub code word;
(d) second preliminary coding means for generating information identifying
the second sub code word; and
(e) final coding means for deriving a m-bit data word, corresponding to the
n-bit code word inputted into the dividing means, from the outputs of the
first and second preliminary coding means.
9. The apparatus of claim 8 wherein code words of a first type are used to
correspond to data words and code words of a second type are used as
synchronous patterns, wherein an absolute value of a difference between a
number of bits having a binary value 1 and a number of bits having a
binary value 0 is equal to or smaller than 6 in each of the first type
code words, and wherein an absolute value of a difference between a number
of bits having a binary value 1 and a number of bits having a binary value
0 is equal to or greater than 8 in each of the second type code words.
10. A code conversion apparatus for generating run length limited codes
wherein data words are converted into code words which are concatenated to
form a bit sequence where a number of successive bits having a same binary
value is limited to a preset range, the apparatus comprising:
(a) means for generating a group of signals representing respective code
words corresponding to a first data word;
(b) means for generating a signal representing a code word corresponding to
a second data word following the first data word; and
(c) means for selecting one of the signals in the group in accordance with
only the code word corresponding to the second data word. |
|
 |
|
 |
Claims |
|
|
|
Description |
|
|
BACKGROUND OF THE INVENTION
1. Field of the Invention
This invention relates to a code conversion apparatus producing run-length
limited codes suitable for recording digital signals.
2. Description of the Prior Art
In case where digital data are recorded in magnetic tapes or discs at high
densities, run-length limited codes (referred to as RLL codes hereinafter)
are generally used. In an RLL code system, m-bit data words are converted
into respective n-bit code words, which are concatenated to form a bit
sequence where the number of successive bits having the same binary value
is limited to a range of a smaller value d to a larger value k.
RLL codes suitable for high density recording are generally required to
satisfy the following three known conditions.
[1] The detection window width Tw (=m/n.multidot.T) is wide, where the
letter T denotes the one-bit length of a data word.
[2] The minimal inversion interval Tmin (=d.multidot.Tw) is large.
[3] The maximal successive bit number k is small.
As the detection window width Tw increases, variations in the time axis,
such as jitters or peak shifts, less affect the rate of errors in coding
during reproduction or playback process. As the minimal inversion interval
Tmin increases, high-frequency component cut-off characteristics of
recording and reproducing systems less affect qualities of reproduced
digital signals. As the maximal successive bit number k decreases, it is
easier to obtain self clock function deriving clock information from a
reproduced or playback signal. Since the detection window width and the
minimal inversion interval greatly affect recording and reproducing
characteristics, they are important.
Heretofore, various RLL codes have been developed. U.S. Pat. No. 3,689,899
discloses 2/3 codes which are one type of RLL codes. In these 2/3 codes,
the values d, k, and Tw are equal to 2, 9, and 0.667 T respectively. The
2/3 codes constitute variable length RLL codes which change between a
first state where 2-bit data words are converted into 3-bit code words and
a second state where 4-bit data words are converted into 6-bit code words.
Although the 2/3 codes satisfy the previously-mentioned desired conditions
[1]-[3], the 2/3 codes have problems as follows. The 2/3 codes use both
the 2/3 conversion and the 4/6 conversion. Therefore, during the code
conversion of 8-bit digital video data, a boundary or pause between data
words sometimes extends over two words of video data. In this case, if an
error occurs in a code word, this error spreads or expands over the two
words of the video data during decoding. It should be noted that one word
of video data has 8 bits.
Although the 2/3 RLL codes are used to prevent an increase in the rate of
decoding errors in high density recording, the use of the 2/3 codes cause
expansions of decoding errors in some cases since the 2/3 codes are of the
variable length. Especially, in the case of video tape recorders for
personal or family use, the density of recording is generally set high to
allow a long recording. Accordingly, decoding errors are liable to occur
during play back process, and expansions of errors frequently occur when
the 2/3 RLL codes are used.
U.S. Pat. No. 3,852,687 discloses 8/13 codes which have the largest
detection window width among conventional RLL codes allowing direct code
conversion of 8-bit data words and having the value d equal to 2. The
detection window width of the 8/13 codes equals 0.615 T and is smaller
than the detection window width of the 2/3 codes. In general, the smaller
detection window width deteriorates the recording and reproducing
characteristics and also increases the error rate.
SUMMARY OF THE INVENTION
It is an object of this invention to provide a reliable code conversion
apparatus.
It is another object of this invention to provide a code conversion
apparatus allowing an acceptably low error rate.
In a code conversion apparatus of this invention, both of successive code
words W1 and W2 are controlled to satisfy desired limitations on the
values d and k. Accordingly, the number of different code words
constituting an RLL code system is increased so that an excellent RLL code
system can be obtained.
For example, the code conversion apparatus of this invention produces RLL
codes by directly converting 8-bit data words into 12-bit code words
(Tw=0.667 T). The produced RLL codes satisfy the following limitations on
the values d and k: d=2, k=10. These RLL codes prevent expansions of
errors.
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a block diagram of a code conversion apparatus according to a
first embodiment of this invention.
FIG. 2 is a diagram of the structure of a code word.
FIG. 3 is a diagram of concatenated code words.
FIG. 4 is a diagram of a synchronous pattern.
FIG. 5 is a block diagram of a decoder for an 8/12 code in the first
embodiment of this invention.
FIG. 6 is a block diagram of a decoder for a 6/9 code in a second
embodiment of this invention.
DESCRIPTION OF THE FIRST PREFERRED EMBODIMENT
A code conversion apparatus according to a first embodiment of this
invention produces and uses RLL codes having values m, n, d, and k equal
to 8, 12, 2, and 10 respectively. Accordingly, in the RLL code system used
in this embodiment, 8-bit data words are converted into 12-bit code words,
which are concatenated to form a bit sequence where the number of
successive bits having the same binary values is limited to a range of 2
to 10. The limitation defined by the values d and k will be referred to as
the d-k limitation hereinafter. For the sake of description, parameters
composed of an L block, a B block, and an R block are defined to classify
code words. As shown in FIG. 2, the L block consists of an l-bit start
portion of a code word where the same binary value TB successively occurs.
The R block consists of an r-bit end portion of the code word where the
same binary value LB successively occur. The B block consists of a b-bit
intermediate portion of the code word between the start and end portions
of the code word, where the bit number b equals 12-l-r.
The code words used in this embodiment satisfy the following conditions:
[I] The bit numbers l and r are in the range of 1 to 9.
[II] The B block completely satisfies the d-k limitation. In other words,
in the B block, the number of successive bits having the same binary value
is always in the range of 2 to 10.
In cases where the bit number b is different from 0, the condition [II]
means that the binary value 0 occurs in successive bits whose number is in
the range of the value d to the value k and the binary value 1 occurs in
successive bits whose number is in the range of the value d to the value k
in an alternate manner in the B block. In respect of the bit numbers l and
r, parameters F and E are defined as follows:
F=0 (l =1)
F=1 (l is in the range of 2 to 5)
F=2 (l is in the range of 6 to 9)
E=0 (r=1)
E=1 (r is in the range of 2 to 5)
E=2 (r is in the range of 6 to 9)
Concatenations between code words are controlled on the basis of the
previously defined parameters TB, F, E, and LB. In respect of the
concatenation between successive code words W1 and W2 o FIG. 3, this
control is designed so that a concatenated portion composed of the R block
of the first code word W1 and the L block of the second code word W2
satisfies the d-k limitation. The rules of the concatenation between the
code words are referred to as the concatenation rules.
Table 1 shows code word combination or group rules in this embodiment which
are defined on the basis of the previously-mentioned parameters TB, F, E,
and LB. In Table 1, the character CW-No. denotes a code word combination
or group number and an identification number of a code word in a group.
Code words in a group or combination correspond to a common data word.
In Table 1, the parameters TB, F, E, and LB relate to code words, and
examples of code words represented by these parameters are listed.
TABLE 1
__________________________________________________________________________
CW-No.
TB F E LB EXAMPLE (d = 2, k = 10)
__________________________________________________________________________
1.1 0 0 0 0 0 1 1 . . . . . . 1 1 0
1.2 0 0 0 1 0 1 1 . . . . . . 0 0 1
1.3 1 0 0 0 1 0 0 . . . . . . 1 1 0
1.4 1 0 0 1 1 0 0 . . . . . . 0 0 1
2.1 0 0 1 0 0 1 1 . . 1 1 0 0 0 0 0
2.2 1 0 1 1 1 0 0 . . 0 0 1 1 1 1 1
3.1 0 0 1 1 0 1 1 . . 0 0 1 1 1 1 1
3.2 1 0 1 0 1 0 0 . . 1 1 0 0 0 0 0
4.1 0 0 2 0 0 1 1 0 0 0 0 0 0 0 0 0
4.2 0 0 2 1 0 1 1 0 0 1 1 1 1 1 1 1
4.3 1 0 2 0 1 0 0 1 1 1 1 1 1 1 1 1
4.4 1 0 2 1 1 0 0 1 1 0 0 0 0 0 0 0
5.1 0 1 0 0 0 0 0 0 0 1 1 . . 1 1 0
5.2 0 1 0 1 0 0 0 0 0 1 1 . . 0 0 1
6.1 1 1 0 0 1 1 1 1 1 0 0 . . 1 1 0
6.2 1 1 0 1 1 1 1 1 1 0 0 . . 0 0 1
7 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0
8 0 1 1 1 0 0 1 1 1 1 0 0 0 0 1 1
9 1 1 1 0 1 1 0 0 0 0 1 1 0 0 0 0
10 1 1 1 1 1 1 1 1 0 0 0 0 1 1 1 1
11.1 0 1 2 0 0 0 1 1 0 0 0 0 0 0 0 0
11.2 0 1 2 1 0 0 1 1 0 0 1 1 1 1 1 1
12.1 1 1 2 0 1 1 1 0 0 0 0 0 0 0 0 0
12.2 1 1 2 1 1 1 0 0 1 1 1 1 1 1 1 1
13.1 0 2 0 0 0 0 0 0 0 0 0 0 0 1 1 0
13.2 0 2 0 1 0 0 0 0 0 0 0 1 1 0 0 1
13.3 1 2 0 0 1 1 1 1 1 1 1 0 0 1 1 0
13.4 1 2 0 1 1 1 1 1 1 1 1 1 1 0 0 1
14.1 0 2 1 0 0 0 0 0 0 0 0 0 1 1 0 0
14.2 1 2 1 1 1 1 1 1 1 1 1 1 0 0 1 1
15.1 0 2 1 1 0 0 0 0 0 0 0 0 1 1 1 1
15.2 1 2 1 1 1 1 1 1 1 1 1 1 0 0 0 0
__________________________________________________________________________
The code word combination or group rules of Table 1 will be described in
more detail hereinafter. In the following description, a code word A' has
an inverted pattern with respect to the pattern of a code word A and thus
results from the changes of the digital vaues 1 and 0 of the code word A.
[G1] A code word CW(F, E, 1) having the values F and E not equal to 1 and
the values TB and LB equal to 1, the inverted code word CW(F, E, 1)' the
code word CW(F, E, 0) having the same values F, E, and TB as those of the
code word CW(F, E, 1) and having the value LB equal to 0, and the inverted
code word CW(F, E, 0)' are combined to form a common group (see CW-No. =1,
4, and 13 of Table 1).
[G2] A code word CW(F, 1, X) having he value F not equal to 1 and the
values E and TB equal to 1, and the inverted code word CW(F, 1, X)' are
combined to form a common group (see CW-No. =2, 3, 14, and 15 of Table 1).
The letter X denotes either of 0 and 1.
[G3] A code word CW(1, E, )) having the values F, TB, and LB equal to 1 and
having the value E different from 1, and the code word CW(1, E, 0) having
the same values F, E, and TB as those of the code word CW(1, E, 1) and
having the value LB equal to 0 are combined to form a commonn group (see
CW-No. =5, 6, 11, and 12 of Table 1).
[G4] Code words CW(1, 1, X) having the values F and E equal to 1 form
different groups having single members respectively. Also, the inverted
code words CW(1, 1, X)' form different groups having signal members
respectively (see CW-No. =7, 8, 9, and 10 of Table 1).
According to the previously-mentioned rules [G1]-[G4] of code word
combinations or groups, as shown in Table 2, the d-k limitation is always
satisfied even when code words are concatenated. With reference to Table
2, in the case of a code word group containing a code word whose final bit
equals 0 and a code word whose final bit equals 1, it is necessary that
the value of a selection parameter S is defined as being equal to 0 or 1
to select one of the code words. In the case of other code word groups, it
is unnecessary to define the value of the selection parameter S and thus
the value S is denoted by the character "-".
In the case of 12-bit code words satisfying the previously-mentioned
conditions [I]and [II], the number of different code word combinations or
groups obtained through the rules [G1]-[G4] is 264 as shown in Tables
3A-3G. It should be noted that inverted code words are omitted from Tables
3A-3G. In Tables 3A-3G, the character DP denotes the absolute value of the
disparity of a code word, that is, the absolute value of the difference
between the number of bits having binary values equal to 1 and the number
of bits having binary values equal to 0 in a code word.
TABLE 2
__________________________________________________________________________
EXAMPLE (d = 2, k = 10)
PARAMETER FIRST SECOND
E LB F Y S CODE WORD CODE WORD
__________________________________________________________________________
0 0 0 1 -- . . . . . . . . . 1 1 0 0 1 1 . . . . . . . . .
0 1 0 0 -- . . . . . . . . . 0 0 1 1 0 0
.
.
. . . . . .
.
0 0 1 0 0 . . . . . . . . . 1 1 0 0 0 0
0
0
1 1 . . . .
.
0 1 1 0 1 . . . . . . . . . 0 0 1 1 1 1
1
1
0 0 . . . .
.
0 0 2 1 -- . . . . . . . . . 1 1 0 0 0 0
0
0
0 0 0 0 1 1
.
0 1 2 0 -- . . . . . . . . . 0 0 1 1 1 1
1
1
1 1 1 1 0 0
.
1 0 0 1 -- . . . . . 1 1 0 0 0 0 0 0 0 1
.
.
. . . . . .
.
1 1 0 0 -- . . . . . 0 0 1 1 1 1 1 1 0 0
.
.
. . . . . .
.
1 0 1 0 -- . . . . . 1 1 0 0 0 0 0 1 1 1
1
1
0 0 . . . .
.
1 0 1 0 -- . . . . . 1 1 0 0 0 0 0 0 0 0
0
0
1 1 . . . .
.
1 1 1 0 -- . . . . . 0 0 1 1 1 1 1 1 1 1
1
1
0 0 . . . .
.
1 1 1 0 -- . . . . . 0 0 1 1 1 1 1 0 0 0
0
0
1 1 . . . .
.
1 0 2 0 -- . . . . . 1 1 0 0 0 0 0 1 1 1
1
1
1 1 1 1 0 0
.
1 1 2 1 -- . . . . . 0 0 1 1 1 1 1 0 0 0
0
0
0 0 0 0 1 1
.
2 0 0 1 -- . 1 1 0 0 0 0 0 0 0 0 0 0 0 1
.
.
. . . . . .
.
2 1 0 0 -- . 0 0 1 1 1 1 1 1 1 1 1 1 0 0
.
.
. . . . . .
.
2 0 1 0 0 . 1 1 0 0 0 0 0 0 0 0 0 1 1 1
1
1
0 0 . . . .
.
2 1 1 0 1 . 0 0 1 1 1 1 1 1 1 1 1 0 0 0
0
0
1 1 . . . .
.
2 0 2 0 -- . 1 1 0 0 0 0 0 0 0 0 0 1 1 1
1
1
1 1 1 1 0 0
.
2 1 2 1 -- . 0 0 1 1 1 1 1 1 1 1 1 0 0 0
0
0
0 0 0 0 1 1
.
__________________________________________________________________________
TABLE 3A
______________________________________
No. CODE WORD DP
______________________________________
1 1 1 1 1 0 0 1 1 0 0 0 0
0
2 1 1 1 0 0 1 1 1 0 0 0 0
0
3 1 1 1 1 0 0 0 1 1 0 0 0
0
4 1 1 1 0 0 0 1 1 1 0 0 0
0
5 1 1 0 0 1 1 1 1 0 0 0 0
0
6 1 1 1 1 0 0 0 0 1 1 0 0
0
7 1 1 0 0 0 1 1 1 1 0 0 0
0
8 1 1 1 0 0 0 0 1 1 1 0 0
0
9 1 1 0 0 1 1 0 0 1 1 0 0
0
10 1 1 0 0 0 0 1 1 1 1 0 0
0
11 1 1 0 0 1 1 1 0 0 0 0 0
2
12 1 1 1 1 0 0 0 1 1 1 0 0
2
13 1 1 1 0 0 1 1 0 0 0 0 0
2
14 1 1 1 0 0 1 1 1 1 0 0 0
2
15 1 1 1 0 0 0 0 1 1 0 0 0
2
16 1 1 1 1 0 0 1 1 1 0 0 0
2
17 1 1 1 0 0 0 1 1 0 0 0 0
2
18 1 1 1 0 0 0 1 1 1 1 0 0
2
19 1 1 0 0 0 0 1 1 1 0 0 0
2
20 1 1 1 1 1 0 0 1 1 0 0 0
2
21 1 1 0 0 1 1 1 1 1 0 0 0
2
22 1 1 1 0 0 0 0 0 1 1 0 0
2
23 1 1 1 1 1 0 0 0 1 1 0 0
2
24 1 1 0 0 0 1 1 1 0 0 0 0
2
25 1 1 0 0 0 1 1 1 1 1 0 0
2
26 1 1 0 0 0 0 0 1 1 1 0 0
2
27 1 1 0 0 0 0 0 1 1 0 0 0
4
28 1 1 0 0 0 0 1 1 0 0 0 0
4
29 1 1 1 1 1 0 0 1 1 1 0 0
4
30 1 1 0 0 0 1 1 0 0 0 0 0
4
31 1 1 1 1 0 0 1 1 1 1 0 0
4
32 1 1 1 0 0 1 1 1 1 1 0 0
4
33 1 1 0 0 1 1 1 1 1 1 0 0
4
34 1 1 0 0 0 0 0 0 1 1 0 0
4
35 1 1 0 0 0 0 0 0 1 1 1 1
0
36 1 1 1 0 0 0 0 0 0 1 1 1
0
37 1 1 1 1 0 0 0 0 0 0 1 1
0
38 1 1 0 0 0 1 1 0 0 0 1 1
0
39 1 1 0 0 1 1 0 0 0 0 1 1
0
40 1 1 0 0 0 0 1 1 0 0 1 1
0
41 1 1 1 1 0 0 0 0 0 1 1 1
2
42 1 1 0 0 1 1 0 0 0 1 1 1
2
43 1 1 1 0 0 1 1 0 0 0 1 1
2
44 1 1 0 0 0 1 1 0 0 1 1 1
2
45 1 1 1 0 0 0 1 1 0 0 1 1
2
46 1 1 0 0 0 0 0 0 0 1 1 1
2
47 1 1 1 0 0 0 0 0 0 0 1 1
2
48 1 1 0 0 1 1 1 0 0 0 1 1
2
49 1 1 1 1 1 0 0 0 0 0 1 1
2
50 1 1 0 0 0 1 1 1 0 0 1 1
2
51 1 1 0 0 0 0 0 1 1 1 1 1
2
52 1 1 1 0 0 0 0 0 1 1 1 1
2
53 1 1 1 1 0 0 0 0 1 1 1 1
4
54 1 1 1 1 1 0 0 0 0 1 1 1
4
55 1 1 1 0 0 0 0 1 1 1 1 1
4
56 1 1 0 0 1 1 0 0 1 1 1 1
4
57 1 1 1 0 0 1 1 0 0 1 1 1
4
58 1 1 0 0 1 1 1 0 0 1 1 1
4
59 1 1 1 0 0 1 1 1 0 0 1 1
4
60 1 1 0 0 1 1 1 1 0 0 1 1
4
______________________________________
TABLE 3B
______________________________________
No. CODE WORD DP
______________________________________
61 1 1 1 1 0 0 1 1 0 0 1 1
4
62 1 1 0 0 0 0 0 0 0 0 1 1
4
63 1 1 1 1 0 0 0 1 1 1 1 1
6
64 1 1 1 1 1 0 0 0 1 1 1 1
6
65 0 0 0 0 1 1 0 0 1 1 1 1
0
66 0 0 0 1 1 0 0 0 1 1 1 1
0
67 0 0 0 0 1 1 1 0 0 1 1 1
0
68 0 0 0 1 1 1 0 0 0 1 1 1
0
69 0 0 1 1 0 0 0 0 1 1 1 1
0
70 0 0 0 0 1 1 1 1 0 0 1 1
0
71 0 0 1 1 1 0 0 0 0 1 1 1
0
72 0 0 0 1 1 1 1 0 0 0 1 1
0
73 0 0 1 1 0 0 1 1 0 0 1 1
0
74 0 0 1 1 1 1 0 0 0 0 1 1
0
75 0 0 1 1 0 0 0 1 1 1 1 1
2
76 0 0 0 0 1 1 1 0 0 0 1 1
2
77 0 0 0 1 1 0 0 1 1 1 1 1
2
78 0 0 0 1 1 0 0 0 0 1 1 1
2
79 0 0 0 1 1 1 1 0 0 1 1 1
2
80 0 0 0 0 1 1 0 0 0 1 1 1
2
81 0 0 0 1 1 1 0 0 1 1 1 1
2
82 0 0 0 1 1 1 0 0 0 0 1 1
2
83 0 0 1 1 1 1 0 0 0 1 1 1
2
84 0 0 0 0 0 1 1 0 0 1 1 1
2
85 0 0 1 1 0 0 0 0 0 1 1 1
2
86 0 0 0 1 1 1 1 1 0 0 1 1
2
87 0 0 0 0 0 1 1 1 0 0 1 1
2
88 0 0 1 1 1 0 0 0 1 1 1 1
2
89 0 0 1 1 1 0 0 0 0 0 1 1
2
90 0 0 1 1 1 1 1 0 0 0 1 1
2
91 0 0 1 1 1 1 1 0 0 1 1 1
4
92 0 0 1 1 1 1 0 0 1 1 1 1
4
93 0 0 0 0 0 1 1 0 0 0 1 1
4
94 0 0 1 1 1 0 0 1 1 1 1 1
4
95 0 0 0 0 1 1 0 0 0 0 1 1
4
96 0 0 0 1 1 0 0 0 0 0 1 1
4
97 0 0 1 1 0 0 0 0 0 0 1 1
4
98 0 0 1 1 1 1 1 1 0 0 1 1
4
99 0 0 1 1 1 1 1 1 0 0 0 0
0
100 0 0 0 1 1 1 1 1 1 0 0 0
0
101 0 0 0 0 1 1 1 1 1 1 0 0
0
102 0 0 1 1 1 0 0 1 1 1 0 0
0
103 0 0 1 1 0 0 1 1 1 1 0 0
0
104 0 0 1 1 1 1 0 0 1 1 0 0
0
105 0 0 0 0 1 1 1 1 1 0 0 0
2
106 0 0 1 1 0 0 1 1 1 0 0 0
2
107 0 0 0 1 1 0 0 1 1 1 0 0
2
108 0 0 1 1 1 0 0 1 1 0 0 0
2
109 0 0 0 1 1 1 0 0 1 1 0 0
2
110 0 0 1 1 1 1 1 1 1 0 0 0
2
111 0 0 0 1 1 1 1 1 1 1 0 0
2
112 0 0 1 1 0 0 0 1 1 1 0 0
2
113 0 0 0 0 0 1 1 1 1 1 0 0
2
114 0 0 1 1 1 0 0 0 1 1 0 0
2
115 0 0 1 1 1 1 1 0 0 0 0 0
2
116 0 0 0 1 1 1 1 1 0 0 0 0
2
117 0 0 0 0 1 1 1 1 0 0 0 0
4
118 0 0 0 0 0 1 1 1 1 0 0 0
4
119 0 0 0 1 1 1 1 0 0 0 0 0
4
120 0 0 1 1 0 0 1 1 0 0 0 0
4
______________________________________
TABLE 3C
______________________________________
No. CODE WORD DP
______________________________________
121 0 0 0 1 1 0 0 1 1 0 0 0
4
122 0 0 1 1 0 0 0 1 1 0 0 0
4
123 0 0 0 1 1 0 0 0 1 1 0 0
4
124 0 0 1 1 0 0 0 0 1 1 0 0
4
125 0 0 0 0 1 1 0 0 1 1 0 0
4
126 0 0 1 1 1 1 1 1 1 1 0 0
4
127 0 0 0 0 1 1 1 0 0 0 0 0
6
128 0 0 0 0 0 1 1 1 0 0 0 0
6
129 1 0 0 1 1 1 1 1 0 0 0 0
0
130 1 0 0 0 1 1 1 1 1 0 0 0
0
131 1 0 0 1 1 0 0 1 1 1 0 0
0
132 1 0 0 1 1 1 0 0 1 1 0 0
0
133 1 0 0 0 0 1 1 1 1 1 0 0
0
134 1 0 0 0 1 1 1 1 0 0 0 0
2
135 1 0 0 1 1 1 1 1 1 0 0 0
2
136 1 0 0 1 1 1 1 0 0 0 0 0
2
137 1 0 0 1 1 0 0 0 1 1 0 0
2
138 1 0 0 1 1 0 0 1 1 0 0 0
2
139 1 0 0 0 1 1 0 0 1 1 0 0
2
140 1 0 0 0 0 1 1 1 1 0 0 0
2
141 1 0 0 0 0 0 1 1 1 1 0 0
2
142 1 0 0 0 1 1 1 1 1 1 0 0
2
143 1 0 0 0 0 0 1 1 1 0 0 0
4
144 1 0 0 0 1 1 1 0 0 0 0 0
4
145 1 0 0 0 0 1 1 1 0 0 0 0
4
146 1 0 0 0 0 0 0 1 1 1 0 0
4
147 1 0 0 1 1 1 1 1 1 1 0 0
4
148 1 0 0 0 0 0 1 1 0 0 0 0
6
149 1 0 0 0 0 1 1 0 0 0 0 0
6
150 1 0 0 0 0 0 0 1 1 0 0 0
6
151 1 0 0 0 0 0 0 0 1 1 0 0
6
152 1 0 0 0 0 0 0 1 1 1 1 1
0
153 1 0 0 0 1 1 0 0 0 1 1 1
0
154 1 0 0 1 1 0 0 0 0 1 1 1
0
155 1 0 0 0 0 1 1 0 0 1 1 1
0
156 1 0 0 0 1 1 1 0 0 0 1 1
0
157 1 0 0 1 1 1 0 0 0 0 1 1
0
158 1 0 0 0 0 1 1 1 0 0 1 1
0
159 1 0 0 0 1 1 0 0 1 1 1 1
2
160 1 0 0 0 0 0 0 0 1 1 1 1
2
161 1 0 0 1 1 1 0 0 0 1 1 1
2
162 1 0 0 1 1 0 0 0 1 1 1 1
2
163 1 0 0 1 1 1 1 0 0 0 1 1
2
164 1 0 0 0 1 1 0 0 0 0 1 1
2
165 1 0 0 0 1 1 1 1 0 0 1 1
2
166 1 0 0 0 0 1 1 0 0 0 1 1
2
167 1 0 0 0 1 1 1 0 0 1 1 1
2
168 1 0 0 1 1 0 0 0 0 0 1 1
2
169 1 0 0 0 0 0 1 1 0 0 1 1
2
170 1 0 0 1 1 1 1 0 0 1 1 1
4
171 1 0 0 1 1 0 0 1 1 1 1 1
4
172 1 0 0 0 0 0 0 0 0 1 1 1
4
173 1 0 0 1 1 1 1 1 0 0 1 1
4
174 1 0 0 1 1 1 0 0 1 1 1 1
4
175 1 0 0 0 0 0 0 0 0 0 1 1
6
176 1 1 1 1 1 1 1 0 0 0 0 0
2
177 1 1 1 1 1 1 0 0 1 1 0 0
4
178 1 1 1 1 1 1 1 1 0 0 0 0
4
179 1 1 1 1 1 1 1 1 1 0 0 0
6
180 1 1 1 1 1 1 0 0 0 0 1 1
4
______________________________________
TABLE 3D
______________________________________
No. CODE WORD DP
______________________________________
181 1 1 1 1 1 1 1 0 0 0 1 1
6
182 1 1 1 1 1 1 0 0 0 1 1 1
6
______________________________________
No. CODE WORD 1 DP CODE WORD 2 DP
______________________________________
183 1 1 1 1 0 0 0 0 0 1 1 0
0 1 1 1 1 1 0 0 0 0 0 0 1
0
184 1 1 1 0 0 0 0 0 1 1 1 0
0 1 1 1 0 0 0 1 1 0 0 0 1
0
185 1 1 0 0 1 1 0 0 0 1 1 0
0 1 1 1 0 0 1 1 0 0 0 0 1
0
186 1 1 0 0 0 1 1 0 0 1 1 0
0 1 1 1 0 0 0 0 1 1 0 0 1
0
187 1 1 0 0 0 0 0 1 1 1 1 0
0 1 1 0 0 0 1 1 1 0 0 0 1
0
188 1 1 1 1 0 0 0 0 1 1 1 0
2 1 1 0 0 1 1 1 0 0 0 0 1
0
189 1 1 1 0 0 0 0 0 0 1 1 0
2 1 1 0 0 0 0 1 1 1 0 0 1
0
190 1 1 0 0 1 1 0 0 1 1 1 0
2 1 1 1 1 0 0 0 1 1 0 0 1
2
191 1 1 1 1 1 0 0 0 0 1 1 0
2 1 1 1 1 0 0 0 0 0 0 0 1
2
192 1 1 0 0 1 1 1 0 0 1 1 0
2 1 1 1 0 0 1 1 1 0 0 0 1
2
193 1 1 1 0 0 1 1 0 0 1 1 0
2 1 1 1 1 0 0 1 1 0 0 0 1
2
194 1 1 0 0 0 0 1 1 1 1 1 0
2 1 1 0 0 1 1 1 1 0 0 0 1
2
195 1 1 1 0 0 0 0 1 1 1 1 0
2 1 1 0 0 0 1 1 0 0 0 0 1
2
196 1 1 0 0 0 0 0 0 1 1 1 0
2 1 1 0 0 0 1 1 1 1 0 0 1
2
197 1 1 1 1 1 0 0 0 1 1 1 0
4 1 1 0 0 0 0 1 1 0 0 0 1
2
198 1 1 1 1 0 0 0 1 1 1 1 0
4 1 1 1 0 0 0 1 1 1 0 0 1
2
199 1 1 0 0 0 1 1 1 1 1 1 0
4 1 1 0 0 1 1 0 0 0 0 0 1
2
200 1 1 1 0 0 0 1 1 1 1 1 0
4 1 1 0 0 0 0 0 1 1 0 0 1
2
201 1 1 0 0 0 0 0 0 0 1 1 0
4 1 1 1 0 0 1 1 1 1 0 0 1
4
202 1 1 1 1 1 0 0 1 1 1 1 0
6 1 1 1 1 1 0 0 1 1 0 0 1
4
203 1 1 1 0 0 1 1 1 1 1 1 0
6 1 1 1 0 0 0 0 0 0 0 0 1
4
204 1 1 0 0 1 1 1 1 1 1 1 0
6 1 1 0 0 1 1 1 1 1 0 0 1
4
205 1 1 1 1 0 0 1 1 1 1 1 0
6 1 1 1 1 0 0 1 1 1 0 0 1
4
206 0 0 0 0 1 1 1 1 1 0 0 1
0 0 0 0 0 0 1 1 1 1 1 1 0
0
207 0 0 0 1 1 1 1 1 0 0 0 1
0 0 0 0 1 1 1 0 0 1 1 1 0
0
______________________________________
TABLE 3E
______________________________________
No. CODE WORD 1 DP CODE WORD 2 DP
______________________________________
208 0 0 1 1 0 0 1 1 1 0 0 1
0 0 0 0 1 1 0 0 1 1 1 1 0
0
209 0 0 1 1 1 0 0 1 1 0 0 1
0 0 0 0 1 1 1 1 0 0 1 1 0
0
210 0 0 1 1 1 1 1 0 0 0 0 1
0 0 0 1 1 1 0 0 0 1 1 1 0
0
211 0 0 0 0 1 1 1 1 0 0 0 1
2 0 0 1 1 0 0 0 1 1 1 1 0
0
212 0 0 0 1 1 1 1 1 1 0 0 1
2 0 0 1 1 1 1 0 0 0 1 1 0
0
213 0 0 1 1 0 0 1 1 0 0 0 1
2 0 0 0 0 1 1 1 0 0 1 1 0
2
214 0 0 0 0 0 1 1 1 1 0 0 1
2 0 0 0 0 1 1 1 1 1 1 1 0
2
215 0 0 1 1 0 0 0 1 1 0 0 1
2 0 0 0 1 1 0 0 0 1 1 1 0
2
216 0 0 0 1 1 0 0 1 1 0 0 1
2 0 0 0 0 1 1 0 0 1 1 1 0
2
217 0 0 1 1 1 1 0 0 0 0 0 1
2 0 0 1 1 0 0 0 0 1 1 1 0
2
218 0 0 0 1 1 1 1 0 0 0 0 1
2 0 0 1 1 1 0 0 1 1 1 1 0
2
219 0 0 1 1 1 1 1 1 0 0 0 1
2 0 0 1 1 1 0 0 0 0 1 1 0
2
220 0 0 0 0 0 1 1 1 0 0 0 1
4 0 0 1 1 1 1 0 0 1 1 1 0
2
221 0 0 0 0 1 1 1 0 0 0 0 1
4 0 0 0 1 1 1 0 0 0 1 1 0
2
222 0 0 1 1 1 0 0 0 0 0 0 1
4 0 0 1 1 0 0 1 1 1 1 1 0
2
223 0 0 0 1 1 1 0 0 0 0 0 1
4 0 0 1 1 1 1 1 0 0 1 1 0
2
224 0 0 1 1 1 1 1 1 1 0 0 1
4 0 0 0 1 1 0 0 0 0 1 1 0
4
225 0 0 0 0 0 1 1 0 0 0 0 1
6 0 0 0 0 0 1 1 0 0 1 1 0
| | |
