[go: up one dir, main page]
Scribd
Upload
11 views2 pages

Digital Computer Fundamentals Unit2

The document provides an overview of Boolean Algebra, its basic theorems, and logic simplification techniques essential for digital logic design. It covers key concepts such as DeMorgan’s Theorems, Boolean functions (SOP and POS), logic gates, and Karnaugh Map simplification. The information is foundational for understanding digital circuits and their implementation.

Uploaded by

sanu63754
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
11 views2 pages

Digital Computer Fundamentals Unit2

The document provides an overview of Boolean Algebra, its basic theorems, and logic simplification techniques essential for digital logic design. It covers key concepts such as DeMorgan’s Theorems, Boolean functions (SOP and POS), logic gates, and Karnaugh Map simplification. The information is foundational for understanding digital circuits and their implementation.

Uploaded by

sanu63754
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/ 2

Digital Computer Fundamentals

Unit 2: Boolean Algebra & Logic Simplification

2.1 Introduction to Boolean Algebra


Boolean Algebra, introduced by George Boole in 1854, deals with binary variables (0 and 1). It is the
foundation of digital logic design.

2.2 Basic Boolean Theorems


Law Equation
Identity A + 0 = A, A · 1 = A
Null A + 1 = 1, A · 0 = 0
Idempotent A + A = A, A · A = A
Complement A + A’ = 1, A · A’ = 0
Double Negation (A’)’ = A
Distributive A · (B + C) = A·B + A·C

2.3 DeMorgan’s Theorems


1. (A · B)’ = A’ + B’
2. (A + B)’ = A’ · B’
Example: F = (AB + C)’ = (AB)’ · C’ = (A’ + B’) · C’

2.4 Boolean Functions and Forms


• SOP (Sum of Products): ORing of multiple AND terms. Example: F(A,B,C) = A’B + BC
• POS (Product of Sums): ANDing of multiple OR terms. Example: F(A,B,C) = (A + B)(A’ + C)
• Canonical Form: Every minterm (SOP) or maxterm (POS) is included.

2.5 Logic Gates


Basic gates: AND, OR, NOT
Universal gates: NAND, NOR
Any circuit can be built using only NAND or only NOR.
Example: Implement Y = A + BC using NAND gates.
Step 1: Write in SOP form → Y = A + (B·C)
Step 2: Use NAND equivalence.

Truth Tables:
Inputs AND OR NOT A
A=0, B=0 0 0 1
A=0, B=1 0 1 1
A=1, B=0 0 1 0
A=1, B=1 1 1 0

2.6 Karnaugh Map (K-Map) Simplification


Graphical method to simplify Boolean expressions. Works commonly up to 4 variables.
Rules:
• Group 1’s in powers of 2 (1,2,4,8,16…).
• Groups can wrap around edges.
• Larger groups = simpler expressions.

Example: Simplify F(A,B,C) = Σ(1,3,5,7)


K-map Table:
AB\C 0 1
00 0 1
01 0 1
11 0 1
10 0 1
Simplified Expression: F = B + C

You might also like