Scribd
Upload
12 views

DLD Lecture 5

Digital logic design involves binary logic and logic gates. Logic gates implement basic logical operations like AND, OR, and NOT using electronic components like transistors. Common logic gates include AND, OR, NAND, NOR, and NOT. Logic functions can be represented using truth tables, Boolean equations, or logic diagrams. Logic gates are used as building blocks to design more complex digital circuits and systems.

Uploaded by

speado record
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
12 views

DLD Lecture 5

Digital logic design involves binary logic and logic gates. Logic gates implement basic logical operations like AND, OR, and NOT using electronic components like transistors. Common logic gates include AND, OR, NAND, NOR, and NOT. Logic functions can be represented using truth tables, Boolean equations, or logic diagrams. Logic gates are used as building blocks to design more complex digital circuits and systems.

Uploaded by

speado record
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 24

Digital Logic Design

Dr. Irfan Yousuf


Department of Computer Science (New Campus)
UET, Lahore
(Lecture # 5; March 11, 2020)
Outline
• Logic Gates
Binary Logic and Gates
▪ Binary variables take on one of two values.
▪ Logical operators operate on binary values and binary
variables.
▪ Basic logical operators are the logic functions AND, OR and
NOT.
▪ Logic gates implement logic functions.
▪ Boolean Algebra: a useful mathematical system for
specifying and transforming logic functions.
▪ We study Boolean algebra as foundation for designing and
analyzing digital systems!
Binary Variables
▪ Recall that the two binary values have different names:
• True/False
• On/Off
• Yes/No
• 1/0
▪ We use 1 and 0 to denote the two values.
▪ Variable identifier examples:
• A, B, y, z, or X1
Logical Operations
▪ The three basic logical operations are:
• AND
• OR
• NOT
▪ AND is denoted by a dot (·).
▪ OR is denoted by a plus (+).
▪ NOT is denoted by an overbar ( ¯ ), a single quote mark (')
after, or (~) before the variable.
Notation Examples

▪ Examples:
• Y = A.B is read “Y is equal to A AND B.”
• z = x+y is read “z is equal to x OR y.”
• X=Ā is read “X is equal to NOT A.”
▪ Note: The statement:
1 + 1 = 2 (read “one plus one equals two”)
is not the same as
1 + 1 = 1 (read “1 or 1 equals 1”).
Operator Definitions

▪ Operations are defined on the values "0" and "1" for each
operator:

AND OR NOT
0·0=0 0+0=0 0=1
0·1=0 0+1=1 1=0
1·0=0 1+0=1
1·1=1 1+1=1
Truth Tables

▪ Truth table - a tabular listing of the values of a function for


all possible combinations of values on its arguments
▪ Example: Truth tables for the basic logic operations:

AND OR NOT
X Y Z = X·Y X Y Z = X+Y X Z=X
0 0 0 0 0 0 0 1
0 1 0 0 1 1 1 0
1 0 0 1 0 1
1 1 1 1 1 1
Logic Function Implementation

▪ Using Switches Switches in parallel => OR


• For inputs:
▪ logic 1 is switch closed
▪ logic 0 is switch open
• For outputs: Switches in series => AND
▪ logic 1 is light on
▪ logic 0 is light off.
• NOT uses a switch such Normally-closed switch => NOT
that: C
▪ logic 1 is switch open
▪ logic 0 is switch closed
Logic Function Implementation (Continued)

▪ Example: Logic Using Switches


B C
A

▪ Light is on (L = 1) for
L(A, B, C, D) = ?
and off (L = 0), otherwise.
▪ Useful model for relay circuits and for gate circuits, the
foundation of current digital logic technology
Logic Function Implementation (Continued)

▪ Example: Logic Using Switches


B C
A

▪ Light is on (L = 1) for
L(A, B, C, D) = A B C' + A D
and off (L = 0), otherwise.
▪ Useful model for relay circuits and for gate circuits, the
foundation of current digital logic technology
Logic Gates
▪ In the earliest computers, switches were opened and closed
by magnetic fields produced by energizing coils in relays.
The switches in turn opened and closed the current paths.
▪ Later, vacuum tubes that open and close current paths
electronically replaced relays.
▪ Today, transistors are used as electronic switches that open
and close current paths.
Logic Gates (continued)

▪ Implementation of logic gates with transistors


+V
+V
•
•
• • +V

X .Y
•• •
F • X • •
X

G = X +Y
• • X •
X •
Y •
Y •
•

(a) NOR (b) NAND (c) NOT

▪ Transistor or tube implementations of logic functions are


called logic gates or just gates
▪ Transistor gate circuits can be modeled by switch circuits
Logic Gate Symbols
Digital Timing Diagram

▪ A digital timing diagram is a representation of a set of


signals in the time domain.
▪ Besides providing an overall description of the timing
relationships, the digital timing diagram can help find and
diagnose digital logic hazards.
Logic Gate Symbols and Behavior
Logic Gate Symbols and Behavior
Logic Gate Symbols and Behavior
Logic Gates with multiple inputs
Logic Diagrams and Expressions

Truth Table Equation


XYZ F = X + Y Z
000 0 F = X +Y Z
001 1
010 0 Logic Diagram
011 0 X
100 1
101 1 Y F
110 1
Z
111 1
▪ Boolean equations, truth tables and logic diagrams describe the same
function!
▪ Truth tables are unique; expressions and logic diagrams are not. This
gives flexibility in implementing functions.
Logic Diagrams and Expressions
Logic Diagrams and Expressions
Logic Diagrams and Expressions
Summary
• Logic gates

You might also like