L1 Logic Gates
L1 Logic Gates
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