Scribd
Upload
60 views39 pages

Basic Gates

Gates are fundamental building blocks of digital logic circuits that function by opening or closing to admit or reject logical signals. The basic gates are AND, OR, and NOT. AND outputs a 1 only if both inputs are 1, while OR outputs a 1 if either or both inputs are 1. NOT inverts the input signal. NAND and NOR are universal gates that can be combined to perform all logic functions. XOR outputs 1 if the inputs are different, while XNOR outputs 1 if the inputs are the same. Boolean algebra uses operators like AND, OR, and NOT to simplify logic expressions. Karnaugh maps provide a method to simplify logic expressions with multiple variables into minimum logic terms.

Uploaded by

Vijay Barai
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
60 views39 pages

Basic Gates

Gates are fundamental building blocks of digital logic circuits that function by opening or closing to admit or reject logical signals. The basic gates are AND, OR, and NOT. AND outputs a 1 only if both inputs are 1, while OR outputs a 1 if either or both inputs are 1. NOT inverts the input signal. NAND and NOR are universal gates that can be combined to perform all logic functions. XOR outputs 1 if the inputs are different, while XNOR outputs 1 if the inputs are the same. Boolean algebra uses operators like AND, OR, and NOT to simplify logic expressions. Karnaugh maps provide a method to simplify logic expressions with multiple variables into minimum logic terms.

Uploaded by

Vijay Barai
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 39

1

BASIC GATES
2

Gates are the fundamental building blocks of digital logic circuitry. These devices function by
“opening” or “closing” to admit or reject the passage of a logical signal.
3

The different basic gates are:


 AND
 OR
 NOT

1. AND Gate

 A basic AND gate consists of two inputs and an output. If the two inputs are A and B,
the output is “on” only if both A and B are also “on.”
 In digital electronics, the on state is often represented by a 1 and the off state by a 0.
 The relationship between the input signals and the output signals is often
summarized in a truth table, which is a tabulation of all possible inputs and the
resulting outputs. For the AND gate, there are four possible combinations of input
states: A=0, B=0; A=0, B=1; A=1, B=0; and A=1, B=1.
 Truth table:

 Symbol:

2. OR Gate

 The OR gate is also a two-input, single-output gate.


 Unlike the AND gate, the output is 1 when one input, or the other, or both are 1.
 The OR gate output is 0 only when both inputs are 0.
 The OR gate is sort of the reverse of the AND gate.
 The OR function, like its verbal counterpart, allows the output to be true (logic 1) if
any one or more of its inputs are true.
 In symbols, the OR function is designated with a plus sign (+).
 An algebraic function is f = x + y
4

 As with the AND function, the OR function can have any number of inputs.
 The truth table of And can be given as:
x y f
0 0 0
0 1 1
1 0 1
1 1 1
 Where x & y are inputs f is output.
 Symbol:

3. NOT Gate

 It always has exactly one input as well as one output.


 Whatever logical state is applied to the input, the opposite state will appear at the
output.
 The NOT function is denoted by a horizontal bar over the value to be inverted
 In some cases a single quote mark (') may also be used for this purpose: 0' = 1
and 1' = 0.
 The truth table of And can be given as:
x f
0 1
0 0
 Where x & y are inputs f is output.
 Symbol:

UNIVERSAL GATES
The different universal gates are:
 NAND
 NOR

1. NAND Gate
5

 The NAND gate implements the NAND function, which is exactly inverted from
the AND function both inputs must have logic 1 signals applied to them in order
for the output to be a logic 0.
 With either input at logic 0, the output will be held to logic 1.
 There is no limit to the number of inputs that may be applied to a NAND function,
so there is no functional limit to the number of inputs a NAND gate may have.
 The algebraic function is F = (xy) for NAND gate
 Truth table:
x y f
0 0 1
0 1 1
1 0 1
1 1 0
 Symbol:

EXCLUSIVE GATES
The different universal gates are:
 XOR
 XNOR

1 XOR Gate
 The Exclusive-OR, or XOR function is an interesting and useful variation on the
basic OR function.
 The XOR gate produces a logic 1 output only if its two inputs are different.
 If the inputs are the same, the output is a logic 0.
 It consists of a plus (+) sign with a circle around it.
 F = xy’ + x’y = x + y where x & y are inputs.
 TRUTH TABLE:

X y f
0 0 0
0 1 1
6

1 0 1
1 1 0
 SYMBOL:

 Derivation X-OR gate

2 XNOR OR EQUIVALENCE
 Exclusive NOR gate can be defined as F = xy + x’ y’ = x . y
 SYMBOL:

 TRUTH TABLE:
7

 DERIVATION:
8

BOOLEAN ALGEBRA
9
10
11
12

QUESTIONS
13

MINTERM AND MAXTERM

SUM OF PRODUCT
[SOP]

PRODUCT OF SUM
[POS]
14

QUESTIONS
15
16

K – MAPS

STEPS:
 IDENTIFY THE NO OF VARIABLES
 PREPARE K-MAP
 ENTER MINTERM/MAXTERM VALUES
 FORM PAIR,QUAD,OCTET
 FIND EQUATION /REDUCE EQUATION

1 TWO VARIABLE K-MAP


17

2 THREE VARIABLE K-MAP

3 FOUR VARIABLE K-MAP


18

EXAMPLE:

QUESTION
19

EXAMPLE
20
21
22
23
24

QUESTIONS
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39

QUESTIONS

You might also like