HDL I (Lecture 2)
HDL I (Lecture 2)
HDL I (Lecture 2)
(THANLYIN) DEPARTMENT OF
ELECTRONIC ENGINEERING
Chapter Objectives
• Truth table
Boolean Algebra 1b. 1+ 1 = 1
6a. x · 1 = x
Axioms of Boolean 2a. 1· 1 = 1
Algebra Single-Variable
6b. x + 0 = x
Theorems
1a. 0· 0 = 0 2b. 0+ 0 = 0
7a. x · x = x
5a. x · 0 = 0
5b. x + 1 = 1 3a. 0· 1 = 1 · 0 = 0
7b. x + x = x
3b. 1+ 0 = 0 + 1 = 1 6a. x · 1 = x
8a. x · x = 0
6b. x + 0 = x
4a. If x = 0, then �� = 1
8b. x + x = 1 7a. x · x = x
9. x = x 7b. x + x = x
4b. If x = 1, then �� = 0
8a. x · �� = 0
8b. x + �� = 1
Single-Variable Theorems
9. �� = x
5a. x · 0 = 0
5b. x + 1 = 1
Boolean Algebra
Two- and Three-Variable Properties
10b. x + y = y + x 14b. (x + y) · (x + �� ) = x
100
111
Logic circuit
Three Variables Minterms and
Maxterms
Sum Of Product and Product of Sum Form
Sum
000
001
010
011
100
101
110
111
Row
No. f
00
11
20
30
41
51
61
70
NAND and NOR Logic Networks
Using NOR Gates to Implement a Product-of-Sums
Example
2.1,2.2,2.3,2.4,2.5,2.6,2.7,2.8,2
.9,2.1 0,2.11,2.12,2.13
Design Example 1
Three-Way Light Control
Q: Assume that a large room has three doors and that a switch near each door controls a light in the
room. It has to be possible to turn the light on or off by changing the state of any one of the switches.
Multiplexer Circuit
Next Lecture • Introduction to CAD Tools