Boolean Algebra

Chapter 2 Boolean Algebra
Youngsoo Shin
KAIST Spring 2007
2.1 Introduction
Basic mathematics for logic design: Boolean algebra Switching algebra: two-valued Boolean algebra Boolean Variable: X, Y, can have only two Variable state values (0, 1) Boolean Operations
Binary op: AND (), OR (+) Unary op: NOT (`)
Youngsoo Shin/EE/KAIST 2
2.2 Basic Operations

NOT (complement, inverse)
0 = 1 X = 1 if X = 0
and and
1 = 0 X = 0 if X = 1
Gate Symbol
X
Youngsoo Shin/EE/KAIST
X
3

AND
00 = 0
Truth Table
0 1 = 0
A B 0 0 1 1 0 1 0 1
10 = 0
C=AB 0 0 0 1
1 1 = 1
Gate Symbol

OR
0+0 =0
Truth Table
0 +1 = 1
A B 0 0 1 1 0 1 0 1
1+0 =1
C=A+B 0 1 1 1
1 +1 = 1
Gate Symbol

Apply to Switch
2.3 Boolean Expressions and Truth Tables

Boolean Expression:
AB + C
Circuit of logic gates:

Boolean Expression:
Circuit of logic gates:
[A(C+D)] + BE
Logic Evaluation : A=B=C=1, D=E=0

Literal: a variable or its complement in a Boolean expression
abc + ab + abc + bc

Truth Table
F = A + B
A B 0 0 1 1 0 1 0 1
A 1 1 0 0
F = A + B 1 1 0 1
10

Proof using Truth Table AB + C = (A+C)(B+C)
A B C 0 0 0 0 1 1 1 1 0 0 1 1 0 0 1 1 0 1 0 1 0 1 0 1
11
AB
AB + C
A+C
B + C
(A + C) (B + C)
Digital System Design

System design Logic design Physical design
f = [A(C+D)] + BE
12
Digital System Design

Specifications Specifications High-level High-level Description Description
Behavioral VHDL, C
Functional Functional Description Description

Structural VHDL
Synthesis
Placed Placed & Routed & Routed Design Design

Packaging
Physical Design
Gate-level Gate-level Design Design
Technology Mapping
Logic Logic Description Description

X=(AB*CD)+ (A+D)+(A(B+C)) Y = (A(B+C)+AC+ D+A(BC+D))
Fabrication
13
2.4 Basic Theorems

Operations with 0, 1 Idempotent Laws Involution Laws Complementary Laws
Example
X+0=X X+1=1 X+X=X (X) = X X + X = 1
X1=X X0=0 XX=X
X X = 0
(AB + D)E + 1 = (AB + D)(AB+D) =
14
2.5 Commutative, Associative, and Distributive Laws

Commutative Laws: Associative Laws: XY = YX X+Y=Y+X (XY)Z = X(YZ) = XYZ (X + Y) + Z = X + (Y + Z) = X + Y + Z
Proof of Associative Law for AND
X 0 0 0 0 1 1 1 1
Y 0 0 1 1 0 0 1 1
Z 0 1 0 1 0 1 0 1
XY
YZ
(XY)Z
X(YZ)
15
3-input AND gate
ABC = 1
iff
A = B = C = 1
3-input OR gate
A + B + C = 0
iff
A = B = C = 0
16

Distributive Laws: X(Y + Z) = XY + XZ X + YZ = (X + Y)(X + Z)
Proof
17
2.6 Simplification Theorems

Useful Theorems for Simplification
XY + XY = X X + XY = X (X + Y)Y = XY
(X + Y)(X + Y) = X X(X + Y) = X XY + Y = X + Y
Proof
18
2.6 Simplification Theorems

Examples
F = A(A + B) = AB
Z = ABC + A Z = [A + BC + D + EF][A + BC + (D + EF)] Z = (AB + C)(BD + CE) + (AB + C)
19
2.7 Multiplying Out and Factoring

SOP (sum-of-products) form:
all products are the products of only single variables
Examples
AB + CDE + ACE ABC + DEFG + H A + B + C + DE (A + B)CD + EF

Distributive Laws X(Y + Z) = XY + XZ X + YZ = (X + Y)(X + Z)
Multiplying out to get SOP
(A + BC)(A + D + E)
20
2.7 Multiplying Out and Factoring

POS (product-of-sums) form:
all sums are the sums of single variables
Examples
(A + B)(C + D + E)(A + C + E) (A + B)(C + D + E)F ABC(D + E)

Distributive Laws X(Y + Z) = XY + XZ X + YZ = (X + Y)(X + Z)
Factoring to get POS
A + BCD AB + CD
21
2.8 DeMorgans Laws

DeMorgans Laws
Proof
(X + Y) = XY (XY) = X + Y
DeMorgans Laws for n variables
(X1 + X2 + X3 + + Xn) = X1X2X3Xn (X1X2X3Xn) = X1 + X2 + X3 + + Xn

Example
F = AB + AB
F =
22
2.8 DeMorgans Laws

Dual:
dual is formed by replacing AND with OR, OR with AND, 0 with 1, 1 with 0
(XYZ)D = X + Y + Z + (X + Y + Z + )D = XYZ (AB + C) = (AB)C = (A + B)C, so (AB + C)D = (A + B)C
23
Boolean Algebra
Boolean space: BN = {0, 1}N
N-dimensional cube (N-hypercube)
Boolean algebra
Boolean space Operations (+, )
B3={0,1}{0,1} {0,1} ={000, 001, 010, 011, 100, 101, 110, 111}
c 001 010 011 111
101 110
B4
000 b
100
24
Boolean Algebra
Consider Boolean expression f = ab + ac + bc + abc What do we want to achieve?
c 011 111
abc f 000 001 010 011 100 101 110 111

b
001 010
101 110
000
100
25
Summary
2.1 Boolean algebra, switching algebra 2.2 Boolean operations: NOT, AND, OR 2.3 Boolean expressions 2.4 Basic theorems
Operations w/ 0 and 1, idempotent laws, involution law, complementarity
2.5 Commutative, Associative, and Distibutive Laws 2.6 Simplification theorems 2.7 SOP, POS 2.8 DeMorgans laws
26

Boolean Algebra

Hochgeladen von

Dokumentinformationen

Originalbeschreibung:

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Boolean Algebra

Hochgeladen von

Copyright:

Verfügbare Formate

Chapter 2 Boolean Algebra

2.2 Basic Operations

2.2 Basic Operations

2.2 Basic Operations

2.2 Basic Operations

2.3 Boolean Expressions and Truth Tables

Circuit of logic gates:

2.3 Boolean Expressions and Truth Tables

Logic Evaluation : A=B=C=1, D=E=0

2.3 Boolean Expressions and Truth Tables

2.3 Boolean Expressions and Truth Tables

2.3 Boolean Expressions and Truth Tables

Digital System Design

Digital System Design

Functional Functional Description Description

Placed Placed & Routed & Routed Design Design

Gate-level Gate-level Design Design

Logic Logic Description Description

2.4 Basic Theorems

X+0=X X+1=1 X+X=X (X) = X X + X = 1

X1=X X0=0 XX=X

(AB + D)E + 1 = (AB + D)(AB+D) =

2.5 Commutative, Associative, and Distributive Laws

Proof of Associative Law for AND

2.5 Commutative, Associative, and Distributive Laws

3-input AND gate

2.5 Commutative, Associative, and Distributive Laws

2.6 Simplification Theorems

2.6 Simplification Theorems

Z = ABC + A Z = [A + BC + D + EF][A + BC + (D + EF)] Z = (AB + C)(BD + CE) + (AB + C)

2.7 Multiplying Out and Factoring

AB + CDE + ACE ABC + DEFG + H A + B + C + DE (A + B)CD + EF

Multiplying out to get SOP

2.7 Multiplying Out and Factoring

(A + B)(C + D + E)(A + C + E) (A + B)(C + D + E)F ABC(D + E)

Factoring to get POS

2.8 DeMorgans Laws

DeMorgans Laws for n variables

(X1 + X2 + X3 + + Xn) = X1X2X3Xn (X1X2X3Xn) = X1 + X2 + X3 + + Xn

2.8 DeMorgans Laws

(XYZ)D = X + Y + Z + (X + Y + Z + )D = XYZ (AB + C) = (AB)C = (A + B)C, so (AB + C)D = (A + B)C

abc f 000 001 010 011 100 101 110 111

Das könnte Ihnen auch gefallen