Scribd
Upload
42 views34 pages

Chapter 2 - Boolean Operation (A)

This document discusses basic logic gates in digital circuits. It defines logic gates as basic elements that have one or more inputs and one output, where the output depends on the logic levels of the inputs. The document explains the symbols, truth tables, and functions of common logic gates like AND, OR, NOT, NOR, NAND, and XOR. It also discusses how Boolean logic expressions can be implemented using only NAND or NOR gates and provides an example of a combinational logic circuit combining multiple gate types.

Uploaded by

sarmillanrao
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
42 views34 pages

Chapter 2 - Boolean Operation (A)

This document discusses basic logic gates in digital circuits. It defines logic gates as basic elements that have one or more inputs and one output, where the output depends on the logic levels of the inputs. The document explains the symbols, truth tables, and functions of common logic gates like AND, OR, NOT, NOR, NAND, and XOR. It also discusses how Boolean logic expressions can be implemented using only NAND or NOR gates and provides an example of a combinational logic circuit combining multiple gate types.

Uploaded by

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

BOOLEAN CHAPTER

OPERATIONS (A) 2
LEARNING OUTCOME

• Simplify logical expressions by


using Boolean algebra and related
techniques orderly.
• Perform correctly basic
arithmetic operations by using
Boolean laws.
BASIC GATES

Basic element to form a digital


system circuit.
It has one terminal output and one
or more terminal input.
The output is depend on the input
whether it is logic 1 or logic 0.
TERMINOLOGIES
BASIC GATES
BASIC GATES

• The total number of possible combinations of binary


inputs to a gate is determined by the following formula:
N= 2n
N= number of possible input combinations
n = number of input variables

 For two input variables: N = 22 = 4 combinations


 For three input variables: N = 23 = 8 combinations
 For four input variables: N = 24 = 16 combinations
AND GATE

Y = A.B
AND GATE

• Ex 1: Draw the logical symbol of 3 input AND gate


AND GATE

• Ex 2: Develop the truth table for a 3-input AND gate.


AND GATE

Ex 3:Determine the total number of possible


input combinations for a 4- input AND gate.

N = 24 = 16.
There are 16 combinations of input bits for a
4- input AND gate.
OR GATE

Y = A+B
OR GATE

• Ex 1:
OR GATE

• Ex 2:
OR GATE
NOT GATE

Y=A
NOT GATE

• Ex 1:
NOR GATE

Y = A+B
NOR GATE

• Ex 1:
NOR GATE
NAND GATE

Y = A.B
NAND GATE
EX-OR GATE

Y = A+B
EX-NOR GATE

Y = A+B

A B Y
0 0 1
0 1 0
1 0 0
1 1 1
LOGIC GATE REPLACEMENT
LOGIC GATE REPLACEMENT
LOGIC GATE REPLACEMENT
• Boolean expression also could be implemented by using
NAND gate or NOR gate only.
LOGIC GATE REPLACEMENT
• Boolean expression also could be implemented by using
NAND gate or NOR gate only.
COMBINATIONAL LOGIC CIRCUIT

• Combination logic circuit means


combination of AND gate, NAND, NOR and
OR in one circuit.
COMBINATIONAL LOGIC CIRCUIT
COMBINATIONAL LOGIC CIRCUIT
COMBINATIONAL LOGIC CIRCUIT
• Diagram below represent a logic element where the output
is high if majority input is high.
COMBINATIONAL LOGIC CIRCUIT
COMBINATIONAL LOGIC CIRCUIT
COMBINATIONAL LOGIC CIRCUIT

You might also like