Documente Academic
Documente Profesional
Documente Cultură
Definiie:
xn - 1
CD
.
.
.
.
.
y0
y1
y2
n 2m
ym - 1
y r = ai xi
i =0
11
CAP.3
Exemplu:
Sinteza unui codificator zecimal binar (CD Z-B)
Schema bloc:
0 x0
1 x1
2 x2
y0 20
y1 21
y2 22
y3 23
CD
.
.
.
.
ZB
9 x9
Funciile de ieire:
Tabelul de adevr:
x0
x1
x2
x3
x4
x5
x6
x7
x8
x9
y3
y2
y1
y0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
1
0
0
0
0
1
1
1
1
0
0
0
0
1
1
0
0
1
1
0
0
0
1
0
1
0
1
0
1
0
1
y 0 = x1 + x3 + x5 + x 7 + x9
y1 = x 2 + x3 + x 6 + x 7
y 2 = x 4 + x5 + x 6 + x 7
y 3 = x8 + x 9
Schema logic:
x1 x2 x3 x4
x5 x6 x7 x8 x9
1
y0
y1
y2
y3
12
CAP.3
y0
x0
x1
x2
xn-1
y1
.
.
.
.
.
DCD
y2
.
.
.
.
.
m 2n
ym-1
OBSERVATII:
13
CAP.3
Exemplu:
Sinteza unui decodificator binar - zecimal (DCD B-Z)
Schema bloc:
y0 0
y1 1
y2 2
(20) x0
1
(2 ) x1
DCD
B-Z
(22) x2
(23) x3
.
.
.
.
y9 9
x0 , x1
x2 , x3
00
01
11
10
x3
0
0
0
0
0
0
0
0
1
1
1
1
x2
0
0
0
0
1
1
1
1
0
0
0
0
x1
0
0
1
1
0
0
1
1
0
0
1
1
x0
0
1
0
1
0
1
0
1
0
1
0
1
y0
1
0
0
0
0
0
0
0
0
0
*
*
y1
0
1
0
0
0
0
0
0
0
0
*
*
y2
0
0
1
0
0
0
0
0
0
0
*
*
y3
0
0
0
1
0
0
0
0
0
0
*
*
y4
0
0
0
0
1
0
0
0
0
0
*
*
y5
0
0
0
0
0
1
0
0
0
0
*
*
y6
0
0
0
0
0
0
1
0
0
0
*
*
y7
0
0
0
0
0
0
0
1
0
0
*
*
y8
0
0
0
0
0
0
0
0
1
0
*
*
y9
0
0
0
0
0
0
0
0
0
1
*
*
1
1
1
1
1
1
1
1
0
0
1
1
0
1
0
1
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
x0 , x1
00 01 11 10
1
0
*
0
0
*
*
0
y 0 = x 0 x1 x 2 x 3
0
*
*
0
x2 , x3
00
01
11
10
0
0
*
0
00 01 11 10
0
0
*
0
0
*
*
0
y1 = x0 x1 x 2 x 3
0
*
*
0
1
0
*
0
x0 , x1
x2 , x3
00
01
11
10
00 01 11 10
0
0
*
0
1
*
*
0
0
*
*
0
0
0
*
0
y 2 = x 0 x1 x 2
14
CAP.3
x0 , x1
x2 , x3
00
01
11
10
0
0
*
0
0
*
*
0
1
*
*
0
x2 , x3
00
01
11
10
x2 , x3
00
01
11
10
x0 , x1
00 01 11 10
0
0
*
0
0
0
*
1
0
*
*
0
0
*
*
0
x2 , x3
00
01
11
10
0
0
*
0
0
*
*
1
0
*
*
0
x2 , x3
00
01
11
10
0
0
*
0
x0 , x1
00 01 11 10
0
0
*
0
0
*
*
0
0
*
*
1
x2 , x3
00
01
11
10
0
0
*
0
y 7 = x0 x1 x 2
0
*
*
0
0
*
*
0
0
1
*
0
00 01 11 10
0
0
*
0
0
*
*
0
0
*
*
0
0
0
*
1
y 5 = x0 x1 x 2
00 01 11 10
0
1
*
0
0
*
*
0
0
*
*
0
0
0
*
0
y8 = x 0 x3
Schema logic:
00 01 11 10
0
0
*
0
x0 , x1
00 01 11 10
y 4 = x 0 x1 x 2
y 6 = x 0 x1 x 2
x0 , x1
x2 , x3
00
01
11
10
0
0
*
0
y 3 = x0 x1 x 2
x0 , x1
x0 , x1
00 01 11 10
x0
y 9 = x 0 x3
x1
1
x2
1
x3
1
1
&
y0
&
y1
&
y2
&
y3
&
y4
&
y5
&
y6
&
y7
&
y8
&
y9
15
CAP.3
OBSERVATIE:
Informaie
codificat
n cod A
.
.
.
.
.
CC
.
.
.
.
.
Informaie
codificat
n cod B
16
CAP.3
Exemplu:
Sinteza unui convertor de cod din zecimal-binar n codul Gray
Tabelul de adevr, diagramele Karnaugh i funciile de ieire n form minim:
x1
x2
x3
x4
y1
y2
y3
y4
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
0
0
0
0
0
0
0
1
1
*
*
*
*
*
*
0
0
0
0
1
1
1
1
1
1
*
*
*
*
*
*
0
0
1
1
1
1
0
0
0
0
*
*
*
*
*
*
0
1
1
0
0
1
1
0
0
1
*
*
*
*
*
*
x1 , x2
00 01 11 10
x3 , x4
00
01
11
10
0
0
0
0
0
0
0
0
*
*
*
*
1
1
*
*
x1 , x2
x3 , x4
00
01
11
10
y1 = x1
x1 , x2
x3 , x4
00
01
11
10
1
1
0
0
*
*
*
*
0
0
*
*
y 3 = x 2 x3 + x 2 x3 =
x1 , x2
x3 , x4
00
01
11
10
x2
x3
1
1
1
1
*
*
*
*
1
1
*
*
00 01 11 10
0
1
0
1
0
1
0
1
*
*
*
*
0
1
*
*
y 4 = x3 x4 + x3 x4 =
= x 2 x3
x1
0
0
0
0
y 2 = x1 + x 2
00 01 11 10
0
0
1
1
00 01 11 10
= x3 x4
x4
y1
Schema logic
y2
=1
y3
=1
y4
17
CAP.3
xm
..
.
.
.
.
.
.
.
.
.
MUX
y ieirea
m = 2n
x semnal de intrare
d1 d2 dn
..
x
DMUX
.
.
.
.
.
y1
y2
.
.
ym
18
CAP.3
Exemplu:
Sinteza unui multiplexor cu 8 intrri de date
Intrri: m = 8 = 23 = 2n semnale de coman: n = 3
Funcia de ieire:
Tabelul de adevr:
c1 c 2
0 0
0 0
0 1
0 1
1 0
1 0
1 1
1 1
c3
0
1
0
1
0
1
0
1
y
x1
x2
x3
x4
x5
x6
x7
x8
y = c1 c 2 c 3 x1 + c1 c 2 c3 x x + c1c 2 c 3 x3 + c1c 2 c3 x 4 +
+ c1 c 2 c 3 x5 + c1 c 2 c3 x6 + c1c 2 c 3 x7 + c1c 2 c3 x8
c1
c2
1
Schema logic:
c3
1
x1
&
x2
&
x3
&
x4
&
x5
&
x6
&
x7
&
x8
&
19
CAP.3
Exemplu:
Sinteza unui demultiplexor cu 8 ieiri de date
Ieiri: m = 8 = 23 = 2n semnale de coman: n = 3
Funciile de ieire:
Tabelul de adevr:
d1 d 2
d3
0
0
0
0
1
1
1
1
0
1
0
1
0
1
0
1
0
0
1
1
0
0
1
1
y1
x
0
0
0
0
0
0
0
y2
y3
y4
y5
y6
y7
y8
0
x
0
0
x
0
0
0
x
0
0
0
0
x
0
0
0
0
0
0
0
0
x
0
0
0
0
0
0
0
0
x
0
0
0
0
0
0
0
x
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
x d1
d2
1
y1 = d 1 d 2 d 3 x ;
y2 = d 1 d 2 d 3 x ;
y3 = d 1d 2 d 3 x ;
y 4 = d 1d 2 d 3 x ;
y 5 = d1 d 2 d 3 x ;
y 6 = d1 d 2 d 3 x ;
y 7 = d1 d 2 d 3 x ;
y 8 = d1 d 2 d 3 x
d3
1
1
&
Schema logic:
&
&
&
&
&
&
&
y1
y2
y3
y4
y5
y6
y7
y8
20
CAP.3
3.11. SUMATORUL
Definiie:
Semisumatorul
are 2 intrri:
are 2 ieiri:
Funciile de ieire:
Tabelul de adevr
A0
0
0
1
B0
0
1
0
S0
0
1
1
C0
0
0
0
S 0 = A0 B0 + A0 B 0 = A0 B0
C0 = A0 B0
=1
&
S0
A0
Simbolul
semisumatorului
C0
C0
B0
S0
21
CAP.3
Sumatorul complet
i furnizeaz transportul Cn
al doilea semisumator, (II), efectueaz suma Sn ntre transportul de la bitul de
Bn
imediat inferior
Cn-1
Sn
Cn
Cn
Cn
(I)
imediat superior
Sn semisuma parial
(II)
Sn
transportului Cn - 1
Tabelul de adevr
An
Bn
C n'
S n'
C n1
0
1
0
1
0
1
0
1
Sn
0
1
1
0
1
0
0
1
C n''
0
0
0
1
0
1
0
0
OBSERVAIE
Transporturile Cn i Cn nu pot fi
simultan adevrate
22
CAP.3
Tabel de adevr
An
0
0
0
0
1
1
Bn
0
0
1
1
0
0
1
1
1
1
C n 1
0
1
0
1
0
1
Sn
0
1
1
0
1
0
Cn
0
0
0
1
0
1
0
1
0
1
1
1
00 01 11 10
0
C n = An Bn + Bn C n1 + An C n1
00 01 11 10
0
*
*
1
1
*
0
*
*
0
1
*
1
*
0
*
S n = C n 1 C n + An C n + Bn C n + An Bn C n 1
23
CAP.3
Simbol
&
An Bn Cn-1
&
1
Sn
&
&
1
Cn
Sn
&
Cn
&
&
A2
B3
S3
A0
B1
C-1
C0
C1
S2
B0
C2
C3
A1
B2
S1
S0
OBSERVAII:
24
CAP.3
A1
A2
.
.
DCD
.
.
An
unde:
O1
O2
CD
.
.
.
.
.
Wm
Ok
de memorie i se exprim de cele mai multe ori n kilobii (1 kbit = 210 = 1024 bii):
C = mk
Conf. dr. ing. Gloria CIUMBULEA
25
CAP.3
A4
.
.
.
.
DCD
2 7 =128
ieiri
128
linii
64 col.
A3
A2
A1
CS 1
CS 2
MATRICE DE MEMORIE
128x64 bii
MUX
MUX
8 ci
8 ci
. . . . . . . . . . .
&
&
. . . . . . . . . . .
O1
O2
MUX
8 ci
&
&
O8
OBSERVAII:
Selecia unui cuvnt de ieire de 8 bii (O1, O2, ., O8) nu se face cu ajutorul
Intrrile CS1, CS2 permit selectarea sau deselectarea capsulei de memorie prin
26
CAP.3
se poate face la productor prin masc sau la utilizator prin aplicarea unor proceduri
de programare
n cazul memoriilor programabile la utilizator, operaia de programare se
efectueaz n stare deselectat a capsulei iar pentru EPROM, capsula este prevzut
cu o intrare suplimentar la care sunt aplicate impulsurile de programare
Realizarea unei memorii de capacitate mai mare se poate realiza prin utilizarea
(extindere de ieire);
modificnd att numrul de cuvinte, ct i numrul de bii de ieire (extindere
mixt).
27