0% found this document useful (0 votes)
13 views35 pages

Lecture - 0 Basic Logic Operations

Uploaded by

martin matute
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
13 views35 pages

Lecture - 0 Basic Logic Operations

Uploaded by

martin matute
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 35

Digital System Design

Basic Logic Operations


and
Standard Logic Gates
(Lecture #1)
What is an analog signal?

2
Analog Signal
⚫ An analog signal is a signal that can take on a
continuous range of values.

3
Analog Signal
⚫ Most, if not all, physical (naturally occurring)
quantities are analog values.
− Time
− Temperature
− Pressure

Spring 2011 ECE 301 - Digital Electronics 4


What is an digital signal?

Spring 2011 ECE 301 - Digital Electronics 5


Digital Signal
⚫ An digital signal is a signal that can take on
only discrete (specific) values.

Spring 2011 ECE 301 - Digital Electronics 6


What is an binary signal?

Spring 2011 ECE 301 - Digital Electronics 7


Binary Signal
⚫ An binary signal is a signal that can take on
only two values.
− Typically represented by 0 and 1.

Spring 2011 ECE 301 - Digital Electronics 8


Can a binary number be used to represent an
analog value?

What about accuracy (or is it precision)?

Spring 2011 ECE 301 - Digital Electronics 9


Can a binary number be used to represent an
digital value?

How many bits are required?

Spring 2011 ECE 301 - Digital Electronics 10


Processing Physical Quantities
⚫ The analog signal (representing the physical
quantity) must be sampled at specific
instances in time.
⚫ The sampled values must be digitized.
⚫ The digital value must be encoded in binary.

analog Sample sampled digital binary


Binary
and ADC
Encoder
Hold

Spring 2011 ECE 301 - Digital Electronics 11


Basic Logic Operations

Spring 2011 ECE 301 - Digital Electronics 12


AND
Definition: the output is true (1) iff both inputs
are true (1).
logical operator

F = A.B = AB = “A and B” A B A.B


0 0 0
Boolean expression
0 1 0
1 0 0
1 1 1
F
Truth table
Symbol (aka. logic gate)

Spring 2011 ECE 301 - Digital Electronics 13


OR
Definition: the output is true (1) if either or both
inputs are true (1).
logical operator

F = A+B = “A or B” A B A+B
0 0 0
Boolean expression
0 1 1
1 0 1
1 1 1
FF
Truth table
Symbol

Spring 2011 ECE 301 - Digital Electronics 14


NOT
Definition: the output is true (1) if the input is
false (0).
logical operator

F = A' = “ not A” A A'


Boolean expression 0 1
1 0
Truth table
A F = A'
Symbol

Spring 2011 ECE 301 - Digital Electronics 15


Order of Precedence

⚫ The order of precedence of the basic logic


operations is defined as follows:
– NOT
– AND
– OR
⚫ The order of precedence can be modified by
using parenthesis.

Spring 2011 ECE 301 - Digital Electronics 16


Functionally Complete

⚫ The AND, OR, and NOT operations comprise


a functionally complete set.
⚫ All logic functions can be expressed in terms
of these logic operations.
⚫ All logic circuits can be realized using the
associated logic gates.

Spring 2011 ECE 301 - Digital Electronics 17


NAND
Definition: the output is false (0) iff both inputs
are true (1).

F = (A.B)' = “not (A and B)” A B (A . B)'


0 0 1
Boolean expression
0 1 1
1 0 1
1 1 0
F = (A.B)'
Truth table
Symbol
shorthand for inversion

Spring 2011 ECE 301 - Digital Electronics 18


NOR
Definition: the output is false (0) if either or both
inputs are true (1).

F = (A+B)' = “not (A or B)” A B (A+B)'


0 0 1
Boolean expression
0 1 0
1 0 0
1 1 0
FFFF= (A+B)'
Truth table
Symbol
shorthand for inversion

Spring 2011 ECE 301 - Digital Electronics 19


XOR
Definition: the output is true (1) if either but not
both inputs are true (1).

F = A xor B A B A xor B
0 0 0
Boolean expression
0 1 1
logical operator
1 0 1
1 1 0

Truth table
Symbol

Spring 2011 ECE 301 - Digital Electronics 20


XNOR (aka. Equivalence)
Definition: the output is false (0) if either but not
both inputs are true (1).

F = A xnor B
A B A xnor B
Boolean expression
logical operator
0 0 1
0 1 0
1 0 0
1 1 1
Symbol
Truth table

Spring 2011 ECE 301 - Digital Electronics 21


Logic Circuits
⚫ Logic circuits are realized through the
interconnection of logic gates.
− Each logic gate represents a logical operation.
⚫ This can be done using
− discrete components
⚫ Standard Logic Gates
− programmable devices
⚫ Read-only Memories (ROM)
⚫ Programmable Logic Devices (PLD)
⚫ Field Programmable Gate Arrays (FPGA)
Spring 2011 ECE 301 - Digital Electronics 22
Standard Logic Gates

Spring 2011 ECE 301 - Digital Electronics 23


Standard Logic Gates
Device Logic Gate
74xx08 Quad 2-input AND gate
74xx32 Quad 2-input OR gate
74xx04 Hex Inverter (NOT gate)
74xx00 Quad 2-input NAND gate
74xx02 Quad 2-input NOR gate
74xx86 Quad 2-input XOR gate

Note: “xx” refers to the logic family

Spring 2011 ECE 301 - Digital Electronics 24


Standard Logic Gates
⚫ Data sheets provide essential information:
− Logic Function
− Truth Table
− Pin-out
− Electrical Characteristics
− Timing Characteristics
− Package Description(s)
⚫ This information is necessary when building logic
circuits from discrete components.
⚫ Each logic family has a unique set of characteristics.
Spring 2011 ECE 301 - Digital Electronics 25
Standard Logic Gates: 74xx08

pin-out

Truth table

Spring 2011 ECE 301 - Digital Electronics 26


Standard Logic Gates: 74xx32

pin-out

Truth table

Spring 2011 ECE 301 - Digital Electronics 27


Standard Logic Gates: 74xx04

pin-out

Truth table

Spring 2011 ECE 301 - Digital Electronics 28


Building a Logic Circuit
Circuit
Diagram
C
74xx08
B
74xx04
inputs 74xx32 F output

74xx08
A

Boolean
F = B'.C + A.B Expression

Spring 2011 ECE 301 - Digital Electronics 29


Building a Logic Circuit
VDD
Wiring
Diagram
components
7404

wires
7408 7432

A
inputs B
C
F output

Spring 2011 ECE 301 - Digital Electronics 30


Example

Draw the circuit diagram and wiring diagram for


the following Boolean expression:

F = A'.B + A.B'

Spring 2011 ECE 301 - Digital Electronics 31


Example

(circuit diagram)

Spring 2011 ECE 301 - Digital Electronics 32


Example

Spring 2011 ECE 301 - Digital Electronics 33


Questions?

Spring 2011 ECE 301 - Digital Electronics 34


References:

All this material taken from:


Dr craig lorie george mason
university. (2017). Gmuedu. Retrieved 18 April,
2017, from http://ece.gmu.edu/~clorie/Spring11/ECE-
331/

You might also like