Scribd
Upload
660 views

DLD LAB EXP 03 (Derive Logic Equations and Truth Table From Combinational Circuits.) - ACS

This document describes an experiment to derive logic equations and truth tables from combinational circuits. It explains that analyzing combinational circuits allows one to detect the output logic expressions. Truth tables are derived from the logic expressions by observing gate connections. The document provides an example of deriving the logic equations P=A(B+C) and Q=(B+C)D from a sample combinational circuit, as well as the corresponding truth table. It also gives another example of deriving a logic equation for a second sample circuit using NAND and NOR gates. The goal is to learn how to analyze combinational circuits to obtain logic equations and truth tables.

Uploaded by

Sifat
Copyright
© © All Rights Reserved
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
660 views

DLD LAB EXP 03 (Derive Logic Equations and Truth Table From Combinational Circuits.) - ACS

This document describes an experiment to derive logic equations and truth tables from combinational circuits. It explains that analyzing combinational circuits allows one to detect the output logic expressions. Truth tables are derived from the logic expressions by observing gate connections. The document provides an example of deriving the logic equations P=A(B+C) and Q=(B+C)D from a sample combinational circuit, as well as the corresponding truth table. It also gives another example of deriving a logic equation for a second sample circuit using NAND and NOR gates. The goal is to learn how to analyze combinational circuits to obtain logic equations and truth tables.

Uploaded by

Sifat
Copyright
© © All Rights Reserved
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/ 6

Title:

Derive logic equations and truth table from combinational circuits.

Abstract:

Deriving logic equations and truth table from combinational circuits helps a person with
detecting the output logic expressions from any unknown logic circuit. Then truth tables is
derived from the logic expressions by observing the sequence of the gate connections.
Expressions are simplified using Boolean algebra and De Morgan's law to reduce the number of
gates used. The main goal of this experiment is to learn how to derive logic equations and truth
table from combinational circuits.

Theory:

Combinational circuits are built with logic gates and other components. It does not include any
values to be taken from a previous state of the circuit.

Truth table is constructed from considering ABCD as a 4 bit input starting from 0000 to 1111.
Inputs are A, B, C and D on the left. Outputs to be derived are P and Q on the right. Inputs B and
C are passing through an OR gate resulting in the expression B+C. This output is passed through
AND gate with the input A. Output of the AND gate is P.

P=A(B+C)

Output Q is taken from a second AND gate which receives inputs from an inverted output of the
previously mentioned OR gate, (B+C) and D.

Q=(B+C)D

Corresponding outputs are calculated from logic expressions of P and Q.


Inputs are A, B, C and D on the left. The output to be derived is Y on the right. Gates 1 and 3 are
NOT gates. Input of gate 1 is B, output is B. Similarly Input of gate 3 is A, output is A. Gate 2 is
a NOR gate with inputs A and C. Output is A+C. Gate 5 is a NAND gate and it receives inputs
from the output terminals of gates 1 and 2. Which results in an output of

Gate 4 is an X-OR gate which receives inputs from B and C. Output is BC+BC. Gate 7 is an
AND gate and it receives inputs from the output terminals of the gates 3 and 4. Which results in
an output of

Final output Y comes from an OR gate and it receives inputs from the output terminals of the
gates 5 and 7.

Apparatus:

1. Digital trainer board.


2. Integrated Circuits (ICs): OR gate, AND gate, NOR gate, NOT gate, NAND gate, XOR
gate.
3. Connecting wires.
Results:

Truth tables for circuit 1 Truth table for circuit 2

A B C D P Q
A B C Y
0 0 0 0 0 0
0 0 0 1 0 1 0 0 0 0
0 0 1 0 0 0 0 0 1 1
0 0 1 1 0 0 Logic equation for 0 1 0 1 circuit 1:
0 1 0 0 0 0 P=A(B+C) 0 1 1 1 Q=(B+C)D
0 1 0 1 0 0 1 0 0 1
0 1 1 0 0 0 Logic equation for circuit 2:
1 0 1 1
0 1 1 1 0 0
1 0 0 0 0 0 1 1 0 1
1 0 0 1 0 1 1 1 1 1
1 0 1 0 1 0
1 0 1 1 1 0
1 1 0 0 1 0
1 1 0 1 1 0
1 1 1 0 1 0
1 1 1 1 1 0
Discussion:

The main aim of this experiment is to Derive logic equations and truth table from combinational
circuits. By analyzing theoretical and practical data it can be said that both the data is same and
there is no discrepancies. Pin connections for all the ICs were studied. All the connections were
carefully made to avoid errors. The voltage supply was switched off during the implementation.
There was some problem during the experiment because of a faulty IC. The IC was replaced by a
good one instantly. Finally, the experiment was successful by Deriving logic equations and truth
table from combinational circuits.

Question Answer:

The desired circuit for the derived equation by using both NAND and NOR gates is given below:

Using NAND
Using NOR
Simulation:

You might also like