Scribd
Upload
616 views8 pages

CS302 - Lab Manual - Week No PDF

This lab experiment discusses building digital logic circuits using decoders. Decoders are circuits with multiple inputs and outputs that accept a binary word as input and output a different binary word. The document provides examples of 3-to-8 and 4-to-16 decoders and their truth tables, and presents tasks to design combinational logic circuits using decoders.

Uploaded by

attique
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
616 views8 pages

CS302 - Lab Manual - Week No PDF

This lab experiment discusses building digital logic circuits using decoders. Decoders are circuits with multiple inputs and outputs that accept a binary word as input and output a different binary word. The document provides examples of 3-to-8 and 4-to-16 decoders and their truth tables, and presents tasks to design combinational logic circuits using decoders.

Uploaded by

attique
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/ 8

Lab Experiment # 10

Building digital logic circuits using Decoders


Objectives
• To learn how to build combinational logic circuits using decoders.

Background
In a Combinational Logic Circuit, the output is dependant at all times on the combination of its inputs.
Some examples of a combinational circuit include Multiplexers, De-multiplexers, Encoders, Decoders,
Full and Half Adders etc.

A Decoder is a circuit with two or more inputs and one or more outputs. Its basic function is to accept a
binary word (code) as an input and create a different binary word as an output.
A B D1 D2 D3 D4
0 0 1 0 0 0
0 1 0 1 0 0
1 0 0 0 1 0
1 1 0 0 0 1

Logic Functions Realized with Decoders:


Example: F = A + B’
= A ( B + B’ ) + B’ ( A + A’ )
= AB + AB’ + A’B’
Drawing Decoders using EWB:

Click on the button on the toolbar, then drag a 741xx digital IC into your workspace. From the list,
select either 74138 (3-8 decoder) or 74154 (4-16 decoder) as shown next.

74138 (3-8 decoder)


The 3-to-8 decoder truth table is shown next:
Select
G2A’ G1 G2B’ C B A Y0 Y1 Y2 Y3 Y4 Y5 Y6 Y7
x x 1 x x x 1 1 1 1 1 1 1 1
x 0 X x x x 1 1 1 1 1 1 1 1
0 1 0 0 0 0 0 1 1 1 1 1 1 1
0 1 0 0 0 1 1 0 1 1 1 1 1 1
0 1 0 0 1 1 1 1 0 1 1 1 1 1
0 1 0 0 1 1 1 1 1 0 1 1 1 1
0 1 0 1 0 0 1 1 1 1 0 1 1 1
0 1 0 1 0 1 1 1 1 1 1 0 1 1
0 1 0 1 1 0 1 1 1 1 1 1 0 1
0 1 0 1 1 1 1 1 1 1 1 1 1 0
Output corresponding to stored address 0; all
1 1 0 x x x
others 1

74154 (4-16 decoder)

Example: drawing a 4-input function using 74154 (Sum of minterms)


Next is the function F(D, C, B, A)=Σ 0 , 7, 8, 10, 13, 15
Example: drawing a 4-input function using 74154 (Product of maxterms)
Next is the function F(D, C, B, A)= Π 11 , 12, 13, 15
Lab Tasks

Task 1: Implementing 3-variable Boolean expressions using 3-8 decoder


Implement the following function using 3-8 decoders.
A B C F
0 0 0 0 1
1 0 0 1 1
2 0 1 0 0
3 0 1 1 1
4 1 0 0 1
5 1 0 1 0
6 1 1 0 0
7 1 1 1 0

The above function can be implemented as shown next. Redraw this circuit using EWB.

Task 2: Implementing multiple 3-variable Boolean expressions using 3-8 decoder


Implement the following three functions using 3-8 decoders.

A B C F1 F2 F3
0 0 0 0 0 1 1
1 0 0 1 1 1 0
2 0 1 0 0 0 1
3 0 1 1 1 1 0
4 1 0 0 0 1 1
5 1 0 1 1 0 0
6 1 1 0 1 0 0
7 1 1 1 0 0 1

Task 3: Problems with verbal description


Design a combinational circuit (using one 4-16 decoder) with four inputs, and one output to implement the
following function.

A B C D F
0 0 0 0 0 0
1 0 0 0 1 1
2 0 0 1 0 0
3 0 0 1 1 1
4 0 1 0 0 0
5 0 1 0 1 0
6 0 1 1 0 1
7 0 1 1 1 1
8 1 0 0 0 1
9 1 0 0 1 0
10 1 0 1 0 1
11 1 0 1 1 0
12 1 1 0 0 1
13 1 1 0 1 0
14 1 1 1 0 0
15 1 1 1 1 1

Task 4: Problems with verbal description


Design a combinational circuit (using two 3-8 decoder) with four inputs, and one output to implement the
following function.

A B C D F
0 0 0 0 0 0
1 0 0 0 1 1
2 0 0 1 0 0
3 0 0 1 1 1
4 0 1 0 0 0
5 0 1 0 1 0
6 0 1 1 0 1
7 0 1 1 1 1
8 1 0 0 0 1
9 1 0 0 1 0
10 1 0 1 0 1
11 1 0 1 1 0
12 1 1 0 0 1
13 1 1 0 1 0
14 1 1 1 0 0
15 1 1 1 1 1

You might also like