Vous êtes sur la page 1sur 11

11/28/2010

Digital Circuits I

Combinational Circuits

Formulating Boolean Expressions

Intuitive approach
 results in direct Boolean equations

Using truth tables


 results in minterm list or equations in SSOP format

University of the Philippines Joy Reyes-Madamba@2010 2


Electrical and Electronics Engineering Institute

1
11/28/2010

Reminders

Always define your variables! Indicate logic


levels and the associated event that triggers or
asserts it.
Read the problem completely before defining
and setting your variables.

University of the Philippines Joy Reyes-Madamba@2010 3


Electrical and Electronics Engineering Institute

Example: Intuitive Approach (1/3)

Roger will go home early this semestral break if


there is no exam on October 9 in EEE 8 and if he
can get his ticket. However, he can only afford
his ticket if he pays on September 30 to get a
discount. He can’t go to the ticket office to buy
his ticket and take his exam on the same day.
His teacher plans to hold their exam on October
2 if there are no conflicts with other subjects.

University of the Philippines Joy Reyes-Madamba@2010 4


Electrical and Electronics Engineering Institute

2
11/28/2010

Example: Intuitive Approach (2/3)

Objective: Formulate an expression that will


determine if Roger goes home early.

Variable definitions:
Let Home = 1 if Roger goes home early, else 0.
Ticket = 1 if Roger gets his ticket, else 0.
O2 = 1 if exam is on October 2, else 0.
O9 = 1 if exam is on October 9, else 0.
Conflict = 1 if exam is in conflict with other subjects, else 0

University of the Philippines Joy Reyes-Madamba@2010 5


Electrical and Electronics Engineering Institute

Example: Intuitive Approach (3/3)

Solution:
Home = (O9’)(Ticket)
Ticket = O2’ O2 = Conflict’
Home = (O9’)(O2’) substitute
= (O9’)(Conflict’)’ substitute
= (O9’)(Conflict) involution
University of the Philippines Joy Reyes-Madamba@2010 6
Electrical and Electronics Engineering Institute

3
11/28/2010

Example: Using Truth Tables (1/5)

A farmer has a large dog, a goat, and several heads of cabbage. In


addition, the farmer has 2 barns, A and B. The farmer has
chores to perform in both barns. However, if the dog and the
goat are left together without the farmer, the dog will bite the
goat. If the goat is left with the cabbage without the farmer, the
goat will eat the cabbage. To avoid either disaster, the farmer
asks us to build a small portable computer having 4 switches
representing the 4 characters. If a switch is connected to a
battery (logic 1), the character is in barn A. The computer
sounds an alarm if any combination results in a disaster. What is
the logic behind the computer?

University of the Philippines Joy Reyes-Madamba@2010 7


Electrical and Electronics Engineering Institute

Example: Using Truth Tables (2/5)

 Define input variables


Character Barn A Barn B
Farmer (F) 1 0
Dog (D) 1 0
Goat (G) 1 0
Cabbage © 1 0

University of the Philippines Joy Reyes-Madamba@2010 8


Electrical and Electronics Engineering Institute

4
11/28/2010

Example: Using Truth Tables (3/5)

Define output variable


 Alarm = 1 if “on” or ringing, 0 otherwise
Create truth table
1) List all possible input combinations
2) List outputs based on given input conditions
Select minterms

University of the Philippines Joy Reyes-Madamba@2010 9


Electrical and Electronics Engineering Institute

Example: Using Truth Tables (4/5)


FDGC Alarm FDGC Alarm
List
0000 0 1000 1 outputs
based on
List all 0001 0 1001 1 given
possible 0010 1010
0 0
inputs
0011 1 1011 0
0100 0 1100 1
0101 0 1101 0
0110 1 1110 0 minterms:
0111 1 1111 0 {3,6,7,8,9,12}
University of the Philippines Joy Reyes-Madamba@2010 10
Electrical and Electronics Engineering Institute

5
11/28/2010

Example: Using Truth Tables (5/5)

Formulate Boolean expression in SSOP form from


the list of minterms
Alarm(F,D,G,C) = Σm(3,6,7,8,9,12)
= F’D’GC + F’DGC’ + F’DGC + FD’G’C’ +
FD’G’C + FDG’C’

University of the Philippines Joy Reyes-Madamba@2010 11


Electrical and Electronics Engineering Institute

F D G C

Alarm

University of the Philippines Joy Reyes-Madamba@2010 12


Electrical and Electronics Engineering Institute

6
11/28/2010

All-NAND Implementation (1/3)

To convert to NAND


1) Express the function in SOP form.
2) Apply Involution
3) Apply De Morgan’s Theorem.
De Morgan’s Theorem
(x • y • z • …)’ = x’ + y’ + z’ + ...
=

University of the Philippines Joy Reyes-Madamba@2010 13


Electrical and Electronics Engineering Institute

All-NAND Implementation (2/3)


NOT

(x • x)’ = (x)’ = x’

NOT
AND

[(a • b)’]’ = a • b

University of the Philippines Joy Reyes-Madamba@2010 14


Electrical and Electronics Engineering Institute

7
11/28/2010

All-NAND Implementation (3/3)

SOP Involution
De Morgan

OR X Z X’ Z X’ Z
Y Y’ Y’

X
Z = X+Y

University of the Philippines Joy Reyes-Madamba@2010 15


Electrical and Electronics Engineering Institute

Example

Implement F = (AB’ + A’C)’ using NAND gates


only

University of the Philippines Joy Reyes-Madamba@2010 16


Electrical and Electronics Engineering Institute

8
11/28/2010

All-NOR Implementation (1/3)

To convert to NOR


1) Express the function in POS form.
2) Apply Involution
3) Apply De Morgan’s Theorem
De Morgan’s Theorem
(x + y + z + ...)’ = x’ • y’ • z’ • ...
=
University of the Philippines Joy Reyes-Madamba@2010 17
Electrical and Electronics Engineering Institute

All-NOR Implementation (2/3)


NOT

(x + x)’ = (x)’ = x’
NOT
OR

[(a + b)’]’ = a + b

University of the Philippines Joy Reyes-Madamba@2010 18


Electrical and Electronics Engineering Institute

9
11/28/2010

All-NOR Implementation (3/3)

POS Involution De Morgan

X Z X’ Z X’ Z
AND
Y Y’ Y’

X
Z = XY

University of the Philippines Joy Reyes-Madamba@2010 19


Electrical and Electronics Engineering Institute

Example

 Implement F = (AB’ + A’C)’ using NOR gates


only

University of the Philippines Joy Reyes-Madamba@2010 20


Electrical and Electronics Engineering Institute

10
11/28/2010

Exercises:
Convert these functions to SSOP and SPOS, then
re-implement using only NAND and NOR gates
1. F1 = (AB+C+D)(C’+D)(C’+D+E)
2. F2 = AB+A’C+BC
3. F3 = A’B’C’+A’BC’+ABC’+AB’C’
4. F4 = A’C+A’B+AB’C+BC
5. F5 = AB’C+B’C’D’+BCD+ACD’+A’B’C+A’BC’D
6. F6 = A’D+BD+B’C+AB’D
University of the Philippines Joy Reyes-Madamba@2010 21
Electrical and Electronics Engineering Institute

11

Vous aimerez peut-être aussi