Scribd
Upload
7 views

Logic Lab6

Uploaded by

engmenna743
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
7 views

Logic Lab6

Uploaded by

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

Mansoura University

Faculty of Computers and Information


Information Technology Department
Course: Digital Logic Design
Code: [IT124P]
First Year

LAB 06:
Full Adder

LAB Objectives
The goal of this lab is to design, realize and verify full adder circuits using basic
gates. After completing this lab:
• Students should be able to produce a truth table for full adder circuits.
• They understand how to extract Boolean expressions for the circuit using
truth table.

• Then they should be able to simplify Boolean expressions and draw


circuits expressing them.
• Finally, they implement circuits on Bread Board using IC 7486, IC 7400,
LEDs and wires.

LAB Content
1. What is an Adder?
An adder is a digital logic circuit in electronics that is extensively used for
the addition of numbers. In many computers and other types of processors, adders
are even used to calculate addresses and related activities and calculate table
indices in the Arithmetic Logic Unit (ALU) and even utilized in other parts of the
processors. Adders can be constructed for most of the numerical representations
like Binary Coded Decimal (BDC), Excess – 3, Gray code, Binary etc. Adders
are basically classified into two types: Half Adder and Full Adder.

2. Full Adder:
Full adder is a digital circuit used to calculate the sum of three binary bits,
which is the main difference between this and half adder. Two of the three bits
are same as before which are A and B. The additional third bit is carry bit from
the previous stage and is called Carry–in, generally represented by CIN. It

1
Mansoura University
Faculty of Computers and Information
Information Technology Department
Course: Digital Logic Design
Code: [IT124P]
First Year
calculates the sum of three bits along including the carry. The output carry is
called Carry–out and is represented by COUT.

0 0 0 1
+0 +1 +0 +1
+0 +1 +1 +1
S=0 C=0 S=0 C=1 S=1 C=0 S=1 C=1

❖ The block diagram of Full adder:

The block diagram of a full adder with A, B and CIN as inputs and S, COUT as
outputs is shown below:

❖ Truth table is:

❖ Boolean functions for sum and carry:


o We can derive the Boolean Expression of Sum as follows:

2
Mansoura University
Faculty of Computers and Information
Information Technology Department
Course: Digital Logic Design
Code: [IT124P]
First Year

o We can derive the Boolean Expression of Carry as follows:


Cout=ĀBCin+AB̅Cin+ABCin̅+ABC
❖ Simplify:
The K-Map for Sum output (S) of a Full Adder is shown below:

Sum: Carry:

With the above-mentioned truth tables, the results can be obtained:

Sum:

Carry:

3
Mansoura University
Faculty of Computers and Information
Information Technology Department
Course: Digital Logic Design
Code: [IT124P]
First Year

❖ Logical Circuit:
Based on the above two equations, the full adder circuit can be implemented
using:

❖ Implementation on breadboard:

4
Mansoura University
Faculty of Computers and Information
Information Technology Department
Course: Digital Logic Design
Code: [IT124P]
First Year

Homework 06:
Student Name
Student ID
Section
Dept.
Year
Date

Part 1:

1. What’s the difference between half adder and full adder?

2. If A, B and C are the inputs of a full adder, what’s the expression function of
sum?

3. If A, B and C are the inputs of a full adder, what’s the expression function of
carry?

5
Mansoura University
Faculty of Computers and Information
Information Technology Department
Course: Digital Logic Design
Code: [IT124P]
First Year

Part 2:

1. Draw Logical Circuits of full adder using NAND gate only.

2. Express sum and carry in terms of min terms and max terms

You might also like