Scribd
Upload
83 views18 pages

3.3 Logic Gates: - The Three Simplest Gates Are The AND, OR, and NOT Gates

The document discusses logic gates and combinational circuits. It describes the basic logic gates - AND, OR, NOT, XOR, NAND and NOR - and their truth tables. It then explains how combinations of these gates can be used to build more complex combinational circuits like half adders, full adders, decoders, multiplexers, and shifters. NAND and NOR gates are described as universal gates that can be used to implement any Boolean function.

Uploaded by

MOHAMMED IRSHAD
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
83 views18 pages

3.3 Logic Gates: - The Three Simplest Gates Are The AND, OR, and NOT Gates

The document discusses logic gates and combinational circuits. It describes the basic logic gates - AND, OR, NOT, XOR, NAND and NOR - and their truth tables. It then explains how combinations of these gates can be used to build more complex combinational circuits like half adders, full adders, decoders, multiplexers, and shifters. NAND and NOR gates are described as universal gates that can be used to implement any Boolean function.

Uploaded by

MOHAMMED IRSHAD
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/ 18

3.

3 Logic Gates

• The three simplest gates are the AND, OR, and NOT
gates.

• They correspond directly to their respective Boolean


operations, as you can see by their truth tables.
1
3.3 Logic Gates

• Another very useful gate is the exclusive OR


(XOR) gate.
• The output of the XOR operation is true only when
the values of the inputs differ.

Note the special symbol 


for the XOR operation.

2
3.3 Logic Gates

• NAND and NOR


are two very
important gates.
Their symbols and
truth tables are
shown at the right.

3
3.3 Logic Gates

• NAND and NOR


are known as
universal gates
because they are
inexpensive to
manufacture and
any Boolean
function can be
constructed using
only NAND or only
NOR gates.

4
3.3 Logic Gates

• Gates can have multiple inputs and more than one


output.
– A second output can be provided for the complement of
the operation.
– We’ll see more of this later.

5
3.4 Digital Components

• The main thing to remember is that combinations of


gates implement Boolean functions.
• The circuit below implements the Boolean function:

We simplify our Boolean expressions so


that we can create simpler circuits.
6
3.5 Combinational Circuits

• We have designed a circuit that implements the


Boolean function:

• This circuit is an example of a combinational logic


circuit.
• Combinational logic circuits produce a specified
output (almost) at the instant when input values
are applied.
– In a later section, we will explore circuits where this is
not the case.

7
3.5 Combinational Circuits

• Combinational logic circuits


give us many useful devices.
• One of the simplest is the
half adder, which finds the
sum of two bits.
• We can gain some insight as
to the construction of a half
adder by looking at its truth
table, shown at the right.

8
3.5 Combinational Circuits

• As we see, the sum can be


found using the XOR
operation and the carry
using the AND operation.

9
3.5 Combinational Circuits

• We can change our half


adder into to a full adder
by including gates for
processing the carry bit.
• The truth table for a full
adder is shown at the
right.

10
3.5 Combinational Circuits

• How can we change the


half adder shown below
to make it a full adder?

11
3.5 Combinational Circuits

• Here’s our completed full adder.

12
3.5 Combinational Circuits

• Just as we combined half adders to make a full


adder, full adders can connected in series.
• The carry bit “ripples” from one adder to the next;
hence, this configuration is called a ripple-carry
adder.

Today’s systems employ more efficient adders.

13
3.5 Combinational Circuits

• Decoders are another important type of


combinational circuit.
• Among other things, they are useful in selecting a
memory location according a binary value placed
on the address lines of a memory bus.
• Address decoders with n inputs can select any of 2n
locations.
This is a block
diagram for a
decoder.

14
3.5 Combinational Circuits

• This is what a 2-to-4 decoder looks like on the


inside.

If x = 0 and y = 1,
which output line
is enabled?

15
3.5 Combinational Circuits

• A multiplexer does just the


opposite of a decoder.
• It selects a single output
from several inputs.
• The particular input chosen
for output is determined by
the value of the multiplexer’s
control lines.
• To be able to select among n This is a block
diagram for a
inputs, log2n control lines are multiplexer.
needed.
16
3.5 Combinational Circuits

• This is what a 4-to-1 multiplexer looks like on the


inside.

If S0 = 1 and S1 = 0,
which input is
transferred to the
output?

17
3.5 Combinational Circuits

• This shifter
moves the
bits of a
nibble one
position to the
left or right.

If S = 0, in which
direction do the
input bits shift?
18

You might also like