0% found this document useful (0 votes)
4 views

L1 Logic Gates

Uploaded by

Gourav Kumar
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views

L1 Logic Gates

Uploaded by

Gourav Kumar
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 24

Digital Design

Logic Gates and Boolean Algebra


Logic Gates
• A logic gate is a device that acts as a building block for digital circuits.
• They perform basic logical functions that are fundamental to digital
circuits.
The logic and the Gates
• Electrical Circuit Realization
The logic and the Gates
• Ways of Representation: A NOT GATE

Truth Table
Symbol

Boolean Expression
The logic and the Gates
• Ways of Representation: An AND GATE

Truth Table

Symbol

Boolean Expression
The logic and the Gates
• Ways of Representation: An OR GATE

Truth Table

Symbol
Boolean Expression
Basic / Fundamental Gates

NOT Gate

AND Gate

OR Gate
Universal Gates
• Universal logic gates are the logic gates that can implement any Boolean
function without requiring any other type of gate.
• They are called as “Universal Gates” because-
- They can realize all the binary operations.
- All the basic logic gates can be derived from them.
• There are following two universal logic gates-
NAND NOR
The logic of Universal Gates
• A NAND Gate

Boolean Expression
The logic of Universal Gates
• A NOR Gate

Boolean Expression
The logic of Universal Gates
• Basic gates Realization from NAND gate
The logic of Universal Gates
• Difference to Remember
Other / Exclusive Gates
• Have a special purpose of its implementation
• Used for Mathematical Operation and Code Conversion
• Exclusive-OR or simply XOR Gate:
• Exclusive-NOR or simply XNOR:
Other / Exclusive Gates
• XOR Implementation
Other / Exclusive Gates
• XNOR Implementation
XOR and XNOR from NAND and NOR

Making a Circuit

Making a Circuit from Truth-Table

Exercise
• Identify the following Circuits

• Make circuits of following Boolean Expressions


1) Z = (X+Y). Y’
2) Y = AB’C+AB+A’BC’
Boolean Algebra: Axioms and Laws

Boolean Algebra: Axioms and Laws

Practice
Random Examples
Thank You

You might also like