Documente Academic
Documente Profesional
Documente Cultură
1
CIRCUITE LOGICE FUNDAMENTALE
1. Scopul lucrrii
2. Consideraii teoretice
ki
M N
ki deschis => xi=0
M xi N
M ki N
ki nchis => xi=1
Nivel High
Nivel Low
a) Poarta NU (NOT)
a f a
f a
14 CIRCUITE LOGICE FUNDAMENTALE
a f
0 1
1 0
b) Poarta I (AND)
a f a b
b
a b f
0 0 0
0 1 0
1 0 0
1 1 1
a f a b
b
CIRCUITE LOGICE FUNDAMENTALE 15
a b f
0 0 1
0 1 1
1 0 1
1 1 0
a a
f f
b b
a
f=a+b
b
a b f
0 0 0
0 1 1
16 CIRCUITE LOGICE FUNDAMENTALE
1 0 1
1 1 1
a
f ab
b
a b f
0 0 1
0 1 0
1 0 0
1 1 0
a a
f f
b b
a
f a b
b
a b f a b
0 0 0
0 1 1
1 0 1
1 1 0
a b f a b
0 0 1
0 1 0
1 0 0
1 1 1
2.4 Poarta TTL
a a
b b
f
f
Anex
1. Familia TTL
GND
7 6 5 4 3 2 1
8 9 10 11 12 13 14 Vcc
2. Familia MOS
TTL CMOS
5V Intrare 1 5V
Nivel 1 logic
logic la 3,5V
ieire VOHmin Regiune de
2,4V nedeterminare
1,5V
Intrare 0
0,4V VOLmax logic
0V 0V
Nivel 0 logic la ieire
LUCRAREA NR. 2
EDITORUL SCHEMATIC I SIMULATORUL
ACTIVE-HDL (I)
1. Scopul lucrrii
2. Consideraii teoretice
3. Instrumente de control:
2.2.1 Introducere
3. Desfurarea lucrrii
LUCRAREA NR. 3
EDITORUL SCHEMATIC I SIMULATORUL
ACTIVE-HDL (II)
1. Scopul lucrrii
2. Consideraii teoretice
2.1 Net-uri
2.2 Magistrale
asociem valori logice pentru cele 2 intrri, din meniu sau cu pictograma
.
FD
Intrare1 D Q Iesire
Intrare2 C
0 X
Intrare1 0 D Q X Iesire
0
Intrare2 0 C
1 1
Intrare1 1 D Q 1 Iesire
0
Intrare2 0 C
3. Desfurarea lucrrii
LUCRAREA NR. 4
CIRCUITE LOGICE COMBINAIONALE
1. Scopul lucrrii
2. Consideraii teoretice
A B A B
A B A B (4.1)
Tabel de adevr
al tensiunilor Logic pozitiv Logic negativ
A B F A B F A B F
low low low 0 0 0 1 1 1
low high low 0 1 0 1 0 1
high low low 1 0 0 0 1 1
high high high 1 1 1 0 0 0
A B C D W X Y Z
0 0 0 0 0 0 0 1
0 0 0 1 0 0 1 0
0 0 1 0 0 0 1 1
0 0 1 1 0 1 0 0
0 1 0 0 0 1 0 1
0 1 0 1 0 1 1 0
0 1 1 0 0 1 1 1
0 1 1 1 1 0 0 0
1 0 0 0 1 0 0 1
1 0 0 1 0 0 0 0
1 0 1 0
1 0 1 1
1 1 0 0
1 1 0 1
1 1 1 0
1 1 1 1
Valorile funciilor sunt "" (indiferente sau don't care) pentru toate
combinaiile variabilelor de intrare care nu apar niciodat. A nu se confunda
CIRCUITE LOGICE FUNDAMENTALE 43
aceast valoare "" cu valoarea "" sau "X" raportat de multe simulatoare
logice, unde ea reprezint o valoare nedefinit (sau don't know). Orice
implementare practic a circuitului va genera totui o anumit ieire pentru
cazurile indiferente. Folosind ntr-un tabel de adevr valoarea "X" sau ""
nseamn c avem posibilitatea de a alege ntre a atribui valoarea 0 sau 1
logic respectivei ieiri din tabelul de adevr. n general urmrim s alegem
acea valoare care va duce la cea mai simpl implementare fizic.
xx x x y x y
x y x y y x ( x y ) x y (4.5)
W B C D A D; X B D B C B C D;
(4.6)
Y A C D C D; Z D.
A B C D F1 F2 F3
A 0 0 0 0 1 0 0
AB = CD
B N1 F1 0 0 0 1 0 1 0
AB < CD 0 0 1 0 0 1 0
F2
C AB > CD 0 0 1 1 0 1 0
F3
D N2 0 1 0 0 0 0 1
0 1 0 1 1 0 0
0 1 1 0 0 1 0
0 1 1 1 0 1 0
1 0 0 0 0 0 1
1 0 0 1 0 0 1
1 0 1 0 1 0 0
1 0 1 1 0 1 0
1 1 0 0 0 0 1
1 1 0 1 0 0 1
1 1 1 0 0 0 1
1 1 1 1 1 0 0
Figura 4.3 Schema bloc i tabelul de adevr al comparatorului pe 2 bii
01 0 1 0 0 01 1 0 0 0 01 0 0 1 1
D D D
11 0 0 1 0 11 1 1 0 1 11 0 0 0 0
C C C
10 0 0 0 1 10 1 1 0 0 10 0 0 1 0
B B B
F1 F2 F3
Figura 4.4 Diagramele Karnaugh pentru comparatorul pe 2 bii
A B C D X Y Z
A 0 0 0 0 0 0 0
X
B N1 0 0 0 1 0 0 1
Y 0 0 1 0 0 1 0
N3
C Z 0 0 1 1 0 1 1
D N2 0 1 0 0 0 0 1
0 1 0 1 0 1 0
0 1 1 0 0 1 1
0 1 1 1 1 0 0
1 0 0 0 0 1 0
1 0 0 1 0 1 1
1 0 1 0 1 0 0
1 0 1 1 1 0 1
1 1 0 0 0 1 1
1 1 0 1 1 0 0
1 1 1 0 1 0 1
1 1 1 1 1 1 0
Figura 4.5 Schem bloc i tabel de adevr pentru sumatorul pe 2 bii
00 0 0 0 0 00 0 0 1 1 00 0 1 1 0
01 0 0 1 0 01 0 1 0 1 01 1 0 0 1
D D D
11 0 1 1 1 11 1 0 1 0 11 1 0 0 1
C C C
10 0 0 1 1 10 1 1 0 0 10 0 1 1 0
B B B
X Y Z
X AC B C D A B D
Z BD BD BD
(4.8)
Y B ( A C ) B ( A C D)
sau : Y A B C A B C A C D A C D A B C D A B C D
Y1
C
Y2
3. Desfurarea lucrrii
LUCRAREA NR. 5
CIRCUITE LOGICE COMBINAIONALE MSI
1. Scopul lucrrii
2. Consideraii teoretice
Y1 x s0 Y1
1
X
X Y0 x s0
Y0
0
S0 S0
Y3 x s1 s0
x
Y2 x s1 s0
Y1 x s1 s0
Y0 x s1 s0
S1 S0
O0 O1 O2 O3 O0 O1 O2 O3 O4 O5 O6 O7
X1
X1 1
Y
Y
X0 X0 0
S0
S
A0
A1 MUX 4:1
X3
1
X2
0
1 Y
S0
X1 0
1
X0
0
S0 S1
D0
W
D1
D2 Y
D3
D4
D5
D6
D7
A
B
C
ENABLE
4151
2.3 Decodificatorul
A 0
1
B 2
C 3
4
D 5
6
7
8
9
442
CIRCUITE LOGICE FUNDAMENTALE 55
1 1 0 0 1 1 1 1 1 1 1 1 1 1
1 1 0 1 1 1 1 1 1 1 1 1 1 1
1 1 1 0 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1
Tabelul 5.2 Tabelul de adevr al unui convertor de cod din binar n binar
reflectat
B3 B2 B1 B0 G3 G2 G1 G0
0 0 0 0 0 0 0 0
0 0 0 1 0 0 0 1
0 0 1 0 0 0 1 1
0 0 1 1 0 0 1 0
0 1 0 0 0 1 1 0
0 1 0 1 0 1 1 1
0 1 1 0 0 1 0 1
0 1 1 1 0 1 0 0
1 0 0 0 1 1 0 0
1 0 0 1 1 1 0 1
1 0 1 0 1 1 1 1
1 0 1 1 1 1 1 0
1 1 0 0 1 0 1 0
1 1 0 1 1 0 1 1
1 1 1 0 1 0 0 1
1 1 1 1 1 0 0 0
G0 B1 B0 B0 B1 B1 B0
G1 B2 B1 B1 B2 B2 B1
CIRCUITE LOGICE FUNDAMENTALE 57
G2 B3 B2 B2 B3 B3 B2 (5.2)
G3 B3
B3 G3
G2
B2
486
G1
B1
486
G0
B0
486
Intrri Ieiri
de valori de EI OI par impar
1 de la A la H
Par 1 0 1 0
Impar 1 0 0 1
Par 0 1 0 1
Impar 0 1 1 0
X 1 1 0 0
X 0 0 1 1
58 CIRCUITE LOGICE FUNDAMENTALE
A
B
C
D
E
F 4180
G
H
EI EVEN
OI ODD
Intrri Ieiri
EI 0 1 2 3 4 5 6 7 A2 A1 A0 GS EO
1 X X X X X X X X 1 1 1 1 1
0 1 1 1 1 1 1 1 1 1 1 1 1 0
0 X X X X X X X 0 0 0 0 0 1
0 X X X X X X 0 1 0 0 1 0 1
0 X X X X X 0 1 1 0 1 0 0 1
0 X X X X 0 1 1 1 0 1 1 0 1
0 X X X 0 1 1 1 1 1 0 0 0 1
0 X X 0 1 1 1 1 1 1 0 1 0 1
0 X 0 1 1 1 1 1 1 1 1 0 0 1
0 0 1 1 1 1 1 1 1 1 1 1 0 1
CIRCUITE LOGICE FUNDAMENTALE 59
0 A0
1
2 A1
3 A2
4
5
6
7 GS
EI EO
4148
3. Desfurarea lucrrii
LUCRAREA NR. 6
CIRCUITE LOGICE COMBINAIONALE COMPLEXE
1. Scopul lucrrii
2. Consideraii teoretice
I3 I2 I1 I0
3 3
3 3
S1
S0
Y 3
A1
A2 Y1
A3 Y2
A4 Y3
B1 Y4
B2
B3
B4
S Select
G Strobe
4157
Intrri Ieire
Strobe Select A B Y
G S
H X X X L
L L L X L
L L H X H
L H X L L
L H X H H
A1
A2 1
A3 2
A4 3
4
B1
B2 C4
B3
B4
C0
483
Operaie Descriere
Adunare (C4, 4, 3, 2, 1) = (A4, A3, A2, A1) +
+ (B4, B3, B2, B1) + (0,0,0,C0)
B 1 B i B 0 B
A4 A3 A2 A1 Sel B4 B3 B2 B1
7486
Y4 Y3 Y2 Y1
C0
7483
C4 4 3 2 1
Figura 6.4 Sumator-scztor pe 4 bii
A0
A1 F0
A2 F1
A3 F2
F3
B0
B1 A=B
B2
B3 G
P
S0 Cn+4
S1
S2
S3
M
Cn
4181
Selecii Ieiri
Logice Aritmetice
S3 S2 S1 S0
M=H M=L
L L L L A A minus 1
L L L H AB AB minus 1
L L H L A B A B minus 1
L L H H logic 1 minus 1
L H L L A B A plus ( A B )
L H L H B AB plus ( A B )
L H H L AB A minus B minus 1
L H H H A B A B
H L L L AB A plus (A + B)
H L L H A B A plus B
H L H L B A B plus (A + B)
H L H H A+B A+B
H H L L logic 0 A + A (shift)
H H L H AB AB plus A
H H H L AB A B minus A
H H H H A A
66 CIRCUITE LOGICE FUNDAMENTALE
f b
e c
A0 a
A1
A2 b
A3 c
LT d
RBI e
f
g
BI/RBO
447
3. Desfurarea lucrrii