Exercise1 Digital System (LAB)
Exercise1 Digital System (LAB)
Exercise 1
CONTENT
• Number System and Codes
– Binary, Octal, Decimal, Hexadecimal
– Conversions between number systems
– Codes: Gray, Alphanumeric Codes
– Parity Method for Error Detection
• Logic Gates and Boolean Algebra
– Boolean Laws and Theorems
– Basic gates: AND, OR, NOT, NOR, NAND,…
– Simplifying Boolean expressions using Boolean Algebra
• Combinational Logic Circuits
– Sum-of-Product (SOP), Product-of-Sum (POS)
– Simplifying Logic Circuits using K-map method
– Designing Combinational Logic Circuits
2
Chapter 1
3
Number System and Codes
1.1 Choose the right answer to complete the diagram for
a precision temperature regulation system.
4
Number System and Codes
1.2. Which of the following is the most widely used
alphanumeric code for computer input and output?
A. Gray C. BCD
B. Parity D. ASCII
8
Chapter 2
9
10
Logic Gates and Boolean Algebra
2.1. The output of a logic gate is 1 when all its
inputs are at logic 0. The gate is either
A. a NAND or an EX-OR
B. an OR or an EX-NOR
C. an AND or an EX-OR
D. a NOR or an EX-NOR
2.2. One of the DeMorgan’s theorems shows the
equivalence of
A. OR gate and Exclusive OR gate
B. NOR gate and Bubbled AND gate
C. NOR gate and NAND gate
D. NAND11 gate and NOT gate
Logic Gates and Boolean Algebra
12
Logic Gates and Boolean Algebra
2.5. Which images is suitable the most with this
description: “Output Z will go LOW only when A or B
is LOW and C or D is LOW”.
A. a
B. b
C. c
D. All of them
13
Logic Gates and Boolean Algebra
14
Logic Gates and Boolean Algebra
2.6. Define the combination of inputs for the circuit
to make LED ON:
A. 𝑋 = 𝐴𝐵ത + 𝐴𝐵
ҧ + 𝐵𝐶ҧ B. 𝑋 = 𝐴⨁𝐵 + 𝐵𝐶ҧ
C. 𝑋 = (𝐴ҧ𝐵ത + 𝐴𝐵)(𝐵ത + C) D. All of them
Combinational Logic Circuits
A. X = A’ when B = 1 or C = 1, otherwise X = 1
B. X = A when B = 0 and C = 0, otherwise X = 0
C. X = A’ when B = 1 and C = 1, otherwise X = 1
D. All is not correct
18
Logic Gates and Boolean Algebra
19
Logic Gates and Boolean Algebra
2.11. Simplifying the circuit below
Logic Gates and Boolean Algebra
21
Logic Gates and Boolean Algebra
22
Logic Gates and Boolean Algebra
23
Logic Gates and Boolean Algebra
24
Chapter 3
25
Combinational Logic Circuits
1. Sum of Products – SoP:
- A SoP expression will appear as two or more AND
terms Ored together
- E.g.: ABC + A’B’C
AB + A’BC’+ C’D’ +D
28
Minterms
29
Product-of-sums canonical form
Also known as the conjunctive normal form
Commonly called a maxterm expansion
30
Maxterms
31
Conversion between canonical forms
Minterm to Maxterm
Use maxterms that do not appear in minterm expansion
E.g., F(A,B,C) = ∑𝑚 1,3,5,6,7 = ς 𝑀(0,2,4)
Maxterm to Minterm
Use minterms that do not appear in maxterm expansion
E.g., F(A,B,C) = ς 𝑀(0,2,4) = ∑𝑚 1,3,5,6,7
Minterm expansion of F to minterm expansion of F’
Use minterms that do not appear
E.g., F(A,B,C) = ∑𝑚 1,3,5,6,7 => F’(A,B,C) = ∑𝒎 𝟎, 𝟐, 𝟒
Maxterm expansion of F to maxterm expansion of F’
Use maxterms that do not appear
E.g., F(A,B,C) =ς 𝑀(0,2,4) => F’(A,B,C) =ς 𝑀(1,3,5,6,7)
Combinational Logic Circuits
33
Combinational Logic Circuits
2. Find the minterm expansion of the following
expression:
f = a'(b'+d)+acd'
= ∑m(0,1,2,3,5,7,10,14)
34
Karnaugh Map Technique
1 B
1 3 7 5
0 00 1 2 16 1 4 1 1 0 m6 1
1 11 0 3 0 7 0 5 1 1 1 m7 0
B
Groupings
Grouping a pair of adjacent 1’s eliminates the
variable that appears in complemented and
uncomplemented form.
38
Kmap