Scribd
Upload
9 views18 pages

Session_02_Boolean Algebra

The session aims to teach students the fundamentals of Boolean Algebra, including its laws and optimization methods for digital circuit design. Students will learn to manipulate logical expressions and apply Boolean principles to simplify complex circuits. The document also covers key theorems, properties, and self-assessment questions to reinforce understanding.

Uploaded by

Bere Praveen Sai
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 views18 pages

Session_02_Boolean Algebra

The session aims to teach students the fundamentals of Boolean Algebra, including its laws and optimization methods for digital circuit design. Students will learn to manipulate logical expressions and apply Boolean principles to simplify complex circuits. The document also covers key theorems, properties, and self-assessment questions to reinforce understanding.

Uploaded by

Bere Praveen Sai
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/ 18

Department of ECE

Digital Design and Computer Architecture


23EC1202
Topic:
BOOLEAN ALGEBRA

Session – 02
AIM OF THE SESSION

To familiarize students with the basic concept of Boolean Algebra laws and optimization methods.

INSTRUCTIONAL OBJECTIVES
This Session is designed to:
1. Develop a comprehensive understanding of Boolean algebra, including its fundamental operations, laws, and theorems, to analyze
and simplify complex logical expressions and circuits.
2. Acquire the skills to apply Boolean algebra in the design and optimization of digital circuits, fostering the ability to manipulate
logical symbols and equations to achieve desired logical outcomes efficiently.

LEARNING OUTCOMES

At the end of this session, you should be able to:


1. Demonstrate the ability to manipulate and simplify logical expressions using Boolean algebra, showcasing proficiency in applying
fundamental operations, laws, and theorems.
2. Acquire the skills to design and optimize digital circuits using Boolean algebra, leading to efficient and streamlined logical
structures in various applications.
BOOLEAN ALGEBRA
• Boolean Algebra is a means for expressing the relation between inputs and outputs of a logic circuit.
• It can be used to analyze a logic circuit and express its operation mathematically.
• Boolean variable is used to represent the voltage level present on a wire or the input/output
terminal of a circuit.
• Boolean variable can be represented with capital or small alphabets (eg: A, B, X, Z, a, c, p, x, y etc.)
and at any time, it takes either logic 0 (LOW) or logic 1 (HIGH).
• Advantages of Boolean Algebra over ordinary Algebra:
• Easy to understand or use as only two binary values are present.
• No fractions, decimals, negative numbers, roots, logarithms, etc.
• Contains only three functions AND ( · ), OR ( + ), and NOT ( ’ (or) ̅ ).
BOOLEAN ALGEBRA PRINCIPLES
Boolean Algebra Principles

• Boolean algebra defines laws and theorems which can be used for simplification of logic functions.

Complement of a variable

• The complement of a variable is also known as its "negation" or "inverse."

• It is denoted by placing a bar ( ̅ (or) ’) over the variable.

ഥ ” or (x’) .
Example: For a variable “ 𝒙 ”, the complement is “ 𝒙

Single variable theorems

𝒂) 𝒙 + 𝟎 = 𝟎 + 𝒙 = 𝒙 𝒃) 𝒙 . 𝟏 = 𝟏 . 𝒙 = 𝒙 ഥ= 𝟏
𝒄) 𝒙 + 𝒙 ഥ= 𝟎
𝒅) 𝒙 . 𝒙

𝒆) 𝒙 + 𝒙 = 𝒙 𝒇) 𝒙 . 𝒙 = 𝒙 𝒈) 𝒙 + 𝟏 = 𝟏 𝒉) 𝒙 . 𝟎 = 𝟎
BOOLEAN ALGEBRA THEOREMS - MULTIVARIABLE
𝒂) 𝒙 + 𝒚 = 𝒚 + 𝒙 𝒃) 𝒙 . 𝒚 = 𝒚 . 𝒙 𝒄) 𝒙. ( 𝒚 + 𝒛 ) = 𝒙 . 𝒚 + 𝒙 . 𝒛

𝒅) 𝒙 + 𝒚 .𝒛 = 𝒙 + 𝒚 . 𝒙 + 𝒛 𝒆) 𝒙 + 𝒙 . 𝒚 = 𝒙

ഥ + 𝒙 .𝒚 = 𝒙
𝒇) 𝒙 ഥ+ 𝒚 𝑷𝒓𝒐𝒐𝒇: ഥ𝒙 + 𝒙 . 𝒚 = 𝒙
ഥ (𝟏) + 𝒙 . 𝒚

ഥ (𝟏 + 𝒚) + 𝒙 . 𝒚
=𝒙

ഥ +𝒙
=𝒙 ഥ 𝒚 + 𝒙 .𝒚

ഥ + 𝒚 (ഥ
=𝒙 𝒙 + 𝒙)
ഥ + 𝒚 (𝟏)
=𝒙
ഥ +𝒚
=𝒙
ഥ. 𝒚 = 𝒙 + 𝒚
𝒈)𝒙 + 𝒙
DEMORGAN’S THEOREMS

Theorem 1: ഥ + Bത
A.B=A Theorem 2: ഥ .Bത
A+B=A

A B A .B A . B ഥ
A ഥ
B ഥ +B
A ഥ A B A+B A+B ഥ
A ഥ
B ഥ .B
A ഥ

0 0 0 1 1 1 1 0 0 0 1 1 1 1

0 1 0 1 1 0 1 0 1 1 0 1 0 0

1 0 0 1 0 1 1 1 0 1 0 0 1 0

1 1 1 0 0 0 0 1 1 1 0 0 0 0
BOOLEAN PROPERTIES

Name of the Property AND OR

Commutative 𝑨 .𝑩 = 𝑩 .𝑨 𝑨 + 𝑩 = 𝑩 +𝑨

Associative (𝑨 . 𝑩) . 𝑪 = 𝑨 . (𝑩 . 𝑪) (𝑨 + 𝑩) + 𝑪 = 𝑨 + (𝑩 + 𝑪)

Distributive 𝑨 . (𝑩 + 𝑪) = 𝑨 . 𝑩 + (A . C) 𝑨 + (𝑩 . 𝑪) = 𝑨 + 𝑩 . (A + C)

Identity 𝑨 .𝟏 = 𝑨 𝑨 + 𝟎 = 𝑨

Complement ഥ =𝟎
𝑨. 𝑨 ഥ =1
𝑨 + 𝑨

De Morgan’s law ഥ + Bത
A.B=A ഥ . Bത
A+B=A
EXAMPLE - COMPLEMENT OF A FUNCTION

Given

Complement of the function


EXAMPLES ON BOOLEAN SIMPLIFICATION
LOGIC GATES
UNIVERSAL LOGIC GATES
• Universal logic gates are the logic gates that are capable of implementing any
Boolean function without requiring any other type of gate.

• They are called as Universal Gates because


• They can be used to realize all the binary operations
• All the basic logic gates can be realized using them.

• They have the following properties


• Universal gates are not associative in nature.
• Universal gates are commutative in nature.
NAND GATE AS UNIVERSAL GATE
NOR GATE AS UNIVERSAL GATE
SELF-ASSESSMENT QUESTIONS

1. What is the result of the expression A⋅B’+C’ when A=1,B=0,C=1?

(a) 0
(b) 1
(c) A
(d) B

2. Which of the following represents the NOR operation?

(a) A.B
(b) A+B
(c) A’. B’
(d) A’+B’
SELF-ASSESSMENT QUESTIONS

3. Which Boolean Algebra law states that changing the order of operands in an AND operation does not
affect the result?

(a) Identity law


(b) Commutative law
(c) Distributive law
(d) Absorption law

4. De Morgan's Law states the relationship between:

(a) AND and OR operations


(b) OR and NOT operations
(c) XOR and NOR operations
(d) NAND and NOR operations
TERMINAL QUESTIONS
Short answer questions:
1. Highlight the advantage of Boolean algebra over normal algebra.
2. What is the complement of a variable? Give an example.
Long answer questions:
1. Discuss the properties of Boolean algebra and how they contribute to simplifying
logic expressions.
2. State De Morgan's laws and provide their significance in Boolean algebra.
3. List and Analyze the use of Single and Multivariable theorems of Boolean algebra.
4. Simplify the following expressions using Boolean laws.
ഥ)
𝐹 = 𝐴. 𝐵 + 𝐴 . (𝐶. 𝐷 + 𝐶. 𝐷 𝐹 = 𝐴. 𝐵. 𝐶 + 𝐴ҧ + 𝐴. 𝐶. 𝐵ത
REFERENCES FOR FURTHER LEARNING OF THE SESSION

Reference Books:
1. Computer System Architecture by M. Morris Mano
2. Fundamentals of Digital Logic with Verilog HDL by Stephen Brown and ZvonkoVranesic

Sites and Web links:


1. https://www.javatpoint.com/boolean-algebra-in-digital-electronics
2. https://www.geeksforgeeks.org/basics-of-boolean-algebra-in-digital-electronics/
THANK YOU

Team – Digital Design & Computer Architecture

You might also like