Scribd
Upload
13 views

Logic Gates

This document discusses logical gates and combinatorial circuits. It explores how Boolean algebra is applied in circuit design using basic gates like NOT, AND and OR gates. These gates perform basic Boolean operations and combinatorial circuits use these gates to create outputs that depend only on the current inputs, not any internal state or memory. The document provides examples of how to represent Boolean expressions as circuits using these basic gates.

Uploaded by

22cs103
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
13 views

Logic Gates

This document discusses logical gates and combinatorial circuits. It explores how Boolean algebra is applied in circuit design using basic gates like NOT, AND and OR gates. These gates perform basic Boolean operations and combinatorial circuits use these gates to create outputs that depend only on the current inputs, not any internal state or memory. The document provides examples of how to represent Boolean expressions as circuits using these basic gates.

Uploaded by

22cs103
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/ 31

Learning Objectives

❑Explore the application of Boolean algebra in the


design of electronic circuits. The basic elements of
circuits are gates. Each type of gate implements a
Boolean operation.

❑We will study combinational circuits - the circuits


whose output depends only on the input and not on
the current state of the circuit (no memory).

1
Logical Gates and Combinatorial Circuits

2
Logical Gates and Combinatorial Circuits

3
Logical Gates and Combinatorial Circuits

4
Logical Gates and Combinatorial Circuits
❑In circuitry theory, NOT, AND, and OR gates
are the basic gates. Any circuit can be
designed using these gates. The circuits
designed depend only on the inputs, not on the
output. In other words, these circuits have no
memory. Also these circuits are called
combinatorial circuits.
❑The symbols NOT gate, AND gate, and OR gate
are also considered as basic circuit symbols,
which are used to build general circuits.

5
Logical Gates and Combinatorial Circuits

6
7
8
9
10
11
12
13
14
Draw a circuit diagram for  = (xy' + x'y)z.

15
16
17
18
A circuit for two light switches
EXAMPLE 3, p. 714
❑F(x,y)=1 when the light is on
❑F(x,y)=0 when the light is off
❑When both switches are closed, the light is on:
F(1,1)=1, this implies
❑When we open one switch, the light is off:
F(1,0)=F(0,1)=0
❑When the other switch is also open, the light is on:
F(0,0)=1

19
Thus, we get:

x y F(x,y) Which Boolean expression is given by F?


1 1 1
1 0 0 F(x,y) = xy + x'y'
0 1 0
0 0 1

Draw a circuit for F,


i.e., a circuit to control two light switches.

20
21
22
23
24
25
26
27
28
29
Logical Gates and Combinatorial Circuits
❑ A NOT gate can be
implemented using
a NAND gate (a).

❑ An AND gate can


be implemented
using NAND gates
(b).

❑ An OR gate can be
implemented using
NAND gates (c).

30
Logical Gates and Combinatorial Circuits

❑Any circuit which is designed by using NOT,


AND, and OR gates can also be designed using
only NAND gates.

❑Any circuit which is designed by using NOT,


AND, and OR gates can also be designed using
only NOR gates.

31

You might also like