Vous êtes sur la page 1sur 8

Digital systems

Digital Logic A digital system is a system whose inputs and


outputs fall within a discrete, finite set of values
Two main types


Combinational
1


Outputs dependent only on current input 7


3


Sequential
ENEL 111 

Outputs dependent on both past and present inputs

Combinational Logic Circuits Example

Aims


Consider a buzzer which sounds when :




To express the inputs and outputs of a system in




The lights are on and


binary form


The door is open and A




No key is in the ignition B Alarm syste m P Active




To develop the relationships between these inputs and C


outputs as a truth table


To simplify the Boolean expression using algebra or VariableValue Situation


A 1 Lights are on
Karnaugh maps 0 Lights are off
B 1 Door is open


To select suitable electronic devices to implement the 0 Door is closed


C 1 Key is in ignition
required function 0 Key is out of ignition
P 1 Buzzer is on
0 Buzzer is off

1
Example Summary
A B C P
0 0 0 0
Truth Table 0 0 1 0 Inputs and Outputs are expressed in Binary Form


A Truth Table can be used 0 1 0 0


to show the relationships 0 1 1 0
A truth table showing relationships between
between : 1 0 0 0 inputs and outputs is constructed
the 3 inputs and 1 0 1 0
A circuit is built to implement the circuit


1 1 0 1


the single output


1 1 1 0

lights A
door B P buzzer
Implementation as a
circuit using logic gates keys C

This lecture Truth Tables and Boolean Notation

Circuits with one input


Truth tables for primitive functions
Buffer P=A A P
Boolean notation A P


0 0
Sum of products 1 1

Boolean algebra
A P


Not P=A
0 1 A P
1 0

2
Basic AND / OR Basic NAND / NOR
Circuits with two Inputs Problems with two Inputs

A B P
A B P
0 0 0
A 0 0 1 A


AND P = A.B 0 1 0 P 

NAND P = A.B 0 1 1 P
1 0 0 B 1 0 1
B
1 1 1
1 1 0

A B P
A B P 0 0 1
0 0 0 A 0 1 0
A
OR P=A+B P NOR P=A+B P
B
 

0 1 1 B 1 0 0
1 0 1 1 1 0
1 1 1

Basic XOR / XNOR Primitive gates

Circuits with two Inputs: All circuits can actually be made using AND, OR
and NOT gates if required.
A B P


XOR P=A⊕B 0 0 0
0 1 1
A
1 0 1 P
B
1 1 0

A B P

XNOR P = A ⊕ B

0 0 1 A
0 1 0 P
B
1 0 0 In terms of components used, it is generally easier to build inverting functions.
1 1 1 They typically require less transistors and also work faster than their non-
inverting cousins.

3
Exercise Not Symbol

A B A+B A.B A.B P


You should be aware that
Complete the truth table for
this circuit and name the
equivalent primitive
0 0 0 0 1 0 not A and not B
A.B A B A.B
function/gate. 0 0 1
0 1 1 0 1 1
and 0 1 0
1 0 0
1 0 1 0 1 1 not (A and B) equivalent to NAND A.B 1 1 0

1 1 1 1 0 0
are different.

Combinational Logic Circuits Our Example


Reminder from our overview A


To express the inputs and outputs of a system in




Consider a buzzer which B P


Alarm syste m Active
sounds when :
binary form C


To develop the relationships between these inputs and 

The lights are on and


outputs as a truth table VariableValue Situation


The door is open and A 1 Lights are on




To simplify the Boolean expression using algebra or 0 Lights are off


Karnaugh maps 

No key is in the ignition B 1 Door is open


0 Door is closed


To select suitable electronic devices to implement the C 1 Key is in ignition


0 Key is out of ignition
required function P 1 Buzzer is on
0 Buzzer is off

4
Very simple! Slightly more complex


Consider my car which complains by sounding a buzzer when I


have left the lights on or left the car in gear (not in Park) and
taken the keys out of the ignition:


The truth table


A B C P A B C P
what I’ve done
(lights on = 1) (in gear = 1) (keys out = 0) (buzzer)
0 0 0 0 A 0 0 0 0
0 0 1 0 B P 0 0 1 0
Alarm syste m Active
0 1 0 0 0 1 0 1 left in gear
C 0 1 1 0
0 1 1 0
1 0 0 1 left lights on
1 0 0 0 

The buzzer sounds only under this 1 0 1 0


1 0 1 0 condition 1 1 0 1 both
1 1 1 0
1 1 0 1 

A.B.C
1 1 1 0
A.B.C + A.B.C + A.B.C

Minimization Truth table shows the same result


A B C P A.C B.C A.C + B.C
The expression can be simplified in one of two
ways: 0 0 0 0 0 0 0
0 0 1 0 0 0 0
0 1 0 1 0 1 1
via algebra 0 1 1 0 0 0 0
via Karnaugh maps 1 0 0 1 1 0 1
1 0 1 0 0 0 0
1 1 0 1 1 1 1
to A.C + B.C 1 1 1 0 0 0 0

as the following truth table shows: A.B.C + A.B.C + A.B.C = A.C + B.C = (A + B).C

5
Means fewer logic gates are required Minterms and Maxterms

Notice the truth table has all possible A B C P


combinations of A,B and C included:
0 0 0 0
The minterm is obtained from the “product” of 0 0 1 0
A,B and C by AND-ing them
0 1 0 0
0 1 1 0
A.B.C
1 0 0 0
The maxterm is obtained from the “sum” of A,B 1 0 1 0
and C by OR-ing them and inverting inputs
1 1 0 1

A+B +C 1 1 1 0

Sum of Products/Product of Sums From our example:


For all combinations of inputs for which the output is a
logical true:
A B C P sum-of-products:
Combining the minterms with OR gives the sum-of- 0 0 0 0
products 0 0 1 0 A.B.C + A.B.C + A.B.C
0 1 0 1
For all combinations of inputs for which the output is a product-of-sums:
0 1 1 0
logical false: 1 0 0 1 A+B+C . A+B+C . A+B+C . A+B+C . A+B+C
1 0 1 0
Combining the maxterms with AND gives the product-of Normally the expression is derived using sum-
1 1 0 1
sums. of-products although product-of-sums yields
1 1 1 0 fewer terms when there are more 1 outputs
than 0 outputs.

6
Exercise Summary

A circuits desired outputs can be specified in


A B C P terms
Write out the sum-of-products expression for
0 0 0 1 the truth table : An boolean (logical) expression can be derived
0 0 1 1 from the truth table.
0 1 0 0
A.B.C + A.B.C + A.B.C + A.B.C
The boolean expression can then be simplified
0 1 1 0
now we see how…
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 0

Algebraic Laws DeMorgan


DeMorgan’s Laws DeMorgan’s Laws


The AND and OR functions can be shown to be 

Example: Implement the expression A.B + C.D using


related to each other through the following equations: only NAND gates

NOT the individual terms


A⋅ B = A+ B Change the sign


NOT the lot


A⋅ B = A+ B
A⋅ B = A+ B .
A⋅ B = A+ B

7
Boolean Algebraic Laws Basic rules of Boolean Algebra
A . A = A
Tautology (Idempotent) 

Example: Simplify the following Expression


A + A = A

Complementary
A . A = 0 P = A. ( B + C ) + A (C + B )
A + A = 1
= A
Operating with logic 0 A . 0 = 0 A . 1 = A
and logic 1 A + 0 = A A + 1 = 1 A.B + A.C+ A.C + A.B distributive
A . B = B . A
Commutative A.(B + B) + A.(C + C) re-distribute
A + B = B + A
A.1 + A.1 complementary
Associative (A.B).C = A.B.C = A.(B.C)
A+A op with logic 1
A.(B + C) = A.B + A.C
Distributive A idempotent
A + (B.C) = (A + B).(A + C)

Exercises

You should be able to:




Construct truth tables given boolean expressions




Compare expressions using truth tables




Produce a sum-of-products form from a truth table by


combining minterms


Simplify the resulting expression algebraically




Represent the expression as a circuit using logic gates

Vous aimerez peut-être aussi