01205301 Digital Circuits and Microcontrollers

Unit work
Name Ebo warwern ID 6410589993 Sec 1 . 10 pts)
Problem
Unit D3 : Combinational Logic Circuit Design (10 pts)
Instruction
Design and implement a combinational logic circuit to detect any three assigned numbers of 3-bit binary inputs
(N2, N1, and N0). If one of the assigned numbers is detected, the output F is HIGH. Otherwise, the output F is
LOW. The designed circuit must be in the form of minimal product and consist only of inverters, 2-input AND, and
2-input OR. Show your design steps in detail including truth table, canonical product, K-map, and minimal
product. Attach your designed circuit in Fig. 1. Use the logic analyzer to verify the function of your circuit. Record
the timing diagram from the logic analyzer in Fig. 2 and explain the timing diagram.

The assigned binary numbers (N2 N1 N0) are 001, 010, and 011.

Fig. 1. Your designed circuit

Fig. 2. Recorded timing diagram from the logic analyzer

1
 X
-
xY
00 01 11 10
NOW Ny Ne No F 2
6
000
2

O 00 O O 8 98
z(11 7
3
10 01 1 858
2

0191
-

3 Y

no
1
1

5 O

71 1 1 ⑧ minimal product
F Neo(N+No'
=

canonical product
4N,Ne,No(04,5,6,73
F:

=(Na+ N,+No) (Ne' + N, +NoJe /Ng'+N+NoY. IN+NNo

· ·
INg'tNe'tNO'S
01205301 Digital Circuits and Microcontrollers
Problem
Design and implement a combinational logic circuit to detect any three assigned numbers of 3-bit binary inputs
(N2, N1, and N0). If one of the assigned numbers is detected, the output F is LOW. Otherwise, the output F is
HIGH. The designed circuit must be in the form of minimal sum, and consist only of inverters, 2-input AND, and
2-input OR. Show your design steps in detail including truth table, canonical sum, K-map, and minimal sum.
Attach your designed circuit in Fig. 3. Use the logic analyzer to verify the function of your circuit. Record the
timing diagram from the logic analyzer in Fig. 4 and explain the timing diagram.

The assigned binary numbers (N2 N1 N0) are 001, 010, and 011.

Fig. 3. Your designed circuit

Fig. 4. Recorded timing diagram from the logic analyzer

2
 X
-
+Y
00 01 11 10
NOW Ny N. No F 2

001 -1
2

O 000
-1
1

z(11 7
3
10 01 O 151
2

ii
-
8
3 Y
O
1

71111

Minimal sum

F: NetIN-Nos

Canonical sum

F EN, Ne,No(0,4,5,6,7)
=

:Na-N-Not(NgN!No'l+(N-N.Nolt(Nz.NNc'+(N,'N,No)