Second Semester_Digital Logic_Simplification of Boolean Functions

Boolean Algebra: Mathematical framework for analyzing logic circuits.
Basic Rules / Laws:
- Identity Law: A + 0 = A, A·1 = A
- Null Law: A + 1 = 1, A·0 = 0
- Idempotent Law: A + A = A, A·A = A
- Complement Law: A + A' = 1, A·A' = 0
- Distributive Law: A·(B + C) = A·B + A·C
- De Morgan’s Theorems:
  - (A·B)' = A' + B'
  - (A + B)' = A'·B'
Purpose: Reduce complexity of logic circuits and minimize number of gates.

K-map: Graphical method to simplify Boolean expressions.
Maps: 2, 3, or 4 variables (can extend to 5-6, but rare in exams).
Steps:
1. Fill K-map using truth table.
2. Group 1’s in powers of 2 (1, 2, 4, 8…).
3. Derive simplified expression for Sum of Products (SOP).
Don’t Care Conditions (X): Inputs that won’t occur, can be used to simplify further.

Canonical Forms:
- Sum of Minterms (SOP): Expression written as sum of AND terms representing 1s in the truth table.
- Product of Maxterms (POS): Expression written as product of OR terms representing 0s in the truth table.
Standard Forms: Simplified version of canonical forms for implementation.
Purpose: Provides systematic method for logic design and circuit realization.

Universal Gates: Can implement any Boolean function using only NAND or NOR gates.
NAND Implementation: Convert all AND, OR, NOT using NAND gates.
NOR Implementation: Convert all AND, OR, NOT using NOR gates.
Advantage: Cost-effective in digital IC design.

Tabular Method: Systematic algorithm for minimizing Boolean functions, especially for more than 4 variables.
Steps:
1. List all minterms.
2. Group minterms by number of 1s.
3. Compare minterms to find prime implicants.
4. Use prime implicant chart to find essential prime implicants.
Useful for computer-aided design (CAD) of logic circuits.

BICTE with ksumanadhikari