Scribd
Upload
54 views28 pages

003 Boolean Algebra

Digital Systems use Boolean Algebra and logic gates. Boolean Algebra uses binary logic (1s and 0s) to represent truth values for performing logical operations in digital circuits. The three basic logic gates are OR, AND, and NOT. More complex gates like NAND and NOR can be constructed from these basic gates. Logic circuits are described using Boolean expressions and truth tables, and their outputs can be evaluated for given input values. DeMorgan's theorems provide rules for converting between logical expressions using AND and OR operators. Both NAND and NOR gates are considered "universal" as any logic circuit can be constructed using only one of these gate types.

Uploaded by

Ariana's Euphoria
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
54 views28 pages

003 Boolean Algebra

Digital Systems use Boolean Algebra and logic gates. Boolean Algebra uses binary logic (1s and 0s) to represent truth values for performing logical operations in digital circuits. The three basic logic gates are OR, AND, and NOT. More complex gates like NAND and NOR can be constructed from these basic gates. Logic circuits are described using Boolean expressions and truth tables, and their outputs can be evaluated for given input values. DeMorgan's theorems provide rules for converting between logical expressions using AND and OR operators. Both NAND and NOR gates are considered "universal" as any logic circuit can be constructed using only one of these gate types.

Uploaded by

Ariana's Euphoria
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 28

Digital Systems:

Boolean Algebra
and
Logic Gates
DEFINITION:

Boolean Algebra is the algebra of


truth values and operations
performing on them which is used
in Digital Circuits for performing
logical operations.
Boolean Constants and
Variables
 Logical statements can have either two values yes
or no, true or false, 0 or 1.
 Boolean 0 and 1 do not represent actual
numbers but instead represent the state, or logic
level.
Logic 0 Logic 1
False True
Off On
Low High
No Yes
Open switch Closed switch
Truth
Tables
 A truth table is a means for describing how a logic
circuit’s output depends on the logic levels
present at the circuit’s inputs.

Inputs Output
A B x
1 1 1 A
? x
0 1 0
B
1 0 0
0 0 0
Three Basic Logic
Operators
 OR
 AN
D
 NO
T
OR
Operation
 Boolean expression for the OR
operation: x =A + B
 The above expression is read as “x
equals A OR B”
AND
Operation
 Boolean expression for the AND
operation: x =A B
 The above expression is read as “x equals A
AND B”
NOT
Operation
 The NOT operation is an unary operation, taking only
one input variable.
 Boolean expression for the NOT
operation: x = A
 The above expression is read as “x equals the inverse
of A”
 Also known as inversion or complementation.
 Can also be expressed as: A’

A
LOGIC
GATES
 OR
 AND
 NOT
 NAN
D
 NOR
OR
Gate
 An OR gate is a gate that has two or more
inputs and whose output is equal to the OR
combination of the inputs.
AND
Gate
 An AND gate is a gate that has two or more inputs
and whose output is equal to the AND product of
the inputs.
NOT
Gate
The symbol and Truth Table for NOT gate is given
below:

A
Describing Logic
Circuits Algebraically
 Any logic circuits can be built from the three
basic building blocks: OR, AND, NOT
 Example 1: x = A B + C
 Example 2: x = (A+B)C
 Example 3: x = (A+B)
Examples
1,2
Examples
3
Evaluating Logic-Circuit
Outputs

 x = ABC(A+D)

 Determine the output x given A=0, B=1, C=1,


D=1.
 Can also determine output level from a diagram
Example
s
Draw the Logic
Gate:
 AB+C’D
 A(B+C’) + B’D’
 A’ [ (B+C)’ + AB]

Draw the Truth


Table:
 AB+(BC)’
 A(B’+C’) + BC’
 X’[ (Y+Z)’ + XY]
Derive the Boolean
Expression
NAND
Gate
 Boolean expression for the NAND
operation: x = A B
NOR
Gate
 Boolean expression for the NOR
operation: x = A + B
Boolean Theorems and
Laws
 x* 0 =0 Fallacy
 x+1=1 Tautology
 x*x=x Indempotence Law
 x+x=x Indempotence Law
 x*x’=0 Complementarity
Law
 x+x’=1 Complementarity
Law
 x” = x Involution Law
 x+0=x
 x* 1 =x
Boolean Theorems and
Laws
 x+y = y+x / / Commutative
 x*y = y*x Law
 x+(y+z) = (x+y)+z=x+y+z
 x(yz)=(xy)z=xyz / / Associative Law
 x(y+z)=xy+xz
 (w+x)(y+z)=wy+xy+wz+xz / / Distributive Law
 x+xy=x
/ / Absorption Law
Prove it by Truth Table
De’Morgan’s
Theorems
(Break the line change the
 (x+y)’=x’y’
sign)
 Implications and alternative symbol for NOR
function
 (xy)’=x’+y’
 Implications and alternative symbol for NAND
function
 Process of Demorganization:
(i) Complement entire function
(ii) Change all AND to OR and all OR to AND
(iii) Complement each of the individual variables
Demorgan’s Theorum
Demorgan’s Theorum
Universality of NAND
Gates
Universality of NOR
Gates

You might also like