0% found this document useful (0 votes)
19 views

Lesson 05 - Decoders

The document discusses combinational logic building blocks such as decoders. It explains that decoders are combinational logic circuits that convert binary inputs to outputs. Specifically, an n-input decoder converts n binary inputs to 2^n unique outputs. The document provides examples of 2-to-4 and 3-to-8 decoders and explains their truth tables and internal structures using AND or NAND gates. It also discusses implementing functions using decoders and external OR gates by expressing the function in Sum of Products form and matching the number of inputs. Worked examples show implementing a full adder and another function using 3-input decoders and gates.

Uploaded by

ekong1912
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
19 views

Lesson 05 - Decoders

The document discusses combinational logic building blocks such as decoders. It explains that decoders are combinational logic circuits that convert binary inputs to outputs. Specifically, an n-input decoder converts n binary inputs to 2^n unique outputs. The document provides examples of 2-to-4 and 3-to-8 decoders and explains their truth tables and internal structures using AND or NAND gates. It also discusses implementing functions using decoders and external OR gates by expressing the function in Sum of Products form and matching the number of inputs. Worked examples show implementing a full adder and another function using 3-input decoders and gates.

Uploaded by

ekong1912
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 14

LESSON – 07B

Combinational Logic Circuits

Building Blocks Continued

By

Dr Moses Ubaru
November 22, 2 Introduction to Digital Design Page 1
023
Combinational Building Blocks
 Commonly used building blocks
include:
 Full adders
 Priority circuits
 Seven segment display decoder
 Multiplexers
 Decoders
 Etc

November 22, 2 Introduction to Digital Design Page 2


023
DECODER

Combinational Logic Implementation

Using

Decoders

November 22, 2 Introduction to Digital Design Page 3


023
Decoders

A decoder is a combinational logic circuit that converts


binary information from n-input lines to a maximum of 2 n
unique outputs.

Also called the n-to-m line decoders


 For example: 2-to-4 line decoder
 3-to-8 line decoder


November 22, 2 Introduction to Digital Design Page 4
023
Decoders
 Decoders

 Generally:
The inner structure of Decoders is composed of an array of
AND or NAND gates that generate the required minterm.

November 22, 2 Introduction to Digital Design Page 5


023
Decoder Implementation
 2:4 Decoder Truth Table A B

A B D3 D2 D1 D0

0 0 0 0 0 1 D3
0 1 0 0 1 0
D2
1 0 0 1 0 0
D1
1 1 1 0 0 0

D0

November 22, 2 Introduction to Digital Design Page 6


023
NAND Decoder with Enable Line

Truth Table for E A B


2:4 Decoder with Enable line
E A B D3 D2 D1 D0

1 X X 1 1 1 1 D3
0 0 0 1 1 1 0
D2
0 0 1 1 1 0 1
D1
0 1 0 1 0 1 1

0 1 1 0 1 1 1
D0

November 22, 2 Introduction to Digital Design Page 7


023
Decoders
2 – to – 4 line Decoder

 One or more input control line may be used to


control the operation of decoder

Decoders with enable lines can work as


demultiplexer where data is provided through the
enable lines and the input variables are used to select
specific output channel

November 22, 2 Introduction to Digital Design Page 8


023
Combinational Circuit Implementation Using Decoder

 Since decoders produce 2n minterms of n-input variables,


an external OR gates can be used to form a logical function
in SOP form
 To implement a given function with decoder and
external gates:
 -express the function as canonical SOP
 -select decoder that has no of inputs equal to the number
of input variables in the given functions,
 -select the proper external gate

 See Example in the following slides.


November 22, 2 Introduction to Digital Design Page 9
023
DECODER

Example
E.g. Implement full adder circuit whose outputs are
given as:

 S(A,B,C) = Σ(1, 2, 4, 7)

 C(A,B,C) = Σ(3, 5, 6, 7)

With a suitable decoder and external gates

November 22, 2 Introduction to Digital Design Page 10


023
Decoders
 Implementation of full adder circuit using a suitable
decoder and external gates.

0
1 S
2
3
4
A A 5
B B 6 C
C C 7

November 22, 2 Introduction to Digital Design Page 11


023
DECODER
Example 2

Implement the function F(x, y, z) = m (1, 2, 6, 7)


using a decoder and external gates.

November 22, 2 Introduction to Digital Design Page 12


023
Decoders
 Implementation of the function
F(x, y, z) = m (1, 2, 6, 7)
using a suitable decoder and external gates.
0
1
2
3 F
4
X A 5
Y B 6
Z C 7

November 22, 2 Introduction to Digital Design Page 13


023
DECODER
Example 3

November 22, 2 Introduction to Digital Design Page 14


023

You might also like