Scribd
Upload
2 views

Lecture 4

The document covers the fundamentals of Boolean algebra, essential for understanding digital logic circuits. It explains key concepts such as Boolean addition (OR operation), Boolean multiplication (AND operation), and the standard forms of Boolean expressions: Sum-Of-Products (SOP) and Product-Of-Sums (POS). Additionally, it introduces DeMorgan's Theorems and provides examples of converting between SOP and POS forms.

Uploaded by

hussienyt3
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
2 views

Lecture 4

The document covers the fundamentals of Boolean algebra, essential for understanding digital logic circuits. It explains key concepts such as Boolean addition (OR operation), Boolean multiplication (AND operation), and the standard forms of Boolean expressions: Sum-Of-Products (SOP) and Product-Of-Sums (POS). Additionally, it introduces DeMorgan's Theorems and provides examples of converting between SOP and POS forms.

Uploaded by

hussienyt3
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/ 10

Islamic University

Computer Technology Engineering


First Class / Digital Electronics

Boolean Algebra and Logic Simplification

Lec.4

Zaid Salami
Boolean Operations and Expressions
 Boolean algebra is the mathematics of digital logic. A basic knowledge of Boolean
algebra is indispensable to the study and analysis of logic circuits.

 Variable, complement, and literal are terms used in Boolean algebra. A variable is a
symbol used to represent an action, a condition, or data. Any single variable can have
only a 1 or a 0 value. The complement is the inverse of a variable and is indicated by a
bar over the variable (overbar). For example, the complement of the variable A is 𝐴. If
A = 1, then 𝐴 = 0. The complement of the variable A is read as “not A” or “A bar”. A
literal is a variable or the complement of a variable.
A. Boolean Addition:
 Boolean addition is equivalent to the OR operation. In logic circuits, a sum term is
produced by an OR operation with no AND operations involved. Some examples of sum
terms are A + B, A + 𝐵 , A + B + 𝐶 , and A + B + C + 𝐷.
B. Boolean Multiplication:
 Boolean multiplication is equivalent to the AND operation. In logic circuits, a
product term is produced by an AND operation with no OR operations involved. Some
examples of product terms are AB, A 𝐵 , ABC, and A 𝐵 C𝐷.
Laws of Boolean Algebra
DeMorgan’s Theorems
 DeMorgan, a mathematician who knew Boole, proposed two theorems that are an important part of Boolean
algebra.
Standard Forms of Boolean Expressions
 All Boolean expressions, regardless of their form, can be converted into either of two standard forms: The
Sum-Of-Products (SOP) form or the Product-Of-Sums (POS) form.

 The Sum-of-Products (SOP) Form: A product term was a term consisting of the product (Boolean
multiplication) of literals (variables or their complements). When two or more product terms are summed by
Boolean addition, the resulting expression is a sum-of-products (SOP). Some examples are:

𝑨𝑩 + 𝑨𝑩𝑪

𝑨𝑩𝑪 + 𝑪𝑫𝑬 + 𝑩 𝑪 𝑫

𝑨 𝑩 + 𝑨 𝑩 𝑪 + 𝑨𝑪

Also, an SOP expression can contain a single-variable term, as in A + A BC + BCD.

For Example: ( 𝐴 + 𝐵 ) + 𝐶 = ( 𝐴 + 𝐵 ) 𝐶 = (𝐴 + 𝐵) 𝐶 = 𝐴 𝐶 + 𝐵 𝐶
 The Product-of-Sums (POS) Form: A sum term was a term consisting of the sum (Boolean addition) of
literals (variables or their complements). When two or more sum terms are multiplied, the resulting expression
is a product-of-sums (POS). Some examples are:

( 𝑨 + 𝑩)(𝑨 + 𝑩 + 𝑪)
( 𝑨 + 𝑩 + 𝑪 )(𝑪 + 𝑫 + 𝑬)( 𝑩 + 𝑪 + 𝑫)
𝑨 + 𝑩 𝑨 + 𝑩 + 𝑪 𝑨 + 𝑪

A POS expression can contain a single-variable term, as in 𝐴 (𝐴 + 𝐵 + 𝐶)( 𝐵 + 𝐶 + 𝐷).


EXAMPLE : Convert the following SOP expression to an equivalent POS expression:

𝐴 𝐵 𝐶 + 𝐴 𝐵 𝐶 + 𝐴 𝐵𝐶 + 𝐴 𝐵 𝐶 + 𝐴𝐵𝐶

Solution:

The evaluation is as follows: 000 + 010 + 011 + 101 + 111

You might also like