Scribd
Upload
9 views

BOOLEAN FUNCTIONS AND SIMPLIFICATIONS

Booleans algebra

Uploaded by

ibrahimmaulid551
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 views

BOOLEAN FUNCTIONS AND SIMPLIFICATIONS

Booleans algebra

Uploaded by

ibrahimmaulid551
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/ 9

1.

BOOLEAN FUNCTIONS AND SIMPLIFICATIONS


1.1 Introduction to Boolean Algebra
Definition
Boolean Algebra is the branch of algebra that involves variables with two possible
values, commonly represented as 1 (True) and 0 (False). Boolean algebra is
essential in computer because it provides the logic for how computers process
data. Computer represent everything in binary (0s and 1s), and Boolean algebra is
used to control and manipulate these binary values in circuits. It forms the
foundation of digital logic and computer, as it governs the logic of binary
operations and circuits.
Basic operations in Boolean algebra:
• AND Operation (ˑ)
Both inputs must be True (1) for the output to be True.
forexample; If given variables A and B (inputs) for both A.B (output) to be
True (1) both A and B must be True (1) otherwise False (0).

• OR Operation (+)
Atleast one input must be True for the Output to be True.

• NOT Operation (¬A or 𝐴)


This Operation inverts the input value, so if the input is 1, the output is 0.

1.2 Boolean Functions


Boolean functions combine Boolean variables (e.g., A,B,C) with logical
operations to produce an output.
Example
• F = A + B (OR function between A and B )
• F = A ˑ B (AND function between A and B)
Boolean function are essential because they can represent any logical
statement or condition in digital systems
1.3 Simplification Techniques
Simplifying Boolean expressions is a critical step in digital circuit design
because it helps reduce the number of gates needed, which leads to simpler,
faster and more efficient circuits. Here are the commonly used simplification
techniques in Boolean algebra:
➢ Algebraic Simplification
➢ Karnaugh Maps (k-Maps)
Algebraic Simplification
Algebraic simplification involves using the fundamental Boolean laws to
simplify a given Boolean expression. Here are the basic laws and properties used in
algebraic simplification:
o Identity law:
A + 0 = A and
Aˑ1=A
o Commutative Law:
AˑB=BˑA
A+B=B+A
o Null Law:
A + 1 = 1 and
Aˑ0=0
o Idempotent law:
A + A = A and
AˑA=A
o Complement Law:
A + 𝐴 = 1 and
Aˑ𝐴=0
o Associative Law:
A ˑ ( B ˑ C) = ( A ˑ B) ˑ C
A + ( B + C ) = ( A +B ) + C
o De Morgan’s Law:
➢ 𝐴+𝐵=𝐴+𝐵
➢ 𝐴ˑ𝐵=𝐴ˑ𝐵
o Double Negation Law:
¬(¬A) = A
o Absorption Law:
A + A’ ˑ B = A + B
A( A + B ) = A
By applying these laws, you can simplify Boolean expressions step by step
Example 01
Simplify the following expression
F = A ˑ B + A’ ˑ B + A ˑ C + A’ ˑ C
Soln#01
Given
F = A ˑ B + A’ ˑ B + A ˑ C + A’ ˑ C
Step 1: Combine like terms
F = (A ˑ B + A’ ˑ B) + (A ˑ C + A’ ˑ C)
Step 2: Apply Distributive law
F = ( A + A’ ) ˑ B + ( A + A’ ) ˑ C
Step 3: Apply complement law
F = 1 ˑB + 1 ˑ C
Which simplifies to:
F=B+C
Karnaugh Maps (k-Maps)
2. TRUTH TABLES AND LOGIC GATES
2.1 Introduction to Logic Gates and Truth Table
Logic gates
Logic gates are the fundamental components in digital circuits that perform logical
operations on one or more binary inputs to produce a single output. These logic
gates are used in building more complex digital circuits and systems. Each gate has
a specific role in processing binary data based on the logic it implements.
Truth Table
Is a way to represent the output of a logic gate or combination of gates based on
all possible input combinations. its list all the possible input to a digital circuits and
shows the corresponding output for each combination. Truth tables are essential
in understand how digital circuits work, especially in designing and analyzing
combinational logic circuits like AND, OR, NOT, NAND, NOR, XOR, and XNOR gates.
The following is a breakdown of the most common logic gates with examples,
symbols and description of how they look:
i) AND Gate
This gives output of 1 (True) only if both inputs are 1 (True)
Symbol

Truth Table
A B Output
A AND B
0 0 0
0 1 0
1 0 0
1 1 1
If A = 1 (True) and B = 1 (True), the output will be 1.
ii) OR Gate
Output is 1 (True) if either input is 1.
Symbol

Truth Table
A B Output
A OR B
0 0 0
0 1 1
1 0 1
1 1 1

If A = 0 (False) and B = 1 (True), the output will be 1.

iii) NOT Gate


Here its reverses the input. If input is 0, the output is 1, and vice versa.
Symbol

Truth Table
A Output
(NOT A)
0 1
1 0

If A = 0 (False), the output will be 1.


iv) NAND Gate
Output is 0 (False) if both A AND B are 1 (True) Otherwise is 1 (True).
Symbol

Truth Table
A B Output
(A NAND B)
0 0 1
0 1 1
1 0 1
1 1 0

If A = 1 (True) and B = 1 (True), the output will be 0.

v) NOR Gate
Output is 1 (True) if both A AND B are 0 (False) Otherwise is 0 (False).
Symbol

Truth Table
A B Output
(A NOR B)
0 0 1
0 1 0
1 0 0
1 1 0
vi) XOR Gate (Exclusive OR)
Output is 1 if exactly one of the inputs is 1.

Symbol

Truth Table
A B Output
( A XOR B)
0 0 0
0 1 1
1 0 1
1 1 0

If A = 1 (True) and B = 0 (False), the output will be 1.


vii) XNOR Gate
Output is 1 if Both inputs are the same (Both 0 or Both 1).
Symbol

Truth Table
A B Output
(A XNOR B)
0 0 1
0 1 0
1 0 0
1 1 1
2.2 Combining Logic Gates in Expressions and circuits
Here we use multiple logic gates to form complex expressions or
circuits.
Example
If F = (A AND B) OR C
• Expression
F=(AˑB)+C

• Circuits
A AˑB

B F (Output)

C
Truth Table
A B C AˑB F

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

• Engineers use the Truth Tables to verify that a circuit operates correctly
for all possible input combinations
3. APPLICATIONS IN COMPUTER CIRCUITS
Boolean functions, truth tables and logic gates together create the foundation for
digital circuits and computer systems. by understanding and applying Boolean
algebra, designers can create efficient circuits that perform the essential
operations of modern computing system, from data storage to logical processing
and arithmetic calculations. These concepts are central not only in building
computer hardware but also in developing efficient algorithms and optimizing
overall system performance. Computer circuits come in various types, each serving
a specific function In digital systems. Here are some of the computer circuits with
their application:

You might also like