Information Technology Reference
In-Depth Information
related location in [
P
], we may apply the method in step 7 to delete a classifier.
Then, [
] is recalculated.
For example, let's consider learning 6-path multiplexer. For every integer
M
k
>0,
the length of multiplexer of binary character string is
L
=
k
+ 2
k
. For every input
string, there are
k
address bits
a
i
and data bits
d
i
. Related string is expressed in
the following form:
d
a
0
a
1
… a
k-1
d
0
d
1
…
2
k
−
1
Table 13.1 Learning results of 6-path multiplexer
Function value is given by data bits(0 or 1). For example, the following are
the 6-path multiplexer' s input string and correct output value, where
L
= 6,
k
= 2:
