Ugenz Academy/IoT Tutorial

Boolean Algebra

7 min read1,260 words

Reading progress

Keep learning

Boolean Algebra in Digital Electronics

1. Introduction

Boolean algebra is a branch of mathematics used to represent and simplify logical operations. It was developed by George Boole and is widely used in digital electronics, computer science, and digital circuit design.

Unlike ordinary algebra, which uses many numerical values, Boolean algebra works with only two values:

  • 0 represents FALSE or LOW.
  • 1 represents TRUE or HIGH.

Boolean algebra helps engineers design simpler, faster, and more efficient digital circuits by reducing the number of logic gates required.

For example, Boolean algebra is used to simplify the logic controlling an LED, an alarm system, a microcontroller, or a processor.

2. Basic Boolean Operations

Boolean algebra has three fundamental operations: AND, OR, and NOT.

A. AND operation

The AND operation produces 1 only when both inputs are 1.

Symbol: ⋅\cdot

Expression:

Y=A⋅BY=A\cdot B
ABY
000
010
100
111

B. OR operation

The OR operation produces 1 when at least one input is 1.

Symbol: ++

Expression:

Y=A+BY=A+B
ABY
000
011
101
111

In Boolean algebra, 1+1=11+1=1, because OR returns 1 whenever either input is 1. This differs from ordinary arithmetic.

C. NOT operation

The NOT operation reverses the input value.

Symbol: Overbar, such as A‾\overline A.

Expression:

Y=A‾Y=\overline A
AY
01
10

The NOT operation is also called complementation or inversion.

3. Important Laws of Boolean Algebra

Boolean algebra has several laws that help simplify logical expressions.

A. Identity laws

These laws show how 0 and 1 affect a Boolean variable.

A+0=A\boxed{A+0=A} A⋅1=A\boxed{A\cdot1=A}

Explanation:

  • OR with 0 leaves the value unchanged.
  • AND with 1 leaves the value unchanged.

B. Null or domination laws

A+1=1\boxed{A+1=1} A⋅0=0\boxed{A\cdot0=0}

Explanation:

  • OR with 1 always produces 1.
  • AND with 0 always produces 0.

C. Idempotent laws

A+A=A\boxed{A+A=A} A⋅A=A\boxed{A\cdot A=A}

Explanation: Combining the same variable with itself using OR or AND does not change its value.

D. Complement laws

A+A‾=1\boxed{A+\overline A=1} A⋅A‾=0\boxed{A\cdot\overline A=0}

Explanation:

  • A variable ORed with its complement always produces 1.
  • A variable ANDed with its complement always produces 0.

E. Involution law

A‾‾=A\boxed{\overline{\overline A}=A}

Taking the complement twice returns the original value.

For example, if A=1A=1, its complement is 0, and the complement of 0 is 1.

4. Commutative Laws

The commutative laws state that changing the order of the variables does not change the result.

OR operation

A+B=B+A\boxed{A+B=B+A}

AND operation

A⋅B=B⋅A\boxed{A\cdot B=B\cdot A}

For example,

A=1,B=0A=1,\quad B=0 A+B=1+0=1A+B=1+0=1 B+A=0+1=1B+A=0+1=1

Both expressions produce the same result.

5. Associative Laws

The associative laws state that changing the grouping of variables does not change the result when the same operation is used.

OR operation

(A+B)+C=A+(B+C)\boxed{(A+B)+C=A+(B+C)}

AND operation

(A⋅B)⋅C=A⋅(B⋅C)\boxed{(A\cdot B)\cdot C=A\cdot(B\cdot C)}

These laws are useful when working with expressions containing three or more variables.

6. Distributive Laws

The distributive laws describe how AND and OR operations can be expanded or factored.

A. AND over OR

A(B+C)=AB+AC\boxed{A(B+C)=AB+AC}

This means that AA is ANDed with each term inside the brackets, and the resulting terms are ORed together.

B. OR over AND

A+BC=(A+B)(A+C)\boxed{A+BC=(A+B)(A+C)}

This is a distinctive feature of Boolean algebra. It resembles the distributive law of ordinary algebra but uses Boolean operations.

These laws are frequently used to simplify digital logic expressions and redesign circuits.

7. Absorption Laws

Absorption laws eliminate unnecessary terms from Boolean expressions.

A+AB=A\boxed{A+AB=A} A(A+B)=A\boxed{A(A+B)=A}

For the first law, A+ABA+AB, whenever A=1A=1, the complete expression is already 1. When A=0A=0, both terms are 0. Therefore, the expression simplifies to AA.

These laws help reduce the number of gates required in a circuit.

8. De Morgan's Theorems

De Morgan's theorems are among the most important rules in Boolean algebra. They explain how to distribute a NOT operation over AND and OR expressions.

First theorem

The complement of an AND operation equals the OR of the complemented inputs.

A⋅B‾=A‾+B‾\boxed{\overline{A\cdot B}=\overline A+\overline B}

Second theorem

The complement of an OR operation equals the AND of the complemented inputs.

A+B‾=A‾⋅B‾\boxed{\overline{A+B}=\overline A\cdot\overline B}

Example

Simplify the expression:

Y=A⋅B‾Y=\overline{A\cdot B}

Using De Morgan's first theorem:

Y=A‾+B‾\boxed{Y=\overline A+\overline B}

Thus, a NAND function can be expressed using inverted inputs followed by an OR operation.

De Morgan's theorems are particularly useful when implementing circuits using NAND or NOR gates.

9. Principle of Duality

The principle of duality states that a valid Boolean identity remains valid when we interchange:

  • OR (+)(+) with AND (⋅)(\cdot).
  • 0 with 1.

For example, consider the identity:

A+0=AA+0=A

Interchanging OR with AND and 0 with 1 gives:

A⋅1=AA\cdot1=A

Both are valid Boolean identities.

This principle helps derive related Boolean laws without proving every law separately.

10. Simplification of Boolean Expressions

Boolean expressions can be simplified using algebraic laws to reduce circuit complexity.

Example 1

Simplify:

Y=A+ABY=A+AB

Using the absorption law:

A+AB=AA+AB=A

Therefore,

Y=A\boxed{Y=A}

The original expression requires an AND gate and an OR gate, while the simplified expression needs only the input AA.

Example 2

Simplify:

Y=AB+AB‾Y=AB+A\overline B

Take AA as the common factor:

Y=A(B+B‾)Y=A(B+\overline B)

Using the complement law:

B+B‾=1B+\overline B=1

Therefore,

Y=A⋅1Y=A\cdot1

The final result is:

Y=A\boxed{Y=A}

Example 3

Simplify:

Y=(A+B)(A+B‾)Y=(A+B)(A+\overline B)

Using the distributive identity:

(A+B)(A+C)=A+BC(A+B)(A+C)=A+BC

where C=B‾C=\overline B,

Y=A+BB‾Y=A+B\overline B

Using the complement law:

BB‾=0B\overline B=0

Therefore,

Y=A+0Y=A+0

The final result is:

Y=A\boxed{Y=A}

11. Summary of Boolean Algebra Laws

LawAND/OR identity
IdentityA+0=A, A⋅1=AA+0=A,\ A\cdot1=A
DominationA+1=1, A⋅0=0A+1=1,\ A\cdot0=0
IdempotentA+A=A, A⋅A=AA+A=A,\ A\cdot A=A
ComplementA+A‾=1, AA‾=0A+\overline A=1,\ A\overline A=0
InvolutionA‾‾=A\overline{\overline A}=A
CommutativeA+B=B+A, AB=BAA+B=B+A,\ AB=BA
Associative(A+B)+C=A+(B+C)(A+B)+C=A+(B+C)
DistributiveA(B+C)=AB+ACA(B+C)=AB+AC
AbsorptionA+AB=AA+AB=A
De Morgan'sAB‾=A‾+B‾\overline{AB}=\overline A+\overline B

12. Applications of Boolean Algebra

Boolean algebra is used in:

  • Digital circuit design: Simplifies logic circuits and reduces gate count.
  • Processor design: Supports arithmetic and logical operations in the ALU.
  • Control systems: Defines conditions for switching devices on or off.
  • Computer programming: Forms the foundation of logical conditions and Boolean expressions.
  • IoT systems: Combines sensor conditions to control LEDs, alarms, motors, and relays.
  • Memory and communication circuits: Supports logic operations and digital signal processing.

Boolean algebra provides the mathematical foundation for designing and simplifying digital circuits. Its laws, especially distributive and absorption laws and De Morgan's theorems, help engineers implement the same logical function using fewer gates and simpler hardware.

Keep learning. Keep building. Keep growing.

© 2026 Ugenz Academy