Scribd
Upload
154 views8 pages

Ws 1 DigitalLogic

1) There are two types of digital logic: combinational logic which produces the same output for given inputs, and sequential logic which has memory so the output depends on the current input and memory contents. 2) Logic gates like AND, OR, and NOT are used to implement digital logic, along with more complex components like flip-flops which can store state. 3) Boolean algebra laws and Karnaugh maps can be used to simplify logical expressions and minimize the number of gates needed for implementation.

Uploaded by

Naveen Kumar
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
154 views8 pages

Ws 1 DigitalLogic

1) There are two types of digital logic: combinational logic which produces the same output for given inputs, and sequential logic which has memory so the output depends on the current input and memory contents. 2) Logic gates like AND, OR, and NOT are used to implement digital logic, along with more complex components like flip-flops which can store state. 3) Boolean algebra laws and Karnaugh maps can be used to simplify logical expressions and minimize the number of gates needed for implementation.

Uploaded by

Naveen Kumar
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

9/16/2008

1
Digital Logic Digital Logic
COMP375 Computer Architecture
dO i ti and Organization
Types of Digital Logic
Combinational Logic Digital circuits
th t h Th i t that have no memory. The same inputs
always produce the same output.
Sequential Logic Logic elements with
memory whose output depends on the
input and the current contents of the input and the current contents of the
memory.
Logic Gates
AND *
OR +
NOT X
Negative Logic Gates
NAND NAND
NOR NOR
9/16/2008
2
Boolean Laws
Identity X +0 =X and X * 1 =X
One X +1 =1
Zero X * 0 =0
Inverse X +X =1 and X * X =0
Reflexive X +X =X and X * X =X
Commutative X +Y =Y +X and X*Y =Y*X
Associative X +(Y +Z) =(X +Y) +Z
X * (Y * Z) =(X * Y) * Z
Boolean Laws
Distributive X * (Y +Z) =(X * Y) +(X * Z)
X +(Y * Z) =(X +Y) * (X +Z)
DeMorgans X +Y =(X * Y)
X * Y =(X +Y) X Y (X Y)
Sum of Product Form
Sum of Product (A*B) +(C*D)
Product of Sums (A+B) * (C +D)
Truth Table to Function
A sumof products solution
A B C F
0 0 0 1
A sum of products solution
can be written by ORing
the lines of the truth table
that are true.
0 0 0 1
0 0 1 0
0 1 0 0
0 1 1 0
1 0 0 0
F =ABC +ABC +ABC
1 0 1 1
1 1 0 1
1 1 1 0
9/16/2008
3
Programmable Logic Array
PLAs implement
the sum of
products
Sequential Logic
Some logic circuits have memory that
d t i th f t t f th determines the future outcome of the
circuit.
Flip-flops are a simple sequential logic
elements.
SR Flip-Flops
An SR flip-flop can
b t t df be constructed from
two NOR gates
S R Action
0 0 Keep state
0 1 Q =0
1 0 Q =1
1 1
Restricted
combination
D Flip-Flop
A D flip-flop has
l d t i t
C D Q
next
Comment
0 X Q No change
only one data input
plus enable, C
0 X Q
prev
No change
1 0 0 Reset
1 1 1 Set
9/16/2008
4
Logic Simplification
It is frequently possible to simplify a logical
expression. This makes it easier to p
understand and requires fewer gates to
implement.
There are several simplification techniques
including Boolean algebra and Karnough
maps.
Karnough maps
CD CD CD CD
AB 0000 0001 0011 0010
AB 0100 0101 0111 0110
AB 1100 1101 1111 1110
AB 1000 1001 1011 1010
Single Variable Group of 8
CD CD CD CD
AB 0000 0001 0011 0010
AB 0100 0101 0111 0110
AB 1100 1101 1111 1110
AB 1000 1001 1011 1010
Single Variable Group of 8
CD CD CD CD
AB 0000 0001 0011 0010
AB 0100 0101 0111 0110
AB 1100 1101 1111 1110
AB 1000 1001 1011 1010
9/16/2008
5
Single Variable Group of 8
CD CD CD CD
AB 0000 0001 0011 0010
AB 0100 0101 0111 0110
AB 1100 1101 1111 1110
AB 1000 1001 1011 1010
Single Variable Group of 8
CD CD CD CD
AB 0000 0001 0011 0010
AB 0100 0101 0111 0110
AB 1100 1101 1111 1110
AB 1000 1001 1011 1010
Two Variable Group of 4
CD CD CD CD
AB 0000 0001 0011 0010
AB 0100 0101 0111 0110
AB 1100 1101 1111 1110
AB 1000 1001 1011 1010
Two Variable Group of 4
CD CD CD CD
AB 0000 0001 0011 0010
AB 0100 0101 0111 0110
AB 1100 1101 1111 1110
AB 1000 1001 1011 1010
9/16/2008
6
Two Variable Group of 4
CD CD CD CD
AB 0000 0001 0011 0010
AB 0100 0101 0111 0110
AB 1100 1101 1111 1110
AB 1000 1001 1011 1010
Two Variable Group of 4
CD CD CD CD
AB 0000 0001 0011 0010
AB 0100 0101 0111 0110
AB 1100 1101 1111 1110
AB 1000 1001 1011 1010
Two Variable Group of 4
CD CD CD CD
AB 0000 0001 0011 0010
AB 0100 0101 0111 0110
AB 1100 1101 1111 1110
AB 1000 1001 1011 1010
Two Variable Group of 4
CD CD CD CD
AB 0000 0001 0011 0010
AB 0100 0101 0111 0110
AB 1100 1101 1111 1110
AB 1000 1001 1011 1010
9/16/2008
7
Three Variable Pairs
CD CD CD CD
AB 0000 0001 0011 0010
AB 0100 0101 0111 0110
AB 1100 1101 1111 1110
AB 1000 1001 1011 1010
Three Variable Pairs
CD CD CD CD
AB 0000 0001 0011 0010
AB 0100 0101 0111 0110
AB 1100 1101 1111 1110
AB 1000 1001 1011 1010
Three Variable Pairs
CD CD CD CD
AB 0000 0001 0011 0010
AB 0100 0101 0111 0110
AB 1100 1101 1111 1110
AB 1000 1001 1011 1010
Three Variable Pairs
CD CD CD CD
AB 0000 0001 0011 0010
AB 0100 0101 0111 0110
AB 1100 1101 1111 1110
AB 1000 1001 1011 1010
9/16/2008
8
Example 1 bit Subtraction
Bin X Y Dif Bout
Diff =X - Y
0 0 0 0 0
0 0 1 1 1
0 1 0 1 0
0 1 1 0 0
1 0 0 1 1 1 0 0 1 1
1 0 1 0 1
1 1 0 0 0
1 1 1 1 1
Subtraction Karnough Maps
XY XY XY XY
Bin 0 1 0 1
Bin 1 0 1 0
Dif =XYBin +XYBin +XYBin +XYBin
Subtraction Karnough Maps
XY XY XY XY
Bin 0 1 0 0
Bin 1 1 1 0
Bout =XBin +XY +YBin

You might also like