Scribd
Upload
24 views9 pages

EDA Digital Logic

The document discusses digital logic functions and concepts. It defines logic gates like AND, OR, and NOT. It introduces Boolean algebra concepts such as Boolean space B, truth tables, and on-sets. It explains ways to represent functions including cube graphs, Karnaugh maps, and ordered binary decision diagrams. Key topics covered include logic gate symbols, truth tables, Boolean spaces Bn, minterms, logic optimization, and reduced ordered binary decision diagrams.

Uploaded by

YQ W
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
24 views9 pages

EDA Digital Logic

The document discusses digital logic functions and concepts. It defines logic gates like AND, OR, and NOT. It introduces Boolean algebra concepts such as Boolean space B, truth tables, and on-sets. It explains ways to represent functions including cube graphs, Karnaugh maps, and ordered binary decision diagrams. Key topics covered include logic gate symbols, truth tables, Boolean spaces Bn, minterms, logic optimization, and reduced ordered binary decision diagrams.

Uploaded by

YQ W
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/ 9

Digital Logic and Functions

P9-P20 of the lecture notes


Logic Gates
Expression Name Gate symbol

x NOT, Negation
xꞏy AND, Conjunction
xꞏy NAND, (NOT AND)
x+y OR, Disjunction
x+y NOR, (NOT OR)
x⊕y XOR, (excl. OR, Antivalence)
x⊕y XNOR, (Equivalence)
x ⊕ y=x ꞏ y + x ꞏ y x ⊕ y=x ꞏ y + x ꞏ y

Value assignment Truth values


x y x y x·y x·y x+y x+y x⊕y x⊕y
0 0 1 1 0 1 0 1 0 1
0 1 1 0 0 1 1 0 1 0
1 0 0 1 0 1 1 0 1 0
1 1 0 0 1 0 1 0 0 1

2
n
Boolean Space B
B = {0,1}
B2 = {0,1} X {0,1} = {00, 01, 10, 11}
B3 = {0,1} X {0,1} X {0,1} = {000, 001, 010, 011, 100, 101, 110,111}

0 1

B B2 B3

3
3
Boolean Space B
B3 = {0,1} X {0,1} X {0,1} = {000, 001, 010, 011, 100, 101, 110,111}

011 111 x1x2x3 x1x2x3

001 101 x1x2x3 x1x2x3

010 110 x1x2x3 x1x2x3

000 100 x1x2x3 x1x2x3


x3 x2
x1 B3 : 3-dimensional Boolean space

4
Truth Table and On-set
x1x2x3 f
011 111 000 1
001 0
001 101 010 1
011 0
010 110 100 1
101 0
000 100 110 1
111 1

The on-set of f is {x|f(x)=1}

On-set (f)={000, 010, 100, 110, 111}


f=x1x2x3 + x1x2x3 + x1x2x3 + x1x2x3+x1x2x3 logic
= x3 + x1x2 optimization
5
Cube Graph
A cube is defined as the AND of a set of
literals (“conjunction” of literals).
111 1-cube
011 111
x1x2
001 101 011 110 101

010 110
010 001 100
000 100 x3
2-cube Minterm: smallest cube
000 containing all variables
f=x1x2x3 + x1x2x3 + x1x2x3 + x1x2x3+x1x2x3
= x3 + x1x2

2-cube 1-cube
6
P26-P30 of the lecture notes
Karnaugh Map
111

011 110 101 000 010 110 100


001 011 111 101

010 001 100


x1x2
00 01 11 10
0 1 1 1 1
000 x3
1 0 0 1 0

f=x1x2x3 + x1x2x3 + x1x2x3 + x1x2x3+x1x2x3


= x3 + x1x2

7
P26 of the lecture notes
Reduced OBDD (ROBDD)
f (x, y, z) = x ꞏ y ꞏ z + y ꞏ z , x ≺ y ≺ z

x f (x, y, z)
0
1 y yz

z z

1 0

8
P44-P47 of the lecture notes
Thanks.

You might also like