Scribd
Upload
4 views3 pages

Boolean Algebra Notes

Boolean Algebra is a mathematical framework for binary variables and logical operations, essential in digital logic design and electronic circuits. It includes concepts like truth tables, basic logic gates, postulates, the principle of duality, canonical forms, and Karnaugh maps for simplifying Boolean expressions. These tools and principles are crucial for designing and analyzing digital systems.

Uploaded by

umerwaqar1122
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
4 views3 pages

Boolean Algebra Notes

Boolean Algebra is a mathematical framework for binary variables and logical operations, essential in digital logic design and electronic circuits. It includes concepts like truth tables, basic logic gates, postulates, the principle of duality, canonical forms, and Karnaugh maps for simplifying Boolean expressions. These tools and principles are crucial for designing and analyzing digital systems.

Uploaded by

umerwaqar1122
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 3

Boolean Algebra Notes

1. Introduction to Boolean Algebra


Boolean Algebra is a branch of mathematics that deals with binary variables and logical
operations. It is used extensively in digital logic design, computer science, and electronic
circuits. The variables in Boolean algebra take only two possible values:
 1 (True/High) or
 0 (False/Low).
Boolean algebra forms the foundation for designing and analyzing digital systems and logic
circuits.

2. Truth Table
A truth table is a mathematical table that shows all possible truth values of logical
expressions or Boolean functions. It lists the output of a Boolean expression for every
possible combination of input values.
Example:
For a basic logical AND operation:
A B A AND B
0 0 0
0 1 0
1 0 0
1 1 1
Other logical operations like OR, NOT, XOR, etc., can similarly be represented using truth
tables.

3. Basic Logic Gates


Logic gates are basic building blocks of digital circuits. They perform basic Boolean
functions based on their inputs.
Common Logic Gates:
 AND Gate: Outputs 1 if both inputs are 1.
 OR Gate: Outputs 1 if at least one input is 1.
 NOT Gate: Inverts the input (1 becomes 0, and 0 becomes 1).
 NAND Gate: Outputs 0 if both inputs are 1 (NOT of AND).
 NOR Gate: Outputs 0 if at least one input is 1 (NOT of OR).
 XOR Gate: Outputs 1 if the inputs are different.
 XNOR Gate: Outputs 1 if the inputs are the same (NOT of XOR).
4. Basic Postulates of Boolean Algebra
Boolean algebra follows several basic postulates and laws:
Postulates:
1. Closure: The operations (AND, OR) on Boolean variables result in a Boolean value (0
or 1).
2. Identity Laws:
o A+0=A
o A·1=A
3. Null Law:
o A+1=1
o A·0=0
4. Complement Law:
o A + A′ = 1
o A · A′ = 0
5. Commutative Laws:
o A+B=B+A
o A·B=B·A
6. Distributive Laws:
o A · (B + C) = (A · B) + (A · C)
o A + (B · C) = (A + B) · (A + C)

5. Principle of Duality
The Principle of Duality in Boolean algebra states that every algebraic expression remains
valid if:
1. Operators are interchanged:
o Replace AND (·) with OR (+), and vice versa.
2. Constants are interchanged:
o Replace 0 with 1, and 1 with 0.
Example:
Expression: A + 0 = A Dual: A · 1 = A
This principle highlights the symmetry in Boolean algebra.

6. Canonical Form
Canonical forms are standardized ways of expressing Boolean functions. Two common
canonical forms are:
Sum of Products (SOP):
o Boolean function is expressed as a sum (OR) of product terms (ANDed literals).
o Example: F(A, B, C) = A′B + AB′C
Product of Sums (POS):
o Boolean function is expressed as a product (AND) of sum terms (ORed literals).
o Example: F(A, B, C) = (A + B′) · (A′ + C)
Canonical forms are often used in digital logic design to simplify circuits.
7. Karnaugh Map (K-map)
A Karnaugh Map is a graphical method used to simplify Boolean expressions and minimize
logic circuits. It is a systematic approach to reducing SOP and POS forms.
Features:
 Uses a grid format to represent truth table values.
 Adjacent cells differ by only one variable (Gray code ordering).
Steps to Simplify Boolean Expressions:
1. Create a K-map from the truth table.
2. Group adjacent 1s (for SOP) or 0s (for POS) into rectangles of sizes 1, 2, 4, 8, etc.
3. Write the simplified expression by identifying variables that remain constant in each
group.
Example:
For a truth table with 3 variables (A, B, C), the K-map will have 8 cells:
AB \ C 0 1
00 F1 F2
01 F3 F4
11 F5 F6
10 F7 F8
By grouping 1s and identifying patterns, the Boolean expression can be simplified.

You might also like