Documente Academic
Documente Profesional
Documente Cultură
2__
FUNCII BOOLEENE
CAPITOLUL 2
FUNCII BOOLEENE ELEMENTARE APLICATE
LA PROIECTAREA CIRCUITELOR LOGICE
2.1. FUNCII BOOLEENE ELEMENTARE
2
x2
f1
f2
f3
f4
f5
f6
f7
f8
0
0
1
1
0
1
0
1
0
0
0
0
1
0
0
0
0
1
0
0
1
1
0
0
0
0
1
0
1
0
1
0
0
1
1
0
1
1
1
0
x1
x2
f9
f10
f11
f12
f13
f14
f15
f16
0
0
1
1
0
1
0
1
0
0
0
1
1
0
0
1
0
1
0
1
1
1
0
1
0
0
1
1
1
0
1
1
0
1
1
1
1
1
1
1
CAP.2__
Denumirea i
expresia
Nr
algebric a
funciei booleene
Funcia
constant
1
f1(x1, x2) = 0
f16(x1, x2) = 1
Funcia
identitate
2
f11(x1, x2) = x2
f13(x1, x2) = x1
Negaia
3
f4(x1, x2) = x 1
f5(x1, x2) = x 2
FUNCII BOOLEENE
Tabelul de adevr
x1
0
0
1
1
x2
0
1
0
1
x1
0
0
1
1
x2 f11 f13
0 0 0
1 1 0
0 0 1
1 1 1
x1
0
0
1
1
x2
0
1
0
1
f1 f16
0 1
0 1
0 1
0 1
f4 f5
1 1
1 0
0 1
0 0
Denumirea
circuitului
logic
Simbolul circuitului
Norme
internaionale
Norme
internaionale
CEI
MIL
Circuit
deschis
Circuit
nchis
NU
NOT
Inversor
CAP.2__
Nr
Denumirea i
expresia
algebric a
funciei booleene
Conjuncia
(produs logic)
f9(x1, x2) =
= x1 . x2
Disjuncia
(suma logic)
f15(x1, x2) =
= x1+ x2
Negarea
conjunciei
(funcia lui
Shaffer)
f8(x1, x2) =
= x1x2 =
= x1 . x2 =
FUNCII BOOLEENE
Tabelul de adevr
x1
0
0
1
1
x2
0
1
0
1
x1
0
0
1
1
x2 f15
0 0
1 1
0 1
1 1
x1
0
0
1
1
x2
0
1
0
1
f8
1
1
1
0
x1
0
0
1
1
x2
0
1
0
1
f2
1
0
0
0
f9
0
0
0
1
Denumirea
circuitului
logic
I
AND
SAU
OR
I NU
NAND
Simbolul circuitului
Norme
internaionale
Norme
internaionale
CEI
MIL
x1
x2
&
x1
x2
x1
x2
&
f9
f15
f8
x1
x2
f9
x1
x2
f15
x1
x2
f15
x1
f8
x2
Numai
= x1 + x 2
Negarea
disjunciei
(funcia lui
Pierce)
f2(x1, x2) =
= x1x2
= x1 + x 2 =
SAU - NU
NOR
x1
x2
Nici
x1
x2
1
f2
f2
x1
x2
f2
= x1 . x 2
Conf. dr. ing. Gloria CIUMBULEA
CAP.2__
Nr
FUNCII BOOLEENE
Denumirea i
expresia algebric
a funciei booleene
Tabelul de
adevr
Denumirea
circuitului
logic
Simbolul circuitului
Norme
internaionale
Norme
internaionale
CEI
MIL
Echivalena
f10(x1, x2) =
=x 1 x 2
= x1 x2 =
= x1 + x 2 .
x1 + x 2 =
x1
x1
0
0
1
1
x2 f10
0 1
1 0
0 0
1 1
SAU
EXCLUSIV
NEGAT
x2
x1
f10
=1
x2
f10
x1
x2
f10
= x1 x2 + x1 x 2
Negarea
echivalenei
f7(x1, x2) =
= x1 x2 =
= x1 x2 =
x1
0
0
1
1
x2 f7
0 0
1 1
0 1
1 0
x1
0
0
1
1
x2 f12
0 1
1 1
0 0
1 1
x1
SAU
EXCLUSIV
XOR
x2
x1
=1
x2
f7
f7
x1
f
x2 7
Sumator
modulo 2
= x1.x2 + x1.x 2
Implicaia
direct
10
f12(x1, x2) =
= x1 x 2 =
= x1 + x 2
x1
x2
f12
x1
x2
f12
CAP.2__
Nr
Denumirea i
expresia algebric
a funciei booleene
Implicaia
invers
11
f14(x1, x2) =
= x2 x1 =
= x1 + x 2
12
Negarea
implicaiei
directe
(funcia de
inhibare)
f5(x1, x2) =
= x1 x 2 =
FUNCII BOOLEENE
Tabelul de
adevr
x1
0
0
1
1
x2 f14
0 1
1 0
0 1
1 1
x1
0
0
1
1
x2 f5
0 0
1 0
0 1
1 0
x1
0
0
1
1
x2 f3
0 0
1 1
0 0
1 0
Denumirea
circuitului
logic
Simbolul circuitului
Norme
internaionale
Norme
internaionale
CEI
MIL
x2
x1
INTERDICIE
x2
f14
x2
x1
f14
&
f5
x2
x1
f5
f3
x1
x2
f3
x1
Inhibare
= x1 + x 2 = x1.x 2
Negarea
implicaiei
inverse
13
f3(x1, x2) =
= x 2 x1 =
INTERDICIE
x1
x2
1
&
Inhibare
= x1 + x 2 = x 1.x 2
OBSERVAIE:
16 funcii elementare:
10 sunt funcii nedegenerate
4 sunt funcii degenerate ntr-o variabil (negaia i funcia identitate)
2 sunt funcii degenerate n ambele variabile (funcia constant)
Conf. dr. ing. Gloria CIUMBULEA
CAP.2__
FUNCII BOOLEENE
valorile funciei)
Tabelul de adevr
pentru o funcie total definit,
cu trei variabile
Tabelul de adevr
pentru o funcie incomplet definit,
cu trei variabile
x1
x2
x3
f (x1 , x2 , x3 )
x1
x2
x3
f ( x1 , x2 , x3 )
0
0
0
0
1
1
1
1
0
0
1
1
0
0
1
1
0
1
0
1
0
1
0
1
1
1
1
0
0
1
0
1
0
0
0
0
1
1
1
1
0
0
1
1
0
0
1
1
0
1
0
1
0
1
0
1
*
1
*
*
0
1
0
1
variabilele
2n = 23 linii
funcia
variabilele
2n = 23 linii
funcia
CAP.2__
FUNCII BOOLEENE
2n = 2 p 2q ; n = p + q
unde:
2p = numrul de linii
2p = numrul de coloane
Diagrama Karnaugh
corespunztoare unei
funcii complet definite,
de trei variabile
Diagrama Karnaugh
corespunztoare unei
funcii incomplet
definite,
de trei variabile
x2 , x3
x1
0
1
00 01 11 10
1
0
1
1
0
1
1
0
n=3
p = 1 21 = 2 linii
q = 2 22 = 4 coloane
n=3
x 2 , x3
x1
00 01 11 10
p = 1 21 = 2 linii
q = 2 22 = 4 coloane
* = stri de nedeterminare
CAP.2__
FUNCII BOOLEENE
x3 , x 4
Diagrama Karnaugh
corespunztoare unei
funcii complet definite,
de patru variabile
x1 , x 2
00
00 01 11 10
0
01
11
1
0
1
0
0
1
0
1
10
n=4
p = q = n/2 = 2
2p =22= 4 linii =
=2q =22= 4 coloane
f ( x1 , x 2 , x3 ) = x1 x 2 + x1 x 2 x3 + x 2 x 3
x1
x2
&
1
&
x3
1
&
CAP.2__
FUNCII BOOLEENE
f ( x1 , x 2 , x3 ) = x1 x 2 + x 2 x 3
x1
011;
000;
100;
010
t
x2
t
x3
t
x2
t
x3
t
x1 x2
t
x2 x3
t
f
t
CAP.2__
FUNCII BOOLEENE
(produsul
logic)
variabilelor
form
direct
sau
complementat
f cd ( x1 ,..., x n ) = P1 + P2 + ... + Pk = Pk = Pk =U Pk = U Pk ; k 2 n
1
10
CAP.2__
FUNCII BOOLEENE
f cc ( x1 ,..., x n ) = S1 S 2 ... S k = S k = S k = I S k = I S k ; k 2 n
0
OBSERVAII:
11
CAP.2__
FUNCII BOOLEENE
Exemplu:
Tabel de adevr:
f ( x1 , x 2 , x3 )
x1
x2
x3
tabelul de adevr.
0
0
0
0
1
1
1
0
0
1
1
0
0
1
0
1
0
1
0
1
0
0
1
1
0
0
1
0
Mintermenii i maxtermenii
sunt marcai n tabelul de adevr
prin mi, respectiv Mj.
x 2 , x3
x1
0
1
(M 1 )
(m1 )
(m2 )
(M 2 )
(M 3 )
(m3 )
(M 4 )
(M 5 )
00 01 11 10
0
0
1
1
0
0
1
0
)(
)(
)(
= ( x1 + x 2 + x 3 ) x1 + x 2 + x 3 x 1 + x 2 + x 3 x 1 + x 2 + x 3 x 1 + x 2 + x 3
)
12
CAP.2__
FUNCII BOOLEENE
(produsul
logic)
variabilelor
form
direct
sau
complementat
Pe = p1 . p 2 ........ p j ;
j < n,
1. Numrul total al termenilor elementari este mai mare dect numrul total al
termenilor canonici ai unei funcii
2. La formele elementare se ajunge prin operaii de simplificare i minimizare
a funciei
3. Conveniile pentru scrierea simbolic a formelor elementare disjunctive i
conjunctive sunt aceleai cu conveniile de la scrierea simbolic a formelor
canonice disjunctive i conjunctive:
f cd , f ed : x 1; x 0
f cc , f ec : x 0; x 1
13
CAP.2__
FUNCII BOOLEENE
Exemplu:
f1 ( x14 ) = x1 x2 x 3 x4 + x1 x2 x3 x 4 + x1 x4 + x1 x2 x3 x4 + x1 x2 x 4
f 2 ( x14 ) = x1 x 2 x 3 x 4 + x1 x2 x 3 x4 + x1 x2 x 3 x 4 + x1 x2 x3 x4 + x1 x2 x 3 x4
)(
)(
f 3 ( x14 ) = x1 + x 3 + x4 x1 + x2 + x 3 + x4 ( x1 + x4 ) x1 + x 2 + x 3 + x4 x1 + x 2 + x4
)(
)(
f 4 ( x14 ) = x1 + x2 + x 3 + x4 x1 + x2 + x 3 + x4 x1 + x 2 + x 3 + x 4
fi fcd fcc fed fec
Termeni canonici
Termeni elementari
Disj.
Disj.
Conj.
x1 x 2 x 3 x 4
f1
x1 x 2 x3 x 4
x1 x 2 x3 x 4
f2
)
Conj.
x1 x 4
x1 x 2 x 4
x1 x 2 x 3 x 4
x1 x 2 x 3 x 4
x1 x 2 x 3 x 4
x1 x 2 x3 x 4
x1 + x3 + x4
x1 + x 4
x1 x 2 x 3 x 4
f3
x1 + x2 + x3 + x4
x1 + x2 + x4
x1 + x2 + x3 + x4
x1 + x2 + x3 + x4
14
CAP.2__
FUNCII BOOLEENE
15
CAP.2__
FUNCII BOOLEENE
0 = xx
x + yz = ( x + y )( x + z )
x + x + ...... + x = x
xxx.....x = x
16
CAP.2__
FUNCII BOOLEENE
Exemplu:
f ( x1 , x 2 , x3 ) = x1 x 2 + x3
Dezvoltarea funciei n forma canonic disjunctiv:
)(
) (
)(
f ( x1 , x2 , x3 ) = x1 x 2 + x3 = x1 x 2 1 + 1 1 x3 = x1 x 2 x3 + x 3 + x1 + x1 x2 + x 2 x3 =
= x1 x 2 x3 + x1 x 2 x 3 + x1 x2 x3 + x1 x 2 x3 + x1 x2 x3 + x1 x 2 x3 =
= x1 x 2 x3 + x1 x 2 x 3 + x1 x2 x3 + x1 x 2 x3 + x1 x2 x3
Dezvoltarea funciei n forma canonice conjunctiv:
)(
f ( x1 , x 2 , x3 ) = x1 x 2 + x3 = x1 + x3 x 2 + x3
)(
) (
)(
f ( x1 , x2 , x3 ) = x1 + 0 + x3 0 + x 2 + x3 = x1 + x2 x 2 + x3 x1 x1 + x 2 + x3 =
(
= (x
= (x
= (x
)(
= x1 + x3 + x2 x 2 x1 x1 + x 2 + x3 =
)(
+ x )(x
+ x )(x
)(
+ x )(x
+ x )(x
)(
+ x )(x
+x )
)
+ x )=
+ x3 + x2 x1 + x3 + x 2 x1 + x 2 + x3 x1 + x 2 + x3 =
+ x2
+ x2
+ x2
+ x2
+ x2
+ x2
+ x2
17