Академический Документы
Профессиональный Документы
Культура Документы
Rajtsin M.A. Boolean Function Graph Minimization
Rajtsin M.A. Boolean Function Graph Minimization
324
.
..
. ..
1. .
().
[2].
,
,
.
( ).
,
( ). ,
, [1].
: , , .
,
() , .
,
1.
,
.
,
. ,
.
() ,
.
2. .
1. ( ,
).
, ,
(), . ,
, ,
dmin
: , .. i-
x,
1-6 , (i+1)
x ( , ).
2. , ,
(
), 1.
3.
3. ,
:
) L(F) = 2k //
) Q(F) k // ( )
3.1 P
, .
3.2 G
, ,
P.
3.3 p n, n -
. i- ( ,
2),
.
1.
G - (
) p.
.
, , ,
.
2k ( n).
k 2k, .
3.4 .
3.5 2j,
.
3.6 j
2j, C j
. j .
j := j 1 , 3.4
3.7 C dreal ( dreal dmin )
,
, .
4. , C.
1, 1 (
). 0
0. , ,
( -
).
5. :
a. ,
F
b. ,
0
c.
1
6. , .
, dreal.
, (
). 1.
:
000000
000000
001000
000100
{100100
}
001000
{100100
}
000100
{001100}
{001100}
011000
011000
010000
010000
011100
011100
110100
110100
01001
01001
{010100}
{010100}
010011
010101
010101
000000
000000
{100100}
001000
{100100}
001000
000100
000100
{001100}
{001100}
011000
011000
010000
010000
011100
011100
110100
110100
{010100}
{010100}
010101
010101
000000
000000
{100100}
001000
001000
000100
000100
{001100}
{001100}
011000
011000
010000
010000
011100
110100
011100
{010100}
{010100}
1
2
3
4
X0
010011
010010
010101
110100
000000
dmi
1
1
2
P
x6
x6
x1,x2
x2,x3,x4
G
010011,010010
010101,010100
110100,100100,
000100,010100
000000,000100,
010100,010000,
011000,001000,
001100,011100
P
dreal
[0,0,0,0,0,2] 1
[0,0,0,0,0,2] 1
[4,4,0,0,0,0] 2
C
01001
01010--0100
[0,8,8,8,0,0]
0---00
= x 1 x 2 x 3 x 4 x 5 x 1 x 2 x 3 x 4 x 5 x 3 x 4 x 5 x 6 x 1 x 5 x 6
3. .
,
. , ,
1,
.
, ..
xy x y = x .
.
. .. (dreal dmin)
( , dreal = dmin
).
:
.
N*n*f(G), N
, n , f(G) ,
n (f(G) << n)
4. .
.
1) n
,
, , .
,
.
2) F = ||fij|| RN*n
fij , i- j- ( -1
j- )
P
i {j: fij -1}
G
j P,
p.
BGMC (Boolean
Graph Minimization Complex), .
:
12 0.01 .
16 4-5 .
20 80-120 .
24 20 .
( CPU1200/SDRAM256)
,
espresso [3]. BGMC
www.miraj.net.ru
5. .
( )
.
, ,
. ,
.
, ,
.
1.
2.
3.
:
.. 1979.
.. .
2005. 52.
espresso : http://www.fke.utm.my/downloads/espresso/