Scribd
Upload
7 views25 pages

2 - Boolean Algebra and Logic Gates

The document discusses Boolean Algebra and its application in digital circuits, emphasizing the importance of mathematical methods for circuit simplification. It outlines the basic definitions and postulates of Boolean Algebra, including closure, associative law, and identity elements, as well as the axiomatic definition and two-valued Boolean Algebra. Additionally, it covers Boolean functions, minterms, maxterms, standard forms, and various logic operators.

Uploaded by

Labibeh Taghizadeh
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
7 views25 pages

2 - Boolean Algebra and Logic Gates

The document discusses Boolean Algebra and its application in digital circuits, emphasizing the importance of mathematical methods for circuit simplification. It outlines the basic definitions and postulates of Boolean Algebra, including closure, associative law, and identity elements, as well as the axiomatic definition and two-valued Boolean Algebra. Additionally, it covers Boolean functions, minterms, maxterms, standard forms, and various logic operators.

Uploaded by

Labibeh Taghizadeh
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/ 25

Boolean Algebra and Logic Gates

Dr. Hossein Omidian


Introduction
• Binary logic is used in all today’s digital computer and devices
• The cost of the circuits that implement it is an important factor
• Mathematical methods that simplify circuits relay on Boolean Algebra
Basic Definitions – Common Postulates
• Closure
• A set S is closed with respect to a binary operator if for every pair of element of S, the binary operator specifies a rule for obtaining a unique
element of S.
• Associative law
• A binary operation * on a set S is said to be associative whenever
• 𝑥 ∗ 𝑦 ∗ 𝑧 = 𝑥 ∗ 𝑦 ∗ 𝑧 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑥, 𝑦, 𝑧 ∈ 𝑆
• Commutative law
• 𝑥 ∗ 𝑦 = 𝑦 ∗ 𝑥 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑥, 𝑦 ∈ 𝑆
• Identity element
• A set S is said to have an identity element with respect to a binary operation *
• 𝑒 ∗ 𝑥 = 𝑥 ∗ 𝑒 = 𝑥 𝑓𝑜𝑟 𝑒𝑣𝑒𝑟𝑦 𝑥 ∈ 𝑆
• Inverse
• A set S having the identity element e with respect to a binary operation * is said to have an inverse whenever, for every 𝑥 ∈ 𝑆, there exist and
element y ∈ 𝑆 such that
• 𝑥∗𝑦 = 𝑒
• Distributive law
• If * and . are two binary operation on a set S, * is said to be distributive over . Whenever
• 𝑥 ∗ 𝑦. 𝑧 = 𝑥 ∗ 𝑦 . (𝑥 ∗ 𝑧)
Axiomatic Definition of Boolean Algebra
• Boolean algebra is an algebraic structure defined by a set of elements, B, together with
two binary operators, + and ., provided that the following Huntington postulates are
satisfied
1. (a) Closed with respect to the operator + and (b) closed with respect to the operator .
2. Element 0 is identity for + and element 1 is identity for .
• x+0=0+x=x and x.1=1.x=x
3. For both operators the structure is commutative
• x+y=y+x and x.y=y.x
4. The operator . is distributive over + and vice versa
• x.(y+z) = (x.y)+(x.z) and x+(y.z) = (x+y).(x+z)
• Is this applicable to arithmetic and ordinary algebra?
5. For every element 𝑥 ∈ 𝐵, there exists and element 𝑥′ ∈ 𝐵 (complement of x) such that
• 𝑥 + 𝑥 ′ = 1 and 𝑥. 𝑥 ′ = 0
6. There exist at least two elements 𝑥, 𝑦 ∈ 𝐵such that 𝑥 ≠ 𝑦
Two-Valued Boolean Algebra
• Defined on a set of two elements, B=[0,1]

• Let’s go over all the 6 Huntington postulates for this structure


Postulates and Theorems of Boolean Algebra
Boolean Functions
• Deals with binary variables and logic operations.
• A Boolean function described by an algebraic expression consists of binary variables, the constants 0 and 1,
and the logic operation symbols. For a given value of the binary variables, the function can be equal to either
1 or 0.
• 𝐹1 = 𝑥 + 𝑦 ′ 𝑧
• 𝐹2 = 𝑥 ′ 𝑦 ′ 𝑧 + 𝑥 ′ 𝑦𝑧 + 𝑥𝑦 ′

𝐹2 = 𝑥 ′ 𝑦 ′ 𝑧 + 𝑥 ′ 𝑦𝑧 + 𝑥𝑦 ′
= 𝑥 ′ 𝑧 𝑦 ′ + 𝑦 + 𝑥𝑦 ′ = 𝑥 ′ 𝑧 + 𝑥𝑦 ′
Logic diagram for F1 = x + y'z
Implementation of Boolean function F2
Complement of a Function
• Complement of function F is F’
Minterms and Maxterms
• Two binary variables x and y combined with AND may appear in 4 possible forms:
x’y’,x’y,xy’and xy (minterms or standard products)
• Similarly, for OR possible forms will be x+y, x+y’, x’+y and x’+y’ (maxterms or
standard sums)
Example
Example
• 𝑓1 = 𝑥 ′ 𝑦 ′ 𝑧 + 𝑥𝑦 ′ 𝑧 ′ + 𝑥𝑦𝑧 = 𝑚1 + 𝑚4 + 𝑚7
• 𝑓1′ = 𝑥 ′ 𝑦 ′ 𝑧 ′ + 𝑥 ′ 𝑦𝑧 ′ + 𝑥 ′ 𝑦𝑧 + 𝑥𝑦 ′ 𝑧 + 𝑥𝑦𝑧 ′
• 𝑓1 = 𝑥 + 𝑦 + 𝑥 . 𝑥 + 𝑦 ′ + 𝑧 . 𝑥 + 𝑦 ′ + 𝑧′ . 𝑥′ + 𝑦 + 𝑧′ .
𝑥′ + 𝑦′ + 𝑧 = 𝑀0 . 𝑀2 . 𝑀3 . 𝑀5 . 𝑀6
Sum of Minterms and Product of Maxterms
• The minterms whose sum defines the Boolean function are those
which give the 1’s of the function in a truth table.
• Function can be either 0 or 1 for each minterm
• There are 2𝑛 minterms
2𝑛
• All the function that can be formed with n-variable calculated as 2
2𝑛
• Each of the2 functions of n binary variables can be also expressed
as a product of maxterms.
Example
𝐹 = 𝐴 + 𝐵′ 𝐶
𝐴 = 𝐴 𝐵 + 𝐵′ = 𝐴𝐵 + 𝐴𝐵′ = 𝐴𝐵 𝐶 + 𝐶 ′ + 𝐴𝐵′ 𝐶 + 𝐶 ′
= 𝐴𝐵𝐶 + 𝐴𝐵𝐶 ′ + 𝐴𝐵′ 𝐶 + 𝐴𝐵′ 𝐶′
𝐵′ 𝐶 = 𝐵′ 𝐶 𝐴 + 𝐴′ = 𝐴𝐵′ 𝐶 + 𝐴′ 𝐵′ 𝐶
𝐹 = 𝐴 + 𝐵′ 𝐶 = 𝐴𝐵𝐶 + 𝐴𝐵𝐶 ′ + 𝐴𝐵′ 𝐶 + 𝐴𝐵′ 𝐶 ′ + 𝐴′ 𝐵′ 𝐶
= 𝑚1 + 𝑚4 + 𝑚5 + 𝑚6 + 𝑚7 = ෍(1,4,5,6,7)
Example
𝐹 = 𝑥𝑦 + 𝑥 ′ 𝑧
= 𝑥𝑦 + 𝑥 ′ 𝑥𝑦 + 𝑧 = 𝑥 + 𝑥 ′ 𝑦 + 𝑥 ′ 𝑥 + 𝑧 𝑦 + 𝑧
= (𝑥 ′ + 𝑦)(𝑥 + 𝑧)(𝑦 + 𝑧)
𝑥 ′ + 𝑦 = 𝑥 ′ + 𝑦 + 𝑧𝑧 ′ = 𝑥 ′ + 𝑦 + 𝑧 𝑥 ′ + 𝑦 + 𝑧 ′
𝑥 + 𝑧 = 𝑥 + 𝑧 + 𝑦𝑦 ′ = (𝑥 + 𝑦 + 𝑧)(𝑥 + 𝑦 ′ + 𝑧)
𝑦 + 𝑧 = 𝑦 + 𝑧 + 𝑥𝑥 ′ = (𝑥 + 𝑦 + 𝑧)(𝑥 ′ + 𝑦 + 𝑧)
𝐹 = 𝑥𝑦 + 𝑥 ′ 𝑧 = 𝑥 + 𝑦 + 𝑧 𝑥 + 𝑦 ′ + 𝑧 𝑥 ′ + 𝑦 + 𝑧 𝑥 ′ + 𝑦 + 𝑧 ′
= 𝑀0 𝑀2 𝑀4 𝑀5 = ෑ(0,2,4,5)
Conversion between Canonical Forms
𝐹 𝐴, 𝐵, 𝐶 = ∑ 1,4,5,6,7
𝐹′ 𝐴, 𝐵, 𝐶 = ∑ 0,2,3
= 𝑚0 + 𝑚2 + 𝑚3
𝐹 = 𝑚0 + 𝑚2 + 𝑚3 ′ = 𝑚0 ′𝑚2 ′𝑚3 ′
= 𝑀0 𝑀2 𝑀3 = ∏(0,2,3)
𝑚𝑗 ′ = 𝑀𝑗
Example
Standard Forms
• Sum of Products
• Containing AND terms called product terms
• The sum denotes the ORing of those terms
• Example: 𝐹1 = 𝑦 ′ + 𝑥𝑦 + 𝑥 ′ 𝑦𝑧′
• Product of Sums
• Containing OR terms called sum terms
• The product denotes the ANDing of those terms
• Example: 𝐹2 = 𝑥(𝑦 ′ + 𝑧)(𝑥 ′ + 𝑦 + 𝑧 ′ )
Three and Two-level Implementation
𝐹3 = 𝐴𝐵 + 𝐶 𝐷 + 𝐸
𝐹3 = 𝐴𝐵 + 𝐶𝐷 + 𝐶𝐸
Other Logic Operators
Demonstrating the nonassociativity of the NOR operator
Multi-input and cascaded NOR and NAND
Three-input exclusive OR
Positive and Negative Logic

You might also like