1)Probleme cu forever

Mod dee rezolvare:

Variabilele nedeclarate se noteaza initial cu x!

t=0

a=0 b=1 c = x;

#2 t=2

a=0 b=0 c = x;

#4 t=6

a=0 b=1 c = x;
#6 t = 12

a=1 b=1 c = 1;

t = 15

a=0 b=1 c = 1;

#8 t = 20. Am ajuns la intervalul ce ma interesa(t = 15) care este intre 12 si 20.

2.

t=0

a = 0; b = 1; c = x;

#2 t=2

a = 0; b = 0; c = x;

#4 t = 6;

a = 1’ = 0; b = 1; c = x;
 t=7

a = 0; b = 1; c = x;

3.

t=0

a = 0; b = 1; c = x;

#2 t = 2;

a = 0; b=0 c = x;

#4 t = 6;

a = 0; b=1 c = x;

t = 10

a=1 b=1 c =x;

2)Valoarea zecimala din BCD

2 Metode: 1)Folosim site ul: https://miniwebtool.com/bcd-to-decimal-converter/?number=0010100000111001

2)in BCD se grupeaza bitii cate 4 si se calculeaza valoarea zecimala

1.

0011 = 3
1000 = 8
0010 = 2
0111 = 7 => 3827

Din link: 3827

2.

0010 = 2

1000 = 8

0011 = 3

1001 = 9
 Link: 2839

3)Marime si adancime
S = Numarul intrarilor
D = Numarul de porti maxime prin care trece cel mai
lung semnal
1.

S=9
D=3

2.
S = 15

D=4

D=4

S = 14
S = 17/16

D=3

4)Frecventa semnalului
Teorie:

Fck = 80

Fq6 = 80 / 2^7 = 0.625

Fck = 3 MHz

Fq8= 3/2^9 = 0.005859375*1000 = 5.859375 kHz

Fck = 25

Fq7 = 25/2^8 = 0.09765

Fck = 3

Fq7 = 3/2^8 = 11.71875

Fck = 3

Fq8 = 3 / 2^9 = 5.859375

5)Probleme cu MUX
s = 1;

in [2] = a

in [1] = b

in [0] = c

I0 = a + b’

I1 = c’

Y = s’io + si1 = 0(a + b’) + 1c’ = 0 + c’ = c’

S= b

In[2] = c in[1] = 1 in[0] = a’

I1 = c*0 = 0

I0 = a

Y = s’i0 + si1 = b’ * a + b * 0 = b’ * a + 0 = b’*a

S=a

In2 = 0 in1 = b in0 = c

I0 = c’

I1 = 0*b’ = 0

Y= s’i0 + s i1 = a’ * c’ + a * 0 = a’c’
6) Numarator Moebius

Q = st curenta = 111110

Dupa 8 perioae:

#1 111111

#2 011111

#3 001111
#4 000111

#5 000011

#6 000001

#7 000000

#8 100000

Q= 100000

#1 110000

#2 111000

#3 111100

#4 111110

#5 111111

#6 011111

#7 001111
#8 000111

Q = 11110

#1 11111

#2 01111

#3 00111

#4 00011

#5 00001

#6 00000

#7 10000
7)Probleme cu assign
module main;

reg [7:0] a;

reg [7:0] b;

reg [7:0] c;

initial

begin

a=8'b1100_1101;

b=8'b1010_1001;

c=;

$display("rezultat %b",c);

end

endmodule

https://www.tutorialspoint.com/compile_verilog_online.php
= 00100011

8)Functie cu tabel de adevar

Pe site: https: //www.dcode.fr/boolean-truth-table
9)Valoare abc cu for

0000 0 1000 40

0001 5 1001 45

0010 10 1010 50

0011 15 1011 55

0100 20 1100 60

0101 25 1101 65

0110 30

0111 35

Alegem valoarea de la t = 60 pt t = 62
(a,c,b) = 1100. Se aleg doar ultimele 3 cifre

A=1 b=0 c=0

0000

0001 6

0010 12

0011 18

0100 24

0101 30

0110 36

Aleg la 30 pt t = 35

(b,c,a) = 0101.Se aleg ultimele 3

b=1

c =0

a=1
10)Biti de adresa

Capacitatea 2^n * m n – intrari

m – iesiri

64k * 4 -> m = 4

2^ n = 64 * 1024

n= 16

11)Diode
Nmos: ||== : 0 logic – blocat

1 logic – deschis

Pmos: ||== 0 logic – deschis

1logic - blocat

te uiti dupa litera de langa diode, stabilesti tipul diodei si vezi daca e deshis sau blocat